Abstract
This paper is concerned with the robust 1-center location problems on the tree networks under minmax and minmax regret criteria, where the vertex weights and edge lengths of the underlying tree are considered as dynamic data or discrete set of scenarios. In the problem under minmax criterion, the aim is to find a point on the tree such that it minimizes the maximum cost. The problem under minmax regret asks to find a point on the tree such that minimizes the maximum regret. We develop the first optimal solution algorithms with polynomial time complexities for the problems under investigation.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Ackermann W (1928) Zum Hilbertschen Aufbau der reellen zahlen. Math Ann 99(1):118–133
Agarwal PK, Scharzkopf O, Sharir M (1996) The overlay of lower envelopes and its applications. Discrete Comput Geom 15(1):1–13
Aloulou MA, Kalai R, Vanderpooten D (2005) Minmax regret 1-center problem on a network with a discrete set of scenarios. Cahiers de Recherche en Ligne du LAMSADE-Document (132)
Averbakh I (2003) Complexity of robust single facility location problems on networks with uncertain edge lengths. Discrete Appl Math 127(3):505–522
Averbakh I, Berman O (1997) Minmax regret \(p\)-center location on a network with demand uncertainty. Location Sci 5(4):247–254
Averbakh I, Berman O (2000) Algorithms for the robust 1-center problem on a tree. Eur J Oper Res 123(2):92–302
Bhattacharya B, Kameda T, Song Z (2012) Minmax regret 1-center on a path/cycle/tree. In 6th Int’l Conf. on Advanced Engineering Computing and Applications in Sciences (ADVCOMP), 108–113
Bhattacharya B, Kameda T, Song Z (2014) Improved minmax regret 1-center algorithms for cactus networks with c cycles. Latin American Symposium on Theoretical Informatics. Springer, Berlin, pp 330–341
Bhattacharya B, Kameda T, Song Z (2015) Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks. Discrete Appl Math 195:18–30
Burkard RE, Dollani H (2002) A note on the robust 1-center problem on trees. Ann Oper Res 110(1–4):69–82
Dearing PM, Francis RL (1974) A minmax location problems on networks. Transport Sci 8(4):333–343
Handler GY (1973) Minmax location of a facility in an undirected tree graph. Transport Sci 7(3):287–293
Hakimi SL (1965) Optimal distribution of switching centers in a communications and some related graph-theoric problems. Oper Res 13(3):462–475
Kariv O, Hakimi SL (1979) An algorithmic approach to network location problems. I. The \(p\)-centers. SIAM J Appl Math 37(3):513–538
Kouvelis P, Vairaktarakis GL, Yu G (1993) Robust 1-median location on a tree in the presence of demand and transportation cost uncertainty. Department of Industrial and Systems Engineering, University of Florida, Gainesville
Lin TC, Yu HI, Wang BF (2006) Improved algorithms for the minmax regret 1-center and \( 1- \)median problem. International Symposium on Algorithms and Computation, Springer, Berlin, pp 537–546
Megiddo N (1983) Linear-time algorithms for linear programming in \( {\cal{R} }^{3} \) and related problems. SIAM J Comput 12(4):759–776
Megiddo N, Tamir A (1983) New results on the complexity of \(p\)-center problems. SIAM J Comput 12(4):751–758
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The authors declare that they have no conflict of interest.
Human Participants
This article does not contain any studies with human participants or animals performed by any of the authors.
Additional information
Communicated by Carlos Hoppen.
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Seyyedi Ghomi, S., Baroughi, F. New approaches to the robust 1-center location problems on tree networks. Comp. Appl. Math. 41, 407 (2022). https://doi.org/10.1007/s40314-022-02128-2
Received:
Revised:
Accepted:
Published:
DOI: https://doi.org/10.1007/s40314-022-02128-2