{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T20:43:49Z","timestamp":1770324229249,"version":"3.49.0"},"reference-count":32,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2016,5,1]],"date-time":"2016-05-01T00:00:00Z","timestamp":1462060800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2016,5,1]],"date-time":"2016-05-01T00:00:00Z","timestamp":1462060800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["EURO Journal on Computational Optimization"],"published-print":{"date-parts":[[2016,5]]},"DOI":"10.1007\/s13675-015-0035-x","type":"journal-article","created":{"date-parts":[[2015,3,5]],"date-time":"2015-03-05T09:48:36Z","timestamp":1425548916000},"page":"137-166","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":17,"title":["Optimal capacitated ring trees"],"prefix":"10.1016","volume":"4","author":[{"given":"Alessandro","family":"Hill","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Vo\u00df","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1007\/s13675-015-0035-x_CR1","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/s101070100234","article-title":"Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem","volume":"91","author":"Ahuja","year":"2000","journal-title":"Math Program"},{"key":"10.1007\/s13675-015-0035-x_CR2","first-page":"9","article-title":"Capacitated minimum spanning trees: algorithms using intelligent search","volume":"1","author":"Amberg","year":"1996","journal-title":"Comb Optim Theory Pract"},{"issue":"6","key":"10.1007\/s13675-015-0035-x_CR3","doi-asserted-by":"crossref","first-page":"1147","DOI":"10.1287\/opre.1070.0432","article-title":"The capacitated m-ring-star problem","volume":"55","author":"Baldacci","year":"2007","journal-title":"Oper Res"},{"key":"10.1007\/s13675-015-0035-x_CR4","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/s10479-009-0650-0","article-title":"Exact algorithms for routing problems under vehicle capacity constraints","volume":"175","author":"Baldacci","year":"2010","journal-title":"Ann Oper Res"},{"issue":"1-3","key":"10.1007\/s13675-015-0035-x_CR5","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/BF01582573","article-title":"The Steiner tree problem i: formulations, compositions and extension of facets","volume":"64","author":"Chopra","year":"1994","journal-title":"Math Program"},{"issue":"3","key":"10.1007\/s13675-015-0035-x_CR6","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1287\/opre.45.3.378","article-title":"A branch-and-cut algorithm for the symmetric generalized traveling salesman problem","volume":"45","author":"Fischetti","year":"1997","journal-title":"Oper Res"},{"key":"10.1007\/s13675-015-0035-x_CR7","series-title":"Design of survivable networks with bounded rings","author":"Fortz","year":"2000"},{"issue":"6","key":"10.1007\/s13675-015-0035-x_CR8","doi-asserted-by":"crossref","first-page":"866","DOI":"10.1287\/opre.48.6.866.12390","article-title":"Solving the two-connected network with bounded meshes problem","volume":"48","author":"Fortz","year":"2000","journal-title":"Oper Res"},{"issue":"1-3","key":"10.1007\/s13675-015-0035-x_CR9","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF01582064","article-title":"The steiner tree polytope and related polyhedra","volume":"63","author":"Goemans","year":"1994","journal-title":"Math Program"},{"key":"10.1007\/s13675-015-0035-x_CR10","series-title":"The vehicle routing problem : latest advances and new challenges. Operations Research\/Computer Science Interfaces Series","author":"Golden","year":"2008"},{"issue":"2","key":"10.1007\/s13675-015-0035-x_CR11","doi-asserted-by":"crossref","first-page":"550","DOI":"10.1016\/j.cor.2010.07.016","article-title":"Models for a traveling purchaser problem with additional side-constraints","volume":"38","author":"Gouveia","year":"2011","journal-title":"Comput Oper Res"},{"key":"10.1007\/s13675-015-0035-x_CR12","unstructured":"Gr\u00f6tschel M, Raack C, Werner A (2013) Towards optimizing the deployment of optical access networks. EURO J Comput Optim. 10.1007\/s13675-013-0016-x"},{"key":"10.1007\/s13675-015-0035-x_CR13","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1007\/BF01584070","article-title":"The traveling-salesman problem and minimum spanning trees: part ii","volume":"1","author":"Held","year":"1971","journal-title":"Math Program"},{"key":"10.1007\/s13675-015-0035-x_CR14","series-title":"Numerical methods and applications, lecture notes in computer science","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-3-319-15585-2_10","article-title":"Multi-exchange neighborhoods for the capacitated ring tree problem","author":"Hill","year":"2015"},{"key":"10.1007\/s13675-015-0035-x_CR15","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/j.endm.2009.11.018","article-title":"A branch-and-cut-and-price approach for the capacitated m-ring-star problem","volume":"35","author":"Hoshino","year":"2009","journal-title":"Electron Notes Discrete Math"},{"issue":"1","key":"10.1007\/s13675-015-0035-x_CR16","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1002\/net.3230220105","article-title":"Steiner tree problems","volume":"22","author":"Hwang","year":"1992","journal-title":"Networks"},{"issue":"1","key":"10.1007\/s13675-015-0035-x_CR17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/net.20072","article-title":"Design of survivable networks: a survey","volume":"46","author":"Kerivin","year":"2005","journal-title":"Networks"},{"key":"10.1007\/s13675-015-0035-x_CR18","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1002\/(SICI)1097-0037(199810)32:3<207::AID-NET5>3.0.CO;2-O","article-title":"Solving steiner tree problems in graphs to optimality","volume":"32","author":"Koch","year":"1998","journal-title":"Networks"},{"issue":"3","key":"10.1007\/s13675-015-0035-x_CR19","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1002\/net.10114","article-title":"The ring star problem: polyhedral analysis and exact algorithm","volume":"43","author":"Labb\u00e9","year":"2004","journal-title":"Networks"},{"issue":"1","key":"10.1007\/s13675-015-0035-x_CR20","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/s10107-002-0336-8","article-title":"Multistars, partial multistars and the capacitated vehicle routing problem","volume":"94","author":"Letchford","year":"2002","journal-title":"Math Program"},{"issue":"1","key":"10.1007\/s13675-015-0035-x_CR21","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/j.ejor.2013.01.044","article-title":"Compact formulations of the steiner traveling salesman problem and related problems","volume":"228","author":"Letchford","year":"2013","journal-title":"Eur J Oper Res"},{"key":"10.1007\/s13675-015-0035-x_CR22","unstructured":"Magnanti T, Wolsey L (1994) Optimal trees. CORE Discussion Papers 1994026, Universit\u00e9 catholique de Louvain, Center for Operations Research and Econometrics (CORE)"},{"key":"10.1007\/s13675-015-0035-x_CR23","series-title":"Encyclopedia of optimization","first-page":"1643","article-title":"Integer programming: branch and cut algorithms","author":"Mitchell","year":"2009"},{"key":"10.1007\/s13675-015-0035-x_CR24","series-title":"The vehicle routing problem","first-page":"53","article-title":"Branch-and-cut algorithms for the capacitated VRP","author":"Naddef","year":"2001"},{"issue":"3","key":"10.1007\/s13675-015-0035-x_CR25","doi-asserted-by":"crossref","first-page":"1227","DOI":"10.1016\/j.ejor.2010.06.030","article-title":"A heuristic procedure for the capacitated m-ring-star problem","volume":"207","author":"Naji-Azimi","year":"2010","journal-title":"Eur J Oper Res"},{"issue":"4","key":"10.1007\/s13675-015-0035-x_CR26","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/0305-0548(80)90022-2","article-title":"Degree-constrained minimum spanning tree","volume":"7","author":"Narula","year":"1980","journal-title":"Comput Oper Res"},{"issue":"3","key":"10.1007\/s13675-015-0035-x_CR27","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1002\/net.20371","article-title":"SNDlib 1.0-survivable network design library","volume":"55","author":"Orlowski","year":"2010","journal-title":"Networks"},{"issue":"1-3","key":"10.1007\/s13675-015-0035-x_CR28","first-page":"78","article-title":"Traveling purchaser problem","volume":"18","author":"Ramesh","year":"1981","journal-title":"Opsearch"},{"key":"10.1007\/s13675-015-0035-x_CR29","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/S0166-218X(01)00255-4","article-title":"Variable neighborhood search for the degree-constrained minimum spanning tree problem","volume":"118","author":"Ribeiro","year":"2001","journal-title":"Discrete Appl Math"},{"issue":"5","key":"10.1007\/s13675-015-0035-x_CR30","doi-asserted-by":"crossref","first-page":"281","DOI":"10.2307\/2303897","article-title":"A theorem on graphs, with an application to a problem of traffic control","volume":"46","author":"Robbins","year":"1939","journal-title":"Am Math Monthly"},{"key":"10.1007\/s13675-015-0035-x_CR31","series-title":"Design of survivable networks, vol 1531 of Lecture Notes in Mathematics","author":"Stoer","year":"1992"},{"key":"10.1007\/s13675-015-0035-x_CR32","series-title":"Handbook of optimization in telecommunications","first-page":"459","article-title":"Steiner tree problems in telecommunications","author":"Vo\u00df","year":"2006"}],"container-title":["EURO Journal on Computational Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13675-015-0035-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13675-015-0035-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192440621000599?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192440621000599?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13675-015-0035-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T03:46:11Z","timestamp":1761882371000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S2192440621000599"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,5]]},"references-count":32,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,5]]}},"alternative-id":["S2192440621000599"],"URL":"https:\/\/doi.org\/10.1007\/s13675-015-0035-x","relation":{},"ISSN":["2192-4406"],"issn-type":[{"value":"2192-4406","type":"print"}],"subject":[],"published":{"date-parts":[[2016,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Optimal capacitated ring trees","name":"articletitle","label":"Article Title"},{"value":"EURO Journal on Computational Optimization","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1007\/s13675-015-0035-x","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2016 The author(s). Published by Elsevier B.V. on behalf of Association of European Operational Research Societies (EURO). Published by Elsevier Ltd All rights reserved.","name":"copyright","label":"Copyright"}]}}