{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,9]],"date-time":"2025-05-09T04:05:01Z","timestamp":1746763501258,"version":"3.40.5"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,3,7]],"date-time":"2025-03-07T00:00:00Z","timestamp":1741305600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,3,7]],"date-time":"2025-03-07T00:00:00Z","timestamp":1741305600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100004837","name":"Ministerio de Ciencia e Innovaci\u00f3n","doi-asserted-by":"publisher","award":["PID2020-114594GB-C21"],"award-info":[{"award-number":["PID2020-114594GB-C21"]}],"id":[{"id":"10.13039\/501100004837","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Programa Operativo FEDER\/Andaluc\u00eda","award":["US-1381656"],"award-info":[{"award-number":["US-1381656"]}]},{"name":"Instituto Sistemas Complejos de Ingenier\u00eda","award":["ANID PIA AFB230002"],"award-info":[{"award-number":["ANID PIA AFB230002"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2025,4]]},"DOI":"10.1007\/s10479-025-06536-5","type":"journal-article","created":{"date-parts":[[2025,3,7]],"date-time":"2025-03-07T07:41:06Z","timestamp":1741333266000},"page":"1193-1211","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On $$\\lambda $$-cent-dians and generalized-center for network design: definitions and properties"],"prefix":"10.1007","volume":"347","author":[{"given":"V\u00edctor","family":"Bucarey","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0587-3209","authenticated-orcid":false,"given":"Natividad","family":"Gonz\u00e1lez-Blanco","sequence":"additional","affiliation":[]},{"given":"Martine","family":"Labb\u00e9","sequence":"additional","affiliation":[]},{"given":"Juan A.","family":"Mesa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,3,7]]},"reference":[{"issue":"6","key":"6536_CR1","doi-asserted-by":"publisher","first-page":"3435","DOI":"10.1111\/itor.13120","volume":"29","author":"L Amorosi","year":"2022","unstructured":"Amorosi, L., & Puerto, J. (2022). Two-phase strategies for the bi-objective minimum spanning tree problem. International Transactions in Operational Research, 29(6), 3435\u20133463.","journal-title":"International Transactions in Operational Research"},{"key":"6536_CR2","doi-asserted-by":"crossref","unstructured":"Bucarey, V., Gonz\u00e1lez-Blanco, N., Labb\u00e9, M., & Mesa, J.A.(2024). On $$\\lambda $$-Cent-Dians and Generalized-Center for Network Design: solving the problem. Unpublished manuscript. In preparation","DOI":"10.2139\/ssrn.4645382"},{"key":"6536_CR3","first-page":"165","volume":"2","author":"E Carrizosa","year":"1994","unstructured":"Carrizosa, E. (1994). An axiomatic approach to the cent-dian criterion. Location Science, 2, 165\u2013171.","journal-title":"Location Science"},{"key":"6536_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-64018-7","volume-title":"Network Design with Applications to Transportation and Logistics","author":"TG Crainic","year":"2021","unstructured":"Crainic, T. G., Gendreau, M., & Gendron, B. (2021). Network Design with Applications to Transportation and Logistics. Berlin\/Heidelberg: Springer."},{"key":"6536_CR5","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2022.105853","volume":"144","author":"K Gokbayrak","year":"2022","unstructured":"Gokbayrak, K. (2022). A two-level off-grid electric distribution problem on the continuous space. Computers & Operations Research, 144, 105853.","journal-title":"Computers & Operations Research"},{"issue":"2","key":"6536_CR6","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1111\/j.1467-9787.1976.tb00966.x","volume":"16","author":"J Halpern","year":"1976","unstructured":"Halpern, J. (1976). 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":"5","key":"6536_CR7","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 (cent-dian) of a graph. Management Science, 24(5), 535\u2013544.","journal-title":"Management Science"},{"issue":"1","key":"6536_CR8","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1051\/ro\/1991250100731","volume":"25","author":"P Hansen","year":"1991","unstructured":"Hansen, P., Labb\u00e9, M., & Thisse, J.-F. (1991). From the median to the generalized center. RAIRO-Operations Research-Recherche Op\u00e9rationnelle, 25(1), 73\u201386.","journal-title":"RAIRO-Operations Research-Recherche Op\u00e9rationnelle"},{"issue":"3","key":"6536_CR9","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1137\/0137041","volume":"37","author":"O Kariv","year":"1979","unstructured":"Kariv, O., & Hakimi, S. L. (1979). An algorithmic approach to network location problems ii: The p-medians. SIAM Journal on Applied Mathematics, 37(3), 539\u2013560.","journal-title":"SIAM Journal on Applied Mathematics"},{"issue":"3","key":"6536_CR10","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"},{"issue":"3","key":"6536_CR11","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1016\/0377-2217(95)00321-5","volume":"95","author":"JA Mesa","year":"1996","unstructured":"Mesa, J. A., & Boffey, T. B. (1996). A review of extensive facility location in networks. European Journal of Operational Research, 95(3), 592\u2013603.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"6536_CR12","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/S0966-8349(97)00009-0","volume":"5","author":"W Ogryczak","year":"1997","unstructured":"Ogryczak, W. (1997). On cent-dians of general networks. Location Science, 5(1), 15\u201328.","journal-title":"Location Science"},{"issue":"3","key":"6536_CR13","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1287\/ijoc.1090.0342","volume":"22","author":"A Przybylski","year":"2010","unstructured":"Przybylski, A., Gandibleux, X., & Ehrgott, M. (2010). A recursive algorithm for finding all nondominated extreme points in the outcome set of a multiobjective integer programme. INFORMS Journal on Computing, 22(3), 371\u2013386.","journal-title":"INFORMS Journal on Computing"},{"issue":"5","key":"6536_CR14","doi-asserted-by":"publisher","first-page":"2988","DOI":"10.1111\/itor.13363","volume":"31","author":"MA Pozo","year":"2024","unstructured":"Pozo, M. A., Puerto, J., & Rold\u00e1n, I. (2024). The biobjective minimum-cost perfect matching problem and chinese postman problem. International Transactions in Operational Research, 31(5), 2988\u20133009.","journal-title":"International Transactions in Operational Research"},{"issue":"5","key":"6536_CR15","doi-asserted-by":"publisher","first-page":"1069","DOI":"10.1016\/j.dam.2008.03.035","volume":"157","author":"J Puerto","year":"2009","unstructured":"Puerto, J., Ricca, F., & Scozzari, A. (2009). Extensive facility location problems on networks with equity measures. Discrete Applied Mathematics, 157(5), 1069\u20131085.","journal-title":"Discrete Applied Mathematics"},{"key":"6536_CR16","volume-title":"Multiple-criteria Optimization: Theory","author":"RE Steuer","year":"1986","unstructured":"Steuer, R. E. (1986). Multiple-criteria Optimization: Theory. New York: Computation and Applications. John Wiley and Sons."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-025-06536-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-025-06536-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-025-06536-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,8]],"date-time":"2025-05-08T16:23:20Z","timestamp":1746721400000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-025-06536-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,7]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,4]]}},"alternative-id":["6536"],"URL":"https:\/\/doi.org\/10.1007\/s10479-025-06536-5","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"type":"print","value":"0254-5330"},{"type":"electronic","value":"1572-9338"}],"subject":[],"published":{"date-parts":[[2025,3,7]]},"assertion":[{"value":"1 March 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 February 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 March 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"All authors declare that they have no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}