{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,15]],"date-time":"2025-08-15T01:24:05Z","timestamp":1755221045334,"version":"3.43.0"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"2-4","license":[{"start":{"date-parts":[[2002,12,1]],"date-time":"2002-12-01T00:00:00Z","timestamp":1038700800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,12,1]],"date-time":"2002-12-01T00:00:00Z","timestamp":1038700800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Telecommunication Systems"],"published-print":{"date-parts":[[2002,12]]},"DOI":"10.1023\/a:1020954800383","type":"journal-article","created":{"date-parts":[[2003,3,20]],"date-time":"2003-03-20T19:19:47Z","timestamp":1048187987000},"page":"301-318","source":"Crossref","is-referenced-by-count":3,"title":["Ring Network Design by Lagrangean Based Column Generation"],"prefix":"10.1007","volume":"21","author":[{"given":"M.","family":"Henningsson","sequence":"first","affiliation":[]},{"given":"K.","family":"Holmberg","sequence":"additional","affiliation":[]},{"given":"M.","family":"R\u00f6nnqvist","sequence":"additional","affiliation":[]},{"given":"P.","family":"V\u00e4rbrand","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5101113_CR1","first-page":"297","volume":"2","author":"M. DellAmico","year":"1995","unstructured":"M. DellAmico, F. Maffioli and P. V\u00e4rbrand, On prize-collecting tours and the asymmetric traveling salesman problem, International Transactions in Operational Research 2 (1995) 297\u2013308.","journal-title":"International Transactions in Operational Research"},{"key":"5101113_CR2","unstructured":"M. Fischetti and P. Toth, An additive approach for the optimal solution of the prize-collecting travelling salesman problem, Vehicle Routing: Methods and Studies (1988) 319\u2013343."},{"key":"5101113_CR3","unstructured":"M. Gendreau, M. Labb\u00e9 and G. Laporte, Efficient heuristics for the design of ring networks, Technical Report, Institut de Statistique, Universit\u00e9 Libre De Bruxelles (1994)."},{"issue":"4","key":"5101113_CR4","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1080\/05695557808975227","volume":"10","author":"D. Gensch","year":"1978","unstructured":"D. Gensch, An industrial application of the traveling salesmans subtour problem, AIIE Transactions 10(4) (1978) 362\u2013370.","journal-title":"AIIE Transactions"},{"key":"5101113_CR5","series-title":"Working paper","volume-title":"A ring network design problem","author":"M. Henningsson","year":"1998","unstructured":"M. Henningsson, K. Holmberg, M. R\u00f6nnqvist and P. V\u00e4rbrand, A ring network design problem, Working paper, LiTH-MAT-OPT-WP-98-03, Department of Mathematics, Link\u00f6ping Institute of Technology, Sweden (1998)."},{"key":"5101113_CR6","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1016\/0377-2217(85)90284-X","volume":"20","author":"R.V. Kulkarni","year":"1985","unstructured":"R.V. Kulkarni and P.R. Bhave, Integer programming formulations of vehicle routing problems, European Journal of Operational Research 20 (1985) 58\u201367.","journal-title":"European Journal of Operational Research"},{"key":"5101113_CR7","doi-asserted-by":"crossref","first-page":"1533","DOI":"10.1287\/mnsc.40.11.1533","volume":"40","author":"M. Laguna","year":"1994","unstructured":"M. Laguna, Clustering for the design of SONET rings in interoffice telecommunications, Management Science 40 (1994) 1533\u20131541.","journal-title":"Management Science"},{"key":"5101113_CR8","series-title":"Research Report","volume-title":"Optimal interconnection of token ring networks using source routing bridges","author":"V. Sridhar","year":"1994","unstructured":"V. Sridhar, J.S. Park and B. Gavish, Optimal interconnection of token ring networks using source routing bridges, Research Report, Ohio University, USA (1994)."},{"key":"5101113_CR9","doi-asserted-by":"crossref","first-page":"428","DOI":"10.1109\/24.93762","volume":"40","author":"O.J. Wasem","year":"1991","unstructured":"O.J. Wasem, An algorithm for designing rings for survivable fiber networks, IEEE Transactions on Reliability 40 (1991) 428\u2013432.","journal-title":"IEEE Transactions on Reliability"},{"key":"5101113_CR10","doi-asserted-by":"crossref","unstructured":"J. Xu, S.Y. Chiu and F. Glover, Optimizing a ring-based private line telecommunication network using tabu search, Working paper (1998).","DOI":"10.1287\/mnsc.45.3.330"}],"container-title":["Telecommunication Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1020954800383.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1020954800383\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1020954800383.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,8]],"date-time":"2025-08-08T06:49:08Z","timestamp":1754635748000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1020954800383"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,12]]},"references-count":10,"journal-issue":{"issue":"2-4","published-print":{"date-parts":[[2002,12]]}},"alternative-id":["5101113"],"URL":"https:\/\/doi.org\/10.1023\/a:1020954800383","relation":{},"ISSN":["1018-4864","1572-9451"],"issn-type":[{"type":"print","value":"1018-4864"},{"type":"electronic","value":"1572-9451"}],"subject":[],"published":{"date-parts":[[2002,12]]}}}