{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,22]],"date-time":"2025-10-22T02:57:30Z","timestamp":1761101850811},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540697329"},{"type":"electronic","value":"9783540697336"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-69733-6_62","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T12:07:43Z","timestamp":1218542863000},"page":"631-641","source":"Crossref","is-referenced-by-count":5,"title":["Column Generation Algorithms for the Capacitated m-Ring-Star Problem"],"prefix":"10.1007","author":[{"given":"Edna A.","family":"Hoshino","sequence":"first","affiliation":[]},{"given":"Cid C.","family":"de Souza","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"62_CR1","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"R. Ahuja","year":"1993","unstructured":"Ahuja, R., Magnanti, T., Orlin, J.: Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Englewood Cliffs (1993)"},{"key":"62_CR2","doi-asserted-by":"publisher","first-page":"1147","DOI":"10.1287\/opre.1070.0432","volume":"55","author":"R. Baldacci","year":"2007","unstructured":"Baldacci, R., Dell\u2019Amico, M., Salazar, J.: The Capacitated m-Ring Star Problem. Operations Research\u00a055, 1147\u20131162 (2007)","journal-title":"Operations Research"},{"key":"62_CR3","first-page":"65","volume":"4","author":"J. Beasley","year":"1996","unstructured":"Beasley, J., Nascimento, E.: The Vehicle Routing-Allocation Problem: A Unifying Framework. Trabajos de OPerativa\u00a04, 65\u201386 (1996)","journal-title":"Trabajos de OPerativa"},{"key":"62_CR4","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/BF01589353","volume":"20","author":"N. Christofides","year":"1981","unstructured":"Christofides, N., Mingozzi, A., Toth, P.: Exact Algorithms for the Vehicle Routing Problem, Based on Spanning Tree and Shortest Path Relaxations. Mathematical Programming\u00a020, 255\u2013282 (1981)","journal-title":"Mathematical Programming"},{"issue":"3","key":"62_CR5","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1111\/j.1475-3995.1995.tb00023.x","volume":"2","author":"M. Dell\u2019Amico","year":"1995","unstructured":"Dell\u2019Amico, M., Maffioli, F., Varbrand, P.: On Prize-Collecting Tours and the Asymmetric Travelling Salesman Problem. International Transactions in Operational Research\u00a02(3), 297\u2013308 (1995)","journal-title":"International Transactions in Operational Research"},{"issue":"2","key":"62_CR6","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1287\/trsc.1030.0079","volume":"39","author":"D. Feillet","year":"2005","unstructured":"Feillet, D., Dejax, P., Gendreau, M.: Traveling Salesman Problems with Profits. Transportation Science\u00a039(2), 188\u2013205 (2005)","journal-title":"Transportation Science"},{"issue":"3","key":"62_CR7","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/s10107-005-0644-x","volume":"106","author":"R. Fukasawa","year":"2006","unstructured":"Fukasawa, R., Longo, H., Lysgaard, J., de Arag\u00e3o, M.P., Reis, M., Uchoa, E., Werneck, R.: Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing problem. Mathematical Programming\u00a0106(3), 491\u2013511 (2006)","journal-title":"Mathematical Programming"},{"key":"62_CR8","first-page":"93","volume":"17","author":"D. Houck","year":"1980","unstructured":"Houck, D., Picard, J., Queyranne, M., Vemuganti, R.: The Travelling Salesman Problem as a Constrained Shortest Path Problem: Theory and Computational Experience. Opsearch\u00a017, 93\u2013109 (1980)","journal-title":"Opsearch"},{"key":"62_CR9","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/0-387-25486-2_2","volume-title":"Column Generation","author":"S. Irnich","year":"2005","unstructured":"Irnich, S., Desaulniers, G.: Shortest Path Problems with Resource Constraints. In: Column Generation, pp. 33\u201365. Springer, Heidelberg (2005)"},{"issue":"3","key":"62_CR10","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1287\/ijoc.1040.0117","volume":"18","author":"S. Irnich","year":"2006","unstructured":"Irnich, S., Villeneuve, D.: The Dhortest Path Problem with Tesource Vonstraints and k-Cycle Elimination for k\u2009\u2265\u20093. INFORMS J. on Computing\u00a018(3), 391\u2013406 (2006)","journal-title":"INFORMS J. on Computing"},{"key":"62_CR11","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1002\/net.10114","volume":"43","author":"M. Labb\u00e9","year":"2004","unstructured":"Labb\u00e9, M., Laporte, G., Mart\u00edn, I.R., Gonz\u00e1lez, J.S.: The Ring-Star Problem: Polyhedral Analysis and Exact Algorithm. Networks\u00a043, 117\u2013189 (2004)","journal-title":"Networks"},{"key":"62_CR12","volume-title":"Optimization Theory for Large Systems","author":"L. Lasdon","year":"1970","unstructured":"Lasdon, L.: Optimization Theory for Large Systems. Macmillan, Basingstoke (1970)"},{"issue":"2","key":"62_CR13","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/s10107-003-0481-8","volume":"100","author":"J. Lysgaard","year":"2004","unstructured":"Lysgaard, J., Letchford, A., Eglese, R.: A New Branch-and-Cut Algorithm for the Capacitated Vehicle Routing problem. Mathematical Programming\u00a0100(2), 423\u2013445 (2004)","journal-title":"Mathematical Programming"},{"key":"62_CR14","unstructured":"Mauttone, A., Nesmachnow, S., Olivera, A., Robledo, F.: A Hybrid Metaheuristic Algorithm to Solve the Capacitated m-Ring Star Problem. In: International Network Optimization Conference (2007)"},{"key":"62_CR15","unstructured":"TSPLIB, \n                    \n                      http:\/\/www.iwr.uni-heidelberg.de\/groups\/comopt\/software\/TSPLIB95\/tsp\/"},{"key":"62_CR16","volume-title":"Integer Programming","author":"L.A. Wolsey","year":"1998","unstructured":"Wolsey, L.A.: Integer Programming. Wiley-Interscience, Chichester (1998)"},{"key":"62_CR17","unstructured":"Xpress-Optimizer. Dash Optimization (2007)"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69733-6_62","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,2]],"date-time":"2019-03-02T05:21:30Z","timestamp":1551504090000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69733-6_62"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540697329","9783540697336"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69733-6_62","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}