Abstract
The nestedness property has become an increasingly important means for devising efficient algorithms for network location problems. There have been attempts to explore the nestedness property of network location problems with some special cases of the convex ordered median objectives. However, there is little research on the nestedness property for those problems with the concave ordered median objectives. This paper constructs a tree network T and shows that the nestedness property cannot hold for the concave ordered median problem, which fills a gap in the research on the nestedness property. Finally, the authors pose an open problem on identifying the nestedness property for the continuous strategic ordered median problem.
Similar content being viewed by others
References
Mirchandani P B and Francis R L, Discrete Location Theory, Wiley, New York, 1990.
Daskin M S, Network and Discrete Location: Models, Algorithms, and Applications, Wiley-Inter science, 1995.
Drezner Z, Facility Location: A Survey of Applications and Methods, Springer, Berlin, 1995.
Labbé M, Peeters D, and Thisse J F, Location on Networks, In Ball M O, Magnanti T L, Monma C L, and Nemhauser G L, editors, Network Routing, Volume 8 of Handbooks in OR and MS, Elsevier, 1995.
Kalcsics J, Nickel S, and Puerto J, Multi-facility ordered median problems: A further analysis, Networks, 2003, 41(1): 1–12.
Puerto J, Lectures en teoria de localization, Technical Report, Universidad de Sevilla, Secretariado de Publicationes, 1996.
Drezner Z and Hamacher H W, Facility Location: Applications and Theory, Springer, Berlin, 2002.
Minieka E, The optimal location of a path or tree in a tree network, Networks, 1985, 15: 309–321.
Wang B F, Efficient parallel algorithms for optimally locating a path and a tree of a specific length in a weighted tree network, Journal of Algorithms, 2000, 34: 90–108.
Tamir A, Puerto J, and Perez-Brito D, The centdian subtree on tree networks, Discrete Applied Mathematics, 2002, 18: 263–278.
Puerto J and Tamir A, Locating tree-shaped facilities using the ordered median objective, Mathematical Programming, 2005, 102: 313–338.
Tang H J, Cheng T C E, and Ng C T, The centdian subtree on tree networks, Computers & IE, 2009, 57: 707–712.
Tang H J, Cheng T C E, and Ng C T, Multi-facility ordered median problems in directed networks, Journal of Systems Science and Complexity, 2011, 24(1): 61–67.
Tang H J, Cheng T C E, and Ng C T, The sub-tree ordered median problem in networks based on nestedness property, Journal of Industrial and Management Optimization, 2012, 8: 41–49.
Nickel S and Puerto J, A unified approach to network location problems, Networks, 1999, 34: 283–290.
Author information
Authors and Affiliations
Corresponding author
Additional information
This research is supported by the Macau Foundation under Grant No. 0249 and National Natural Science Foundation of China under Grant No. 70901050.
This paper was recommended for publication by Editor DI Zengru.
Rights and permissions
About this article
Cite this article
Tang, H. A note on the nestedness property for ordered median problems in tree networks. J Syst Sci Complex 26, 335–340 (2013). https://doi.org/10.1007/s11424-013-1283-6
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11424-013-1283-6