{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:34:35Z","timestamp":1740123275755,"version":"3.37.3"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2024,6,22]],"date-time":"2024-06-22T00:00:00Z","timestamp":1719014400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,6,22]],"date-time":"2024-06-22T00:00:00Z","timestamp":1719014400000},"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":["Ann Oper Res"],"published-print":{"date-parts":[[2024,10]]},"DOI":"10.1007\/s10479-024-06096-0","type":"journal-article","created":{"date-parts":[[2024,6,22]],"date-time":"2024-06-22T08:01:56Z","timestamp":1719043316000},"page":"1135-1149","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Robust vertex centdian facility location problem on tree networks"],"prefix":"10.1007","volume":"341","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":[[2024,6,22]]},"reference":[{"key":"6096_CR1","unstructured":"Aloulou, M. A., 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":"6096_CR2","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 Applied Mathematics, 127(3), 505\u2013522.","journal-title":"Discrete Applied Mathematics"},{"issue":"2","key":"6096_CR3","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. European Journal of Operational Research, 123(2), 92\u2013302.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"6096_CR4","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1287\/ijoc.12.2.104.11897","volume":"12","author":"I Averbakh","year":"2000","unstructured":"Averbakh, I., & Berman, O. (2000). Minmax regret median location on a network under uncertainty. INFORMS Journal on Computing, 12(2), 104\u2013110.","journal-title":"INFORMS Journal on Computing"},{"key":"6096_CR5","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1002\/net.10062","volume":"41","author":"I Averbakh","year":"2003","unstructured":"Averbakh, I., & Berman, O. (2003). An improved algorithm for the minmax regret median problem on tree. Networks, 41, 97\u2013103.","journal-title":"Networks"},{"key":"6096_CR6","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/PL00011380","volume":"88","author":"A Ben-Tal","year":"2000","unstructured":"Ben-Tal, A., & Nemirovski, A. (2000). Robust solutions of Linear Programming problems contaminated with uncertain data. Mathematical Programming, 88, 411\u2013424.","journal-title":"Mathematical Programming"},{"key":"6096_CR7","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1287\/opre.1030.0065","volume":"52","author":"D Bertsimas","year":"2004","unstructured":"Bertsimas, D., & Sim, M. (2004). The price of robustness. Operations Research, 52, 35\u201353.","journal-title":"Operations Research"},{"issue":"1\u20134","key":"6096_CR8","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1023\/A:1020711416254","volume":"110","author":"RE Burkard","year":"2002","unstructured":"Burkard, R. E., & Dollani, H. (2002). A note on the robust $$ 1 $$-center problem on trees. Annals of Operations research, 110(1\u20134), 69\u201382.","journal-title":"Annals of Operations research"},{"key":"6096_CR9","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1002\/(SICI)1097-0037(199803)31:2<93::AID-NET4>3.0.CO;2-E","volume":"31","author":"B Chen","year":"1998","unstructured":"Chen, B., & Lin, C. S. (1998). Minmax regret robust 1-median location on a tree. Networks, 31, 93\u2013103.","journal-title":"Networks"},{"issue":"2","key":"6096_CR10","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/j.orl.2007.05.009","volume":"36","author":"E Conde","year":"2008","unstructured":"Conde, E. (2008). A note on the minmax regret Centdian location on tree. Operations Research Letters, 36(2), 271\u2013275.","journal-title":"Operations Research Letters"},{"key":"6096_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-24488-9","volume-title":"Combinatorial optimization: Theory and algorithms","author":"B Korte","year":"2012","unstructured":"Korte, B., & Vygen, J. (2012). Combinatorial optimization: Theory and algorithms (Vol. 5). Springer."},{"key":"6096_CR12","first-page":"491","volume-title":"Multicriteria optimization","author":"M Ehrgott","year":"2005","unstructured":"Ehrgott, M. (2005). Multicriteria optimization (p. 491). UK, vol: Springer."},{"issue":"3","key":"6096_CR13","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1287\/opre.13.3.462","volume":"13","author":"SL Hakimi","year":"1965","unstructured":"Hakimi, S. L. (1965). Optimal distribution of switching centers in a communications and some related graph-theoric problems. Operations Research, 13(3), 462\u2013475.","journal-title":"Operations Research"},{"issue":"5","key":"6096_CR14","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1287\/mnsc.24.5.535","volume":"24","author":"J Halpern","year":"1978","unstructured":"Halpern, J. (1978). Finding minimal center-median convex combination of a graph. Management Science, 24(5), 535\u2013544.","journal-title":"Management Science"},{"issue":"28","key":"6096_CR15","doi-asserted-by":"publisher","first-page":"722","DOI":"10.1287\/opre.28.3.722","volume":"28","author":"J Halpern","year":"1980","unstructured":"Halpern, J. (1980). Duality in the centdian of a graph. Operations Research, 28(28), 722\u2013735.","journal-title":"Operations Research"},{"issue":"2","key":"6096_CR16","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1111\/j.1467-9787.1976.tb00966.x","volume":"16","author":"J Halpern","year":"1979","unstructured":"Halpern, J. (1979). The location of a center-median convex combination on an undirected tree. Journal of Regional Science, 16(2), 237\u2013245.","journal-title":"Journal of Regional Science"},{"issue":"3","key":"6096_CR17","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1137\/0137040","volume":"37","author":"O Kariv","year":"1979","unstructured":"Kariv, O., & Hakimi, S. L. (1979). An algorithmic approach to network location problems. I: The p-centers. SIAM Journal on Applied Mathematics, 37(3), 513\u2013538.","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"6096_CR18","unstructured":"Kouvelis, P., Vairaktarakis, G. L., & 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."},{"key":"6096_CR19","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.omega.2017.02.004","volume":"75","author":"H Li","year":"2018","unstructured":"Li, H., Luo, T., Xu, Y., & Xu, J. (2018). Minmax regret vertex centdian location problem on in general dynamic networks. Omega, 75, 87\u201396.","journal-title":"Omega"},{"key":"6096_CR20","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1287\/opre.43.2.264","volume":"43","author":"JM Mulvey","year":"1995","unstructured":"Mulvey, J. M., Vanderbei, R., & Zenios, S. A. (1995). Robust optimization of large-scale systems. Operations Research, 43, 264\u2013281.","journal-title":"Operations Research"},{"issue":"1","key":"6096_CR21","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1111\/j.1538-4632.1970.tb00142.x","volume":"2","author":"CS Revelle","year":"1970","unstructured":"Revelle, C. S., & Swain, R. W. (1970). Central facilities location. Geographical Analysis, 2(1), 30\u201342.","journal-title":"Geographical Analysis"},{"issue":"5","key":"6096_CR22","doi-asserted-by":"publisher","first-page":"1154","DOI":"10.1287\/opre.21.5.1154","volume":"21","author":"AL Soyster","year":"1973","unstructured":"Soyster, A. L. (1973). Technical note$$ - $$Convex programming with set-inclusive constraints and applications to inexact linear programming. Operation Research, 21(5), 1154\u20131157.","journal-title":"Operation Research"},{"issue":"4","key":"6096_CR23","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1002\/(SICI)1097-0037(199812)32:4<255::AID-NET2>3.0.CO;2-O","volume":"32","author":"A Tamir","year":"1998","unstructured":"Tamir, A., Perez-Brito, D., & Moreno-Perez, J. A. (1998). A polynomial algorithm for the p-centdian problem on a tree. Network, 32(4), 255\u2013262.","journal-title":"Network"},{"issue":"6","key":"6096_CR24","doi-asserted-by":"publisher","first-page":"1363","DOI":"10.1287\/opre.19.6.1363","volume":"19","author":"CR Toregas","year":"1971","unstructured":"Toregas, C. R., Swain, R., & Bergman, L. (1971). The location of emergency service facilities. Operations Research, 19(6), 1363\u20131373.","journal-title":"Operations Research"},{"key":"6096_CR25","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/0167-6377(96)00021-1","volume":"19","author":"A Tamir","year":"1996","unstructured":"Tamir, A. (1996). An $$ O(pn^{2}) $$ algorithm for the p-median and the related problems in tree graphs. Operations Research Letters, 19, 59\u201364.","journal-title":"Operations Research Letters"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-024-06096-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-024-06096-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-024-06096-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,15]],"date-time":"2024-10-15T15:50:55Z","timestamp":1729007455000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-024-06096-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,22]]},"references-count":25,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2024,10]]}},"alternative-id":["6096"],"URL":"https:\/\/doi.org\/10.1007\/s10479-024-06096-0","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"type":"print","value":"0254-5330"},{"type":"electronic","value":"1572-9338"}],"subject":[],"published":{"date-parts":[[2024,6,22]]},"assertion":[{"value":"17 September 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 June 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 June 2024","order":3,"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":"Ethical approval"}}]}}