{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T12:54:34Z","timestamp":1740142474048,"version":"3.37.3"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2022,11,23]],"date-time":"2022-11-23T00:00:00Z","timestamp":1669161600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,11,23]],"date-time":"2022-11-23T00:00:00Z","timestamp":1669161600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2022,12]]},"DOI":"10.1007\/s40314-022-02128-2","type":"journal-article","created":{"date-parts":[[2022,11,24]],"date-time":"2022-11-24T20:49:04Z","timestamp":1669322944000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["New approaches to the robust 1-center location problems on tree networks"],"prefix":"10.1007","volume":"41","author":[{"given":"Soudabeh","family":"Seyyedi Ghomi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9963-4772","authenticated-orcid":false,"given":"Fahimeh","family":"Baroughi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,11,23]]},"reference":[{"issue":"1","key":"2128_CR1","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/BF01459088","volume":"99","author":"W Ackermann","year":"1928","unstructured":"Ackermann W (1928) Zum Hilbertschen Aufbau der reellen zahlen. Math Ann 99(1):118\u2013133","journal-title":"Math Ann"},{"issue":"1","key":"2128_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02716576","volume":"15","author":"PK Agarwal","year":"1996","unstructured":"Agarwal PK, Scharzkopf O, Sharir M (1996) The overlay of lower envelopes and its applications. Discrete Comput Geom 15(1):1\u201313","journal-title":"Discrete Comput Geom"},{"key":"2128_CR3","unstructured":"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)"},{"issue":"3","key":"2128_CR4","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1016\/S0166-218X(02)00384-0","volume":"127","author":"I Averbakh","year":"2003","unstructured":"Averbakh I (2003) Complexity of robust single facility location problems on networks with uncertain edge lengths. Discrete Appl Math 127(3):505\u2013522","journal-title":"Discrete Appl Math"},{"issue":"4","key":"2128_CR5","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/S0966-8349(98)00033-3","volume":"5","author":"I Averbakh","year":"1997","unstructured":"Averbakh I, Berman O (1997) Minmax regret $$p$$-center location on a network with demand uncertainty. Location Sci 5(4):247\u2013254","journal-title":"Location Sci"},{"issue":"2","key":"2128_CR6","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/S0377-2217(99)00257-X","volume":"123","author":"I Averbakh","year":"2000","unstructured":"Averbakh I, Berman O (2000) Algorithms for the robust 1-center problem on a tree. Eur J Oper Res 123(2):92\u2013302","journal-title":"Eur J Oper Res"},{"key":"2128_CR7","unstructured":"Bhattacharya B, Kameda T, Song Z (2012) Minmax regret 1-center on a path\/cycle\/tree. In 6th Int\u2019l Conf. on Advanced Engineering Computing and Applications in Sciences (ADVCOMP), 108\u2013113"},{"key":"2128_CR8","first-page":"330","volume-title":"Improved minmax regret 1-center algorithms for cactus networks with c cycles. Latin American Symposium on Theoretical Informatics","author":"B Bhattacharya","year":"2014","unstructured":"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\u2013341"},{"key":"2128_CR9","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/j.dam.2014.10.022","volume":"195","author":"B Bhattacharya","year":"2015","unstructured":"Bhattacharya B, Kameda T, Song Z (2015) Minmax regret 1-center algorithms for path\/tree\/unicycle\/cactus networks. Discrete Appl Math 195:18\u201330","journal-title":"Discrete Appl Math"},{"issue":"1\u20134","key":"2128_CR10","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1023\/A:1020711416254","volume":"110","author":"RE Burkard","year":"2002","unstructured":"Burkard RE, Dollani H (2002) A note on the robust 1-center problem on trees. Ann Oper Res 110(1\u20134):69\u201382","journal-title":"Ann Oper Res"},{"issue":"4","key":"2128_CR11","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1287\/trsc.8.4.333","volume":"8","author":"PM Dearing","year":"1974","unstructured":"Dearing PM, Francis RL (1974) A minmax location problems on networks. Transport Sci 8(4):333\u2013343","journal-title":"Transport Sci"},{"issue":"3","key":"2128_CR12","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1287\/trsc.7.3.287","volume":"7","author":"GY Handler","year":"1973","unstructured":"Handler GY (1973) Minmax location of a facility in an undirected tree graph. Transport Sci 7(3):287\u2013293","journal-title":"Transport Sci"},{"issue":"3","key":"2128_CR13","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1287\/opre.13.3.462","volume":"13","author":"SL Hakimi","year":"1965","unstructured":"Hakimi SL (1965) Optimal distribution of switching centers in a communications and some related graph-theoric problems. Oper Res 13(3):462\u2013475","journal-title":"Oper Res"},{"issue":"3","key":"2128_CR14","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1137\/0137040","volume":"37","author":"O Kariv","year":"1979","unstructured":"Kariv O, Hakimi SL (1979) An algorithmic approach to network location problems. I. The $$p$$-centers. SIAM J Appl Math 37(3):513\u2013538","journal-title":"SIAM J Appl Math"},{"key":"2128_CR15","volume-title":"Robust 1-median location on a tree in the presence of demand and transportation cost uncertainty","author":"P Kouvelis","year":"1993","unstructured":"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"},{"key":"2128_CR16","doi-asserted-by":"crossref","unstructured":"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\u2013546","DOI":"10.1007\/11940128_54"},{"issue":"4","key":"2128_CR17","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1137\/0212052","volume":"12","author":"N Megiddo","year":"1983","unstructured":"Megiddo N (1983) Linear-time algorithms for linear programming in $$ {\\cal{R} }^{3} $$ and related problems. SIAM J Comput 12(4):759\u2013776","journal-title":"SIAM J Comput"},{"issue":"4","key":"2128_CR18","doi-asserted-by":"publisher","first-page":"751","DOI":"10.1137\/0212051","volume":"12","author":"N Megiddo","year":"1983","unstructured":"Megiddo N, Tamir A (1983) New results on the complexity of $$p$$-center problems. SIAM J Comput 12(4):751\u2013758","journal-title":"SIAM J Comput"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-022-02128-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-022-02128-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-022-02128-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,13]],"date-time":"2022-12-13T10:24:06Z","timestamp":1670927046000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-022-02128-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,23]]},"references-count":18,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["2128"],"URL":"https:\/\/doi.org\/10.1007\/s40314-022-02128-2","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"type":"print","value":"2238-3603"},{"type":"electronic","value":"1807-0302"}],"subject":[],"published":{"date-parts":[[2022,11,23]]},"assertion":[{"value":"27 June 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 November 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 November 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 November 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Human Participants"}}],"article-number":"407"}}