{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,16]],"date-time":"2025-06-16T17:40:02Z","timestamp":1750095602116,"version":"3.41.0"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T00:00:00Z","timestamp":1743638400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T00:00:00Z","timestamp":1743638400000},"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":[[2025,6]]},"DOI":"10.1007\/s10479-025-06583-y","type":"journal-article","created":{"date-parts":[[2025,4,5]],"date-time":"2025-04-05T10:28:39Z","timestamp":1743848919000},"page":"1553-1573","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: formulations and algorithms"],"prefix":"10.1007","volume":"349","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3043-8404","authenticated-orcid":false,"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":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1594-7750","authenticated-orcid":false,"given":"Juan A.","family":"Mesa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,4,3]]},"reference":[{"issue":"1","key":"6583_CR1","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1287\/ijoc.1110.0472","volume":"25","author":"Q Botton","year":"2013","unstructured":"Botton, Q., Fortz, B., Gouveia, L., & Poss, M. (2013). Benders decomposition for the hop-constrained survivable network design problem. INFORMS Journal on Computing, 25(1), 13\u201326.","journal-title":"INFORMS Journal on Computing"},{"key":"6583_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: Definitions and properties. Unpublished manuscript. (In preparation)","DOI":"10.2139\/ssrn.4645382"},{"key":"6583_CR3","doi-asserted-by":"publisher","first-page":"105417","DOI":"10.1016\/j.cor.2021.105417","volume":"137","author":"V Bucarey","year":"2022","unstructured":"Bucarey, V., Fortz, B., Gonz\u00e1lez-Blanco, N., Labb\u00e9, M., & Mesa, J. A. (2022). Benders decomposition for network design covering problems. Computers & Operations Research, 137, 105417.","journal-title":"Computers & Operations Research"},{"key":"6583_CR4","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"},{"issue":"1","key":"6583_CR5","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/s10107-018-1299-8","volume":"178","author":"M Conforti","year":"2019","unstructured":"Conforti, M., & Wolsey, L. A. (2019). \u201cFacet\u2019\u2019 separation with one linear program. Mathematical Programming, 178(1), 361\u2013380.","journal-title":"Mathematical Programming"},{"issue":"3","key":"6583_CR6","doi-asserted-by":"publisher","first-page":"882","DOI":"10.1016\/j.ejor.2018.12.021","volume":"275","author":"J-F Cordeau","year":"2019","unstructured":"Cordeau, J.-F., Furini, F., & Ljubi\u0107, I. (2019). Benders decomposition for very large scale partial set covering and maximal covering location problems. European Journal of Operational Research, 275(3), 882\u2013896.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"6583_CR7","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/S0377-2217(02)00647-1","volume":"152","author":"J D\u0131az-B\u00e1nez","year":"2004","unstructured":"D\u0131az-B\u00e1nez, J., Mesa, J. A., & Sch\u00f6bel, A. (2004). Continuous location of dimensional structures. European Journal of Operational Research, 152(1), 22\u201344.","journal-title":"European Journal of Operational Research"},{"issue":"5","key":"6583_CR8","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1016\/j.orl.2009.05.007","volume":"37","author":"B Fortz","year":"2009","unstructured":"Fortz, B., & Poss, M. (2009). An improved benders decomposition applied to a multi-layer network design problem. Operations Research Letters, 37(5), 359\u2013364.","journal-title":"Operations Research Letters"},{"key":"6583_CR9","doi-asserted-by":"publisher","first-page":"105853","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":"6583_CR10","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":"6583_CR11","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":"6583_CR12","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":"2","key":"6583_CR13","first-page":"195","volume":"41","author":"MC L\u00f3pez-De-Los-Mozos","year":"2003","unstructured":"L\u00f3pez-De-Los-Mozos, M. C., & Mesa, J. A. (2003). The sum of absolute differences on a network: Algorithm and comparison with other equality measures. INFOR: Information Systems and Operational Research, 41(2), 195\u2013210.","journal-title":"INFOR: Information Systems and Operational Research"},{"key":"6583_CR14","doi-asserted-by":"crossref","unstructured":"Magnanti, T. L., Mireault, P., & Wong, R. T. (1986). In G. Gallo & C. Sandi (Eds.), Tailoring Benders decomposition for uncapacitated network design (pp. 112\u2013154). Springer.","DOI":"10.1007\/BFb0121090"},{"issue":"1","key":"6583_CR15","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/s10479-008-0388-0","volume":"169","author":"\u00c1G Mar\u00edn","year":"2009","unstructured":"Mar\u00edn, \u00c1. G., & Jaramillo, P. (2009). Urban rapid transit network design: Accelerated benders decomposition. Annals of Operations Research, 169(1), 35\u201353.","journal-title":"Annals of Operations Research"},{"issue":"1","key":"6583_CR16","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/BF01580665","volume":"10","author":"GP McCormick","year":"1976","unstructured":"McCormick, G. P. (1976). Computability of global solutions to factorable nonconvex programs: Part i\u2014convex underestimating problems. Mathematical Programming, 10(1), 147\u2013175.","journal-title":"Mathematical Programming"},{"issue":"3","key":"6583_CR17","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":"3","key":"6583_CR18","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1016\/S0166-218X(02)00599-1","volume":"130","author":"JA Mesa","year":"2003","unstructured":"Mesa, J. A., Puerto, J., & Tamir, A. (2003). Improved algorithms for several network location problems with equality measures. Discrete Applied Mathematics, 130(3), 437\u2013448.","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"6583_CR19","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":"5","key":"6583_CR20","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"},{"issue":"1","key":"6583_CR21","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/s10479-014-1628-0","volume":"223","author":"M Schmidt","year":"2014","unstructured":"Schmidt, M., & Sch\u00f6bel, A. (2014). Location of speed-up subnetworks. Annals of Operations Research, 223(1), 379\u2013401.","journal-title":"Annals of Operations Research"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-025-06583-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-025-06583-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-025-06583-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,16]],"date-time":"2025-06-16T17:09:16Z","timestamp":1750093756000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-025-06583-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4,3]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,6]]}},"alternative-id":["6583"],"URL":"https:\/\/doi.org\/10.1007\/s10479-025-06583-y","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"type":"print","value":"0254-5330"},{"type":"electronic","value":"1572-9338"}],"subject":[],"published":{"date-parts":[[2025,4,3]]},"assertion":[{"value":"3 January 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 March 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 April 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"}},{"value":"This article does not contain studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical Approval"}}]}}