{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T17:13:18Z","timestamp":1780765998061,"version":"3.54.1"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2007,11,20]],"date-time":"2007-11-20T00:00:00Z","timestamp":1195516800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["4OR"],"published-print":{"date-parts":[[2007,11,29]]},"DOI":"10.1007\/s10288-007-0063-3","type":"journal-article","created":{"date-parts":[[2007,11,19]],"date-time":"2007-11-19T09:39:54Z","timestamp":1195465194000},"page":"269-298","source":"Crossref","is-referenced-by-count":68,"title":["Recent advances in vehicle routing exact algorithms"],"prefix":"10.1007","volume":"5","author":[{"given":"Roberto","family":"Baldacci","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Paolo","family":"Toth","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Daniele","family":"Vigo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2007,11,20]]},"reference":[{"key":"63_CR1","unstructured":"Applegate D, Bixby R, Chv\u00e1tal V, Cook W (1994) Special session on tsp. In: 15th International Symposium on Mathematical Programming. University of Michigan, USA"},{"key":"63_CR2","unstructured":"Araque JR, Hall L, Magnanti T (1990) Capacitated trees, capacitated routing and associated polyhedra. Technical Report Discussion Paper 9061, CORE, Louvain La Nueve"},{"key":"63_CR3","unstructured":"Augerat P (1995) Approche poly\u00e8drale du probl\u00e8me de tourn\u00e9es de v\u00e9hicules. PhD thesis, Institut National Polytechnique de Grenoble"},{"key":"63_CR4","unstructured":"Augerat P, Belenguer JM, Benavent E, Corber\u00e1n A, Naddef D, Rinaldi G (1995) Computational results with a branch and cut code for the capacitated vehicle routing problem. Technical Report 1 RR949-M, ARTEMIS-IMAG, Grenoble France"},{"key":"63_CR5","doi-asserted-by":"crossref","first-page":"546","DOI":"10.1016\/S0377-2217(97)00290-7","volume":"106","author":"P Augerat","year":"1998","unstructured":"Augerat P, Belenguer JM, Benavent E, Corber\u00e1n A and Naddef D (1998). Separating capacity constraints in the CVRP using tabu search. Euro J Oper Res 106: 546\u2013557","journal-title":"Euro J Oper Res"},{"issue":"5","key":"63_CR6","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 and Mingozzi A (2004). An exact algorithm for the capacitated vehicle routing problem based on a two-commodity network flow formulation. Oper Res 52(5): 723\u2013738","journal-title":"Oper Res"},{"issue":"9","key":"63_CR7","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 and Mingozzi A (2006). The multiple disposal facilities and multiple inventory locations rollon\u2013rolloff vehicle routing problem. Comput Oper Res 33(9): 2667\u20132702","journal-title":"Comput Oper Res"},{"key":"63_CR8","doi-asserted-by":"crossref","unstructured":"Baldacci R, Christofides N, Mingozzi A (2007) An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts. Math Program (A). doi: 10.1007\/s10107-007-0178-5","DOI":"10.1007\/s10107-007-0178-5"},{"key":"63_CR9","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1287\/opre.12.2.300","volume":"12","author":"M Balinski","year":"1964","unstructured":"Balinski M and Quandt R (1964). On an integer program for a delivery problem. Oper Res 12: 300\u2013304","journal-title":"Oper Res"},{"key":"63_CR10","doi-asserted-by":"crossref","unstructured":"Bramel J, Simchi-Levi D (2002) Set-covering-based algorithms for the capacitated VRP. In: Toth P, Vigo D (eds) The vehicle routing problem, vol 9. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, pp 85\u2013108","DOI":"10.1137\/1.9780898718515.ch4"},{"key":"63_CR11","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1057\/jors.1969.75","volume":"20","author":"N Christofides","year":"1969","unstructured":"Christofides N and Eilon S (1969). An algorithm for the vehicle dispatching problem. Oper Res Quart 20: 309\u2013318","journal-title":"Oper Res Quart"},{"key":"63_CR12","first-page":"315","volume-title":"Combinatorial optimization, Chap. 11","author":"N Christofides","year":"1979","unstructured":"Christofides N, Mingozzi A and Toth P (1979). The vehicle routing problem. In: Christofides, N, Mingozzi, A, Toth, P, and Sandi, C (eds) Combinatorial optimization, Chap. 11, pp 315\u2013338. Wiley, New York"},{"key":"63_CR13","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/BF01589353","volume":"10","author":"N Christofides","year":"1981","unstructured":"Christofides N, Mingozzi A and Toth P (1981). Exact algorithms for the vehicle routing problem based on spanning tree and shortest path relaxation. Math Program 10: 255\u2013280","journal-title":"Math Program"},{"key":"63_CR14","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/BF01580109","volume":"5","author":"V Chv\u00e1tal","year":"1973","unstructured":"Chv\u00e1tal V (1973). Edmonds polytopes and weakly hamiltonian graphs. Math Program 5: 29\u201340","journal-title":"Math Program"},{"key":"63_CR15","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 MWP and Vigo D (2007). Vehicle routing. In: Barnhart, C and Laporte, G (eds) Transportation handbooks in operations research and management science, vol 14, pp 367\u2013428. North-Holland, Amsterdam"},{"key":"63_CR16","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/BF01580599","volume":"60","author":"G Cornu\u00e9jols","year":"1993","unstructured":"Cornu\u00e9jols G and Harche F (1993). Polyhedral study of the capacitated vehicle routing. Math Program 60: 21\u201352","journal-title":"Math Program"},{"key":"63_CR17","unstructured":"CPLEX. ILOG CPLEX 9.0 callable library. ILOG, 2006"},{"issue":"1","key":"63_CR18","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","volume":"6","author":"GB Dantzig","year":"1959","unstructured":"Dantzig GB and Ramser JH (1959). The truck dispatching problem. Manage Sci 6(1): 80\u201391","journal-title":"Manage Sci"},{"key":"63_CR19","first-page":"167","volume":"41","author":"G Finke","year":"1984","unstructured":"Finke G, Claus A and Gunn E (1984). A two-commodity network flow approach to the traveling salesman problem. Congress Numer 41: 167\u2013178","journal-title":"Congress Numer"},{"issue":"2","key":"63_CR20","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1287\/opre.37.2.319","volume":"37","author":"M Fischetti","year":"1989","unstructured":"Fischetti M and Toth P (1989). An additive bounding procedure for combinatorial optimization problems. Oper Res 37(2): 319\u2013328","journal-title":"Oper Res"},{"key":"63_CR21","doi-asserted-by":"crossref","first-page":"846","DOI":"10.1287\/opre.42.5.846","volume":"42","author":"M Fischetti","year":"1994","unstructured":"Fischetti M, Toth P and Vigo D (1994). A branch-and-bound algorithm for the capacitated vehicle routing problem on directed graphs. Oper Res 42: 846\u2013859","journal-title":"Oper Res"},{"key":"63_CR22","unstructured":"Fischetti M, Salazar Gonz\u00e1lez JJ, Toth P (1995) Experiments with a multi-commodity formulation for the symmetric capacitated vehicle routing problem. In: 3rd Meeting of the EURO working group on transportation Barcelona, pp 169\u2013173"},{"key":"63_CR23","doi-asserted-by":"crossref","first-page":"626","DOI":"10.1287\/opre.42.4.626","volume":"42","author":"ML Fisher","year":"1994","unstructured":"Fisher ML (1994). Optimal solution of vehicle routing problems using minimum K-trees. Oper Res 42: 626\u2013642","journal-title":"Oper Res"},{"key":"63_CR24","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, Poggide Arag\u00e3o M, Reis M, Uchoa E and Werneck RF (2006). Robust branch-and-cut-and-price for the capacitated vehicle routing problem. Math Program (A) 106: 491\u2013511","journal-title":"Math Program (A)"},{"key":"63_CR25","volume-title":"Computers and intractability; a guide to the theory of NP-completeness","author":"MR Garey","year":"1990","unstructured":"Garey MR and Johnson DS (1990). Computers and intractability; a guide to the theory of NP-completeness. W.H. Freeman & Co., New York"},{"key":"63_CR26","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1002\/net.3230070203","volume":"7","author":"BL Golden","year":"1977","unstructured":"Golden BL, Magnanti TL and Nguyen HQ (1977). Implementing vehicle routing algorithms. Networks 7: 113\u2013148","journal-title":"Networks"},{"key":"63_CR27","doi-asserted-by":"crossref","first-page":"610","DOI":"10.1016\/0377-2217(94)00025-8","volume":"85","author":"L Gouveia","year":"1995","unstructured":"Gouveia L (1995). A result on projection for the vehicle routing problem. J Opl Res 85: 610\u2013624","journal-title":"J Opl Res"},{"key":"63_CR28","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF01582116","volume":"16","author":"M Gr\u00f6tschel","year":"1979","unstructured":"Gr\u00f6tschel M and Padberg MW (1979). On the symmetric traveling salesman problem: I and II. Math Program 16: 265\u2013280","journal-title":"Math Program"},{"key":"63_CR29","first-page":"231","volume-title":"The traveling salesman problem: a guided tour of combinatorial optimization","author":"M Gr\u00f6tschel","year":"1985","unstructured":"Gr\u00f6tschel M and Padberg MW (1985). Polyhedral theory. In: Lawler, EL, Lenstra, JK, Rinnooy Kan, AHG and Shmoys, DB (eds) The traveling salesman problem: a guided tour of combinatorial optimization, pp 231\u2013305. Wiley, Chichester"},{"key":"63_CR30","first-page":"271","volume":"51","author":"G Laporte","year":"1984","unstructured":"Laporte G and Nobert Y (1984). Comb inequalities for the vehicle routing problem. Met Oper Res 51: 271\u2013276","journal-title":"Met Oper Res"},{"key":"63_CR31","first-page":"147","volume":"31","author":"G Laporte","year":"1987","unstructured":"Laporte G and Nobert Y (1987). Exact algorithms for the vehicle routing problem. Ann Discr Math 31: 147\u2013184","journal-title":"Ann Discr Math"},{"key":"63_CR32","doi-asserted-by":"crossref","first-page":"1058","DOI":"10.1287\/opre.33.5.1050","volume":"33","author":"G Laporte","year":"1985","unstructured":"Laporte G, Nobert Y and Desrochers M (1985). Optimal routing under capacity and distance restrictions. Oper Res 33: 1058\u20131073","journal-title":"Oper Res"},{"issue":"2\u20133","key":"63_CR33","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/s10107-005-0652-x","volume":"105","author":"AN Letchford","year":"2006","unstructured":"Letchford AN and Salazar Gonz\u00e1lez JJ (2006). Projection results for vehicle routing. Math Program 105(2\u20133): 251\u2013274","journal-title":"Math Program"},{"key":"63_CR34","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/s10107-002-0336-8","volume":"94","author":"AN Letchford","year":"2002","unstructured":"Letchford AN, Eglese RW and Lysgaard J (2002). Multistars, partial multistars and the capacitated vehicle routing problem. Math Program 94: 21\u201340","journal-title":"Math Program"},{"key":"63_CR35","unstructured":"Lysgaard J (2003) CVRPSEP: A package of separation routines for the capacitated vehicle routing problem. Technical report, Dept. of Mgt. Science and Logistics, Aarhus School of Business"},{"issue":"2","key":"63_CR36","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 AN and Eglese RW (2004). A new branch-and-cut algorithm for the capacitated vehicle routing problem. Math Program 100(2): 423\u2013445","journal-title":"Math Program"},{"key":"63_CR37","doi-asserted-by":"crossref","unstructured":"Naddef D, Rinaldi G (2002) Branch-and-cut algorithms for the capacitated VRP. In: Toth P, Vigo D (eds) he vehicle routing problem, vol 9. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia","DOI":"10.1137\/1.9780898718515.ch3"},{"key":"63_CR38","unstructured":"Niskanen S, \u00d6sterg\u00e5rd PRJ (2003) Cliquer user\u2019s guide. Technical Report 48, Helsinki University of Technology Communications Laboratory"},{"issue":"1\u20133","key":"63_CR39","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/S0166-218X(01)00290-6","volume":"120","author":"PRJ \u00d6sterg\u00e5rd","year":"2002","unstructured":"\u00d6sterg\u00e5rd PRJ (2002). A fast algorithm for the maximum clique problem. Discr Appl Math 120(1\u20133): 197\u2013207","journal-title":"Discr Appl Math"},{"key":"63_CR40","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/s10107-002-0323-0","volume":"94","author":"TK Ralphs","year":"2003","unstructured":"Ralphs TK, Kopman L, Pulleyblank WR and Trotter LE (2003). On the capacitated vehicle routing problem. Math Program (B) 94: 343\u2013359","journal-title":"Math Program (B)"},{"key":"63_CR41","doi-asserted-by":"crossref","unstructured":"Toth P, Vigo D (2002) The vehicle routing problem, vol 9. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia","DOI":"10.1137\/1.9780898718515"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-007-0063-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10288-007-0063-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-007-0063-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T12:12:55Z","timestamp":1559131975000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10288-007-0063-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,11,20]]},"references-count":41,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2007,11,29]]}},"alternative-id":["63"],"URL":"https:\/\/doi.org\/10.1007\/s10288-007-0063-3","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"value":"1619-4500","type":"print"},{"value":"1614-2411","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,11,20]]}}}