{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T22:19:17Z","timestamp":1773267557735,"version":"3.50.1"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2008,4,15]],"date-time":"2008-04-15T00:00:00Z","timestamp":1208217600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2009,9]]},"DOI":"10.1007\/s10107-008-0218-9","type":"journal-article","created":{"date-parts":[[2008,4,14]],"date-time":"2008-04-14T09:30:59Z","timestamp":1208165459000},"page":"347-380","source":"Crossref","is-referenced-by-count":193,"title":["A unified exact method for solving different classes of vehicle routing problems"],"prefix":"10.1007","volume":"120","author":[{"given":"Roberto","family":"Baldacci","sequence":"first","affiliation":[]},{"given":"Aristide","family":"Mingozzi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,4,15]]},"reference":[{"key":"218_CR1","volume-title":"The Vehicle Routing Problem: Latest Advances and New Challenges, vol. 43","author":"R. Baldacci","year":"2008","unstructured":"Baldacci, R., Battarra, M., Vigo, D.: Routing a heterogeneous fleet of vehicles. In: Golden, B., Raghavan, S., Wasil, E. (eds) The Vehicle Routing Problem: Latest Advances and New Challenges, vol. 43, Springer, Heidelberg (2008)"},{"key":"218_CR2","doi-asserted-by":"crossref","first-page":"2667","DOI":"10.1016\/j.cor.2005.02.023","volume":"33","author":"R. Baldacci","year":"2006","unstructured":"Baldacci, R., Bodin, L.D., Mingozzi, A.: The multiple disposal facilities and multiple inventory locations rollon-rolloff vehicle routing problem. Comput. Oper. Res. 33, 2667\u20132702 (2006)","journal-title":"Comput. Oper. Res."},{"key":"218_CR3","doi-asserted-by":"crossref","unstructured":"Baldacci, R., Christofides, N., Mingozzi, A.: An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts. Mathematical Programming Ser. A (2007). http:\/\/dx.doi.org\/10.1007\/s10107-007-0178-5","DOI":"10.1007\/s10107-007-0178-5"},{"key":"218_CR4","doi-asserted-by":"crossref","first-page":"723","DOI":"10.1287\/opre.1040.0111","volume":"52","author":"R. Baldacci","year":"2004","unstructured":"Baldacci, R., Hadjiconstantinou, E.A., Mingozzi, A.: An exact algorithm for the capacitated vehicle routing problem based on a two-commodity network flow formulation. Oper. Res. 52, 723\u2013738 (2004)","journal-title":"Oper. Res."},{"issue":"3","key":"218_CR5","first-page":"319","volume":"37","author":"I.M. Chao","year":"1999","unstructured":"Chao, I.M., Golden, B.L., Wasil, E.A.: A computational study of a new heuristic for the site-dependent vehicle routing problem. INFOR 37(3), 319\u2013336 (1999)","journal-title":"INFOR"},{"key":"218_CR6","doi-asserted-by":"crossref","first-page":"2080","DOI":"10.1016\/j.cor.2005.08.002","volume":"34","author":"E. Choi","year":"2007","unstructured":"Choi, E., Tcha, D.W.: A column generation approach to the heterogeneous fleet vehicle routing problem. Comput. Oper. Res. 34, 2080\u20132095 (2007)","journal-title":"Comput. Oper. Res."},{"key":"218_CR7","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/BF01589353","volume":"10","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. Math. Program. 10, 255\u2013280 (1981)","journal-title":"Math. Program."},{"key":"218_CR8","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1002\/(SICI)1097-0037(199709)30:2<105::AID-NET5>3.0.CO;2-G","volume":"30","author":"J.F. Cordeau","year":"1997","unstructured":"Cordeau, J.F., Gendreau, M., Laporte, G.: A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks 30, 105\u2013119 (1997)","journal-title":"Networks"},{"key":"218_CR9","first-page":"292","volume":"39","author":"J.F. Cordeau","year":"2001","unstructured":"Cordeau, J.F., Laporte, G.: A tabu search algorithm for the site dependent vehicle routing problem with time windows. INFOR 39, 292\u2013298 (2001)","journal-title":"INFOR"},{"key":"218_CR10","first-page":"367","volume-title":"Transportation, Handbooks in Operations Research and Management Science, vol. 14","author":"J.F. Cordeau","year":"2007","unstructured":"Cordeau, J.F., Laporte, G., Savelsbergh, M.W.P., Vigo, D.: Vehicle routing. In: Barnhart, C., Laporte, G. (eds) Transportation, Handbooks in Operations Research and Management Science, vol. 14, pp. 367\u2013428. Elsevier, Amsterdam (2007)"},{"key":"218_CR11","unstructured":"CPLEX: ILOG CPLEX 10.1 callable library. ILOG (2007)"},{"key":"218_CR12","doi-asserted-by":"crossref","first-page":"756","DOI":"10.1016\/j.ejor.2005.08.015","volume":"176","author":"B. Crevier","year":"2007","unstructured":"Crevier, B., Cordeau, J.F., Laporte, G.: The multi-depot vehicle routing problem with inter-depot routes. Eur. J. Oper. Res. 176, 756\u2013773 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"218_CR13","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1007\/s10107-005-0644-x","volume":"106","author":"R. Fukasawa","year":"2006","unstructured":"Fukasawa, R., Longo, H., Lysgaard, J., Poggi de Arag\u00e3o, M., Reis, M., Uchoa, E., Werneck, R.: Robust branch-and-cut-and-price for the capacitated vehicle routing problem. Math. Program. Ser. A 106, 491\u2013511 (2006)","journal-title":"Math. Program. Ser. A"},{"key":"218_CR14","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1137\/1.9780898718515.ch6","volume-title":"The Vehicle Routing Problem, vol. 9","author":"M. Gendreau","year":"2002","unstructured":"Gendreau, M., Laporte, G., Potvin, J.Y.: Metaheuristics for the capacitated VRP. In: Toth, P., Vigo, D. (eds) The Vehicle Routing Problem, vol. 9, pp. 129\u2013154. SIAM Monogr. Discrete Math. Appl., Philadelphia (2002)"},{"key":"218_CR15","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0305-0548(84)90007-8","volume":"11","author":"B.L. Golden","year":"1984","unstructured":"Golden, B.L., Assad, A.A., Levy, L., Gheysens, F.G.: The fleet size and mix vehicle routing problem. Comput. Oper. Res. 11, 49\u201366 (1984)","journal-title":"Comput. Oper. Res."},{"key":"218_CR16","first-page":"283","volume":"44","author":"G. Laporte","year":"1984","unstructured":"Laporte, G., Nobert, Y., Arpin, D.: Optimal solutions to capacitated multi depot vehicle routing problems. Congressus Numerantium 44, 283\u2013292 (1984)","journal-title":"Congressus Numerantium"},{"key":"218_CR17","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1287\/trsc.22.3.161","volume":"22","author":"G. Laporte","year":"1988","unstructured":"Laporte, G., Nobert, Y., Taillefer, S.: Solving a family of multi-depot vehicle routing and location-routing problems. Transp. Sci 22, 161\u2013172 (1988)","journal-title":"Transp. Sci"},{"key":"218_CR18","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1137\/1.9780898718515.ch5","volume-title":"The Vehicle Routing Problem, vol. 9","author":"G. Laporte","year":"2002","unstructured":"Laporte, G., Semet, F.: Classical heuristics for the capacitated VRP. In: Toth, P., Vigo, D. (eds) The Vehicle Routing Problem, vol. 9, pp. 109\u2013128. SIAM Monogr. Discrete Math. Appl., Philadelphia (2002)"},{"key":"218_CR19","doi-asserted-by":"crossref","first-page":"2734","DOI":"10.1016\/j.cor.2005.10.015","volume":"34","author":"F. Li","year":"2007","unstructured":"Li, F., Golden, B.L., Wasil, E.A.: A record-to-record travel algorithm for solving the heterogeneous fleet vehicle routing problem. Comput. Oper. Res. 34, 2734\u20132742 (2007)","journal-title":"Comput. Oper. Res."},{"key":"218_CR20","unstructured":"Lysgaard, J.: CVRPSEP: a package of separation routines for the capacitated vehicle routing problem. Technical report, Department of Mgt. Science and Logistics, Aarhus School of Business (2003)"},{"key":"218_CR21","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1007\/s10107-003-0481-8","volume":"100","author":"J. Lysgaard","year":"2004","unstructured":"Lysgaard, J., Letchford, A.N., Eglese, R.W.: A new branch-and-cut algorithm for the capacitated vehicle routing problem. Math. Program. Ser. A 100, 423\u2013445 (2004)","journal-title":"Math. Program. Ser. A"},{"key":"218_CR22","first-page":"149","volume-title":"Vehicle Routing: Methods and Studies","author":"B. Nag","year":"1988","unstructured":"Nag, B., Golden, B.L., Assad, A.A.: Vehicle routing with site dependencies. In: Golden, B., Assad, A. (eds) Vehicle Routing: Methods and Studies, pp. 149\u2013159. Elsevier, Amsterdam (1988)"},{"key":"218_CR23","unstructured":"Niskanen, S., \u00d6sterg\u00e5rd, P.R.J.: Cliquer user\u2019s guide. Technical Report 48, Helsinki University of Technology Communications Laboratory (2003)"},{"key":"218_CR24","doi-asserted-by":"crossref","unstructured":"Pessoa, A., Poggi de Arag\u00e3o, M., Uchoa, E.: A Robust Branch-Cut-and-Price Algorithm for the Heterogeneous Fleet Vehicle Routing Problem, Lecture Notes in Computer Science, vol. 4525, pp. 150\u2013160. Springer, Berlin (2007)","DOI":"10.1007\/978-3-540-72845-0_12"},{"key":"218_CR25","doi-asserted-by":"crossref","first-page":"2403","DOI":"10.1016\/j.cor.2005.09.012","volume":"34","author":"D. Pisinger","year":"2007","unstructured":"Pisinger, D., Ropke, S.: A general heuristic for vehicle routing problems. Comput. Oper. Res. 34, 2403\u20132435 (2007)","journal-title":"Comput. Oper. Res."},{"key":"218_CR26","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1051\/ro:1999101","volume":"33","author":"E.D. Taillard","year":"1999","unstructured":"Taillard, E.D.: A heuristic column generation method for the heterogeneous fleet VRP. RAIRO Rech. Op\u00e9rationnelle 33, 1\u201314 (1999)","journal-title":"RAIRO Rech. Op\u00e9rationnelle"},{"key":"218_CR27","volume-title":"The Vehicle Routing Problem","year":"2002","unstructured":"Toth, P., Vigo, D. (eds.): The Vehicle Routing Problem. Monogr. Discrete Math. Appl. SIAM, Philadelphia (2002)"},{"key":"218_CR28","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/s10107-005-0611-6","volume":"106","author":"H.D. Yaman","year":"2006","unstructured":"Yaman, H.D.: Formulations and valid inequalities for the heterogeneous vehicle routing problem. Math. Program. Ser. A 106, 365\u2013390 (2006)","journal-title":"Math. Program. Ser. A"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-008-0218-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-008-0218-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-008-0218-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T05:50:05Z","timestamp":1559109005000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-008-0218-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,4,15]]},"references-count":28,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2009,9]]}},"alternative-id":["218"],"URL":"https:\/\/doi.org\/10.1007\/s10107-008-0218-9","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,4,15]]}}}