TOP

pp 1–26 | Cite as

The nestedness property of location problems on the line

Original Paper
  • 14 Downloads

Abstract

We prove the existence of a nestedness property for a family of common convex parametric tactical serving facility location problems defined on the line. The parameter t is the length of the serving facility (closed interval). The nestedness property means that, given any two facility lengths \(t_1, t_2, 0 \le t_1<t_2\), there is an optimal solution with length \(t_1\) which lies within some optimal solution with length \(t_2\). The main idea of the proof is the representation of a serving facility as a point in \({\mathbb {R}}^2\) and the investigation of its geometrical properties. An intuitive graphical approach to the proof is given.

Keywords

Location problem Convex ordered median Nestedness Extensive facility 

Mathematics Subject Classification

90C25 90C27 90C31 90C35 

References

  1. Aurenhammer F (1991) Voronoi diagrams—a survey of a fundamental geometric data structure. ACM Comput Surv 23(3):345–405CrossRefGoogle Scholar
  2. Bhattacharya B, Shi Q, Tamir A (2009) Optimal algorithms for the path/tree-shaped facility location problems in trees. Algorithmica 55:601–618CrossRefGoogle Scholar
  3. Hakimi SL, Schmeichel EF, Labbe M (1993) On locating path or tree shaped facilities on networks. Networks 23:543–555CrossRefGoogle Scholar
  4. Hedetniemi SM, Cockaine EJ, Hedetniemi ST (1981) Linear algorithms for finding the Jordan center and path center of a tree. Transp Sci 15:98–114CrossRefGoogle Scholar
  5. Kalcsics J, Nickel S, Puerto J, Tamir A (2002) Algorithmic results for ordered median problems. Oper Res Lett 30:149–158CrossRefGoogle Scholar
  6. Lazar A, Tamir A (2013) Improved algorithms for some competitive location centroid problems on paths, trees and graphs. Algorithmica 66:615–640CrossRefGoogle Scholar
  7. Mesa JA, Boffey TB (1996) A review of extensive facility location in networks. Eur J Oper Res 95(3):592–603CrossRefGoogle Scholar
  8. Minieka E (1980) Conditional centers and medians on a graph. Networks 10:265–272CrossRefGoogle Scholar
  9. Minieka E (1980) The optimal location of a path or tree in a tree network. Networks 10:265–272CrossRefGoogle Scholar
  10. Nickel S (2000) Discrete ordered weber problems. In: Operations Research Proceedings, pp 71–76Google Scholar
  11. Nickel S, Puerto J (2005) Location theory. A unified approach. Springer, BerlinGoogle Scholar
  12. Ogryczak W, Tamir A (2003) Minimizing the sum of the \(k\) largest functions in linear time. Inf Proc Lett 85:117–222CrossRefGoogle Scholar
  13. Puerto J, Fernández FR (2000) Geometrical properties of the symmetrical single facility location problem. J Nonlinear Convex Anal 1(3):321–342Google Scholar
  14. Puerto J, Rodríguez-Chía AM, Tamir A (2017) Revisiting \(k\)-sum optimization. Math Program 165:579–604CrossRefGoogle Scholar
  15. Puerto J, Tamir A (2005) Locating tree-shaped facilities using the ordered median objective. Math Program A 102:313–338CrossRefGoogle Scholar
  16. Rodríguez-Chía AM, Nickel S, Puerto J, Fernández FR (2000) A flexible approach to location problems. Math Method Oper Res 51:69–89CrossRefGoogle Scholar
  17. Rozanov M (2015) The nestedness property of the convex ordered median location problem on a tree. M.Sc. Thesis, Tel-Aviv University. http://primage.tau.ac.il/libraries/theses/exeng/free/3257656.pdf
  18. Tamir A, Puerto J, Mesa JA, Rodríguez-Chía AM (2005) Conditional location of path and tree shaped facilities on trees. J Algebra 56:50–75Google Scholar
  19. Tang H (2013) A note on the nestedness property for ordered median problems in tree networks. J Syst Sci Complex 26:335–340CrossRefGoogle Scholar
  20. Tang H, Cheng TCE, Ng CT (2012) A note on subtree ordered median problem in networks based on nestedness property. J Ind Manag Optim 8:41–49CrossRefGoogle Scholar
  21. Zemel E (1984) An O(n) algorithm for the linear multiple choice knapsack problem and related problems. Inf Proc Lett 18:123–128CrossRefGoogle Scholar

Copyright information

© Sociedad de Estadística e Investigación Operativa 2018

Authors and Affiliations

  1. 1.Sackler Faculty of Exact SciencesTel Aviv UniversityTel AvivIsrael

Personalised recommendations