{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:22:26Z","timestamp":1759666946905},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540221135"},{"type":"electronic","value":"9783540259602"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-25960-2_1","type":"book-chapter","created":{"date-parts":[[2010,8,8]],"date-time":"2010-08-08T19:21:46Z","timestamp":1281295306000},"page":"1-15","source":"Crossref","is-referenced-by-count":21,"title":["Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem"],"prefix":"10.1007","author":[{"given":"Ricardo","family":"Fukasawa","sequence":"first","affiliation":[]},{"given":"Jens","family":"Lysgaard","sequence":"additional","affiliation":[]},{"given":"Marcus","family":"Poggi de Arag\u00e3o","sequence":"additional","affiliation":[]},{"given":"Marcelo","family":"Reis","sequence":"additional","affiliation":[]},{"given":"Eduardo","family":"Uchoa","sequence":"additional","affiliation":[]},{"given":"Renato F.","family":"Werneck","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"1_CR1","first-page":"109","volume":"15","author":"N. Achuthan","year":"1998","unstructured":"Achuthan, N., Caccetta, L., Hill, S.: Capacited vehicle routing problem: Some new cutting planes. Pacific J. of Operational Research\u00a015, 109\u2013123 (1998)","journal-title":"Pacific J. of Operational Research"},{"key":"1_CR2","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1287\/trsc.37.2.153.15243","volume":"37","author":"N. Achuthan","year":"2003","unstructured":"Achuthan, N., Caccetta, L., Hill, S.: An improved branch-and-cut algorithm for the capacitated vehicle routing problem. Transportation Science\u00a037, 153\u2013169 (2003)","journal-title":"Transportation Science"},{"key":"1_CR3","unstructured":"Araque, J., Hall, L., Magnanti, T.: Capacitated trees, capacitated routing and associated polyhedra. Technical Report SOR-90-12, Princeton University (1990)"},{"key":"1_CR4","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/BF02085634","volume":"50","author":"J. Araque","year":"1994","unstructured":"Araque, J., Kudva, G., Morin, T., Pekny, J.: A branch-and-cut algorithm for the vehicle routing problem. Annals of Operations Research\u00a050, 37\u201359 (1994)","journal-title":"Annals of Operations Research"},{"key":"1_CR5","unstructured":"Augerat, P.: Approche poly\u00e8drale du probl\u00e8me de tourn\u00e9es de v\u00e9hicles. PhD thesis, Institut National Polytechnique de Grenoble (1995)"},{"key":"1_CR6","unstructured":"Augerat, P., Belenguer, J., Benavent, E., Corber\u00e1n, A., Naddef, D., Rinaldi, G.: Computational results with a branch and cut code for the capacitated vehicle routing problem. Technical Report 949-M, Universit\u00e9 Joseph Fourier, Grenoble, France (1995)"},{"key":"1_CR7","doi-asserted-by":"publisher","first-page":"731","DOI":"10.1002\/net.3230190702","volume":"19","author":"Y. Agarwal","year":"1989","unstructured":"Agarwal, Y., Mathur, K., Salkin, H.: A set-partitioning based exact algorithm for the vehicle routing problem. Networks\u00a019, 731\u2013739 (1989)","journal-title":"Networks"},{"key":"1_CR8","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1287\/opre.12.2.300","volume":"12","author":"M. Balinski","year":"1964","unstructured":"Balinski, M., Quandt, R.: On an integer program for a delivery problem. Operations Research\u00a012, 300\u2013304 (1964)","journal-title":"Operations Research"},{"key":"1_CR9","unstructured":"Blasum, U., Hochst\u00e4ttler, W.: Application of the branch and cut method to the vehicle routing problem. Technical Report ZPR2000-386, Zentrum fur Angewandte Informatik K\u00f6ln (2000)"},{"key":"1_CR10","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1057\/jors.1969.75","volume":"20","author":"N. Christofides","year":"1969","unstructured":"Christofides, N., Eilon, S.: An algorithm for the vehicle-dispatching problem. Operational Research Quarterly\u00a020, 309\u2013318 (1969)","journal-title":"Operational Research Quarterly"},{"key":"1_CR11","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"},{"key":"1_CR12","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/BF01580599","volume":"60","author":"G. Cornu\u00e9jols","year":"1993","unstructured":"Cornu\u00e9jols, G., Harche, F.: Polyhedral study of the capacitated vehicle routing problem. Mathematical Programming\u00a060, 21\u201352 (1993)","journal-title":"Mathematical Programming"},{"key":"1_CR13","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","volume":"6","author":"G. Dantzig","year":"1959","unstructured":"Dantzig, G., Ramser, R.: The truck dispatching problem. Management Science\u00a06, 80\u201391 (1959)","journal-title":"Management Science"},{"key":"1_CR14","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1287\/opre.42.4.626","volume":"42","author":"M. Fisher","year":"1994","unstructured":"Fisher, M.: Optimal solution of vehicle routing problem using minimum k-trees. Operations Research\u00a042, 626\u2013642 (1994)","journal-title":"Operations Research"},{"key":"1_CR15","unstructured":"Fukasawa, R., Poggi de Arag\u00e3o, M., Porto, O., Uchoa, E.: Robust branch-andcut- and-price for the capacitated minimum spanning tree problem. In: Proc. of the International Network Optimization Conference, Evry, France, pp. 231\u2013236 (2003)"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"Fukasawa, R., Reis, M., Poggi de Arag\u00e3o, M., Uchoa, E.: Robust branch-and-cutand- price for the capacitated vehicle routing problem. Technical Report RPEP Vol.3 no.8, Universidade Federal Fluminense, Engenharia de Produ\u00e7\u00e3o, Niter\u00f3i, Brazil (2003)","DOI":"10.1007\/978-3-540-25960-2_1"},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"Hadjiconstantinou, E., Christofides, N., Mingozzi, A.: A new exact algorithm from the vehicle routing problem based on q-paths and k-shortest paths relaxations. In: Laporte, G., Gendreau, M. (eds.) Freight Transportation. Annals of Operations Research, vol.\u00a061, pp. 21\u201344. Baltzer Science Publishers (1995)","DOI":"10.1007\/BF02098280"},{"key":"1_CR18","unstructured":"Irnich, S., Villeneuve, D.: The shortest path problem with resource constraints and k-cycle elimination for k \u2265 3 (2003) (unpublished manuscript)"},{"key":"1_CR19","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BF01720015","volume":"5","author":"G. Laporte","year":"1983","unstructured":"Laporte, G., Norbert, Y.: A branch and bound algorithm for the capacitated vehicle routing problem. Operations Research Spektrum\u00a05, 77\u201385 (1983)","journal-title":"Operations Research Spektrum"},{"key":"1_CR20","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s10107-002-0336-8","volume":"94","author":"A. Letchford","year":"2002","unstructured":"Letchford, A., Eglese, R., Lysgaard, J.: Multistars, partial multistars and the capacitated vehicle routing problem. Mathematical Programming\u00a094, 21\u201340 (2002)","journal-title":"Mathematical Programming"},{"key":"1_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/978-3-540-25960-2_15","volume-title":"Integer Programming and Combinatorial Optimization","author":"A. Letchford","year":"2004","unstructured":"Letchford, A., Reinelt, G., Theis, D.: A faster exact separation algorithm for blossom inequalities. In: Bienstock, D., Nemhauser, G.L. (eds.) IPCO 2004. LNCS, vol.\u00a03064, pp. 196\u2013205. Springer, Heidelberg (2004)"},{"key":"1_CR22","unstructured":"Lysgaard, J.: CVRPSEP: A package of separation routines for the capacitated vehicle routing problem (2003), Available at http:\/\/www.asb.dk\/~lys"},{"key":"1_CR23","doi-asserted-by":"crossref","unstructured":"Lysgaard, J., Letchford, A., Eglese, R.: A new branch-and-cut algorithm for the capacitated vehicle routing problem. Mathematical Programming (2003) (to appear)","DOI":"10.1007\/s10107-003-0481-8"},{"key":"1_CR24","doi-asserted-by":"crossref","unstructured":"Martinhon, C., Lucena, A., Maculan, N.: A relax and cut algorithm for the vehicle routing problem. European J. of Operational Research (2003) (to appear)","DOI":"10.1016\/S0377-2217(03)00353-9"},{"key":"1_CR25","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/ijoc.7.1.1","volume":"7","author":"D. Miller","year":"1995","unstructured":"Miller, D.: A matching based exact algorithm for capacitated vehicle routing problems. ORSA J. on Computing\u00a07, 1\u20139 (1995)","journal-title":"ORSA J. on Computing"},{"key":"1_CR26","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1137\/1.9780898718515.ch3","volume-title":"The Vehicle Routing Problem","author":"D. Naddef","year":"2002","unstructured":"Naddef, D., Rinaldi, G.: Branch-and-cut algorithms for the capacitated VRP. In: Toth, P., Vigo, D. (eds.) The Vehicle Routing Problem, pp. 53\u201384. SIAM, Philadelphia (2002)"},{"key":"1_CR27","unstructured":"Pigatti, A.: Modelos e algoritmos para o problema de aloca\u00e7\u00e3o generalizada e aplica\u00e7\u00f5es. Master\u2019s thesis, Pontif\u00edcia Universidade Cat\u00f3lica do Rio de Janeiro, Brazil (2003)"},{"key":"1_CR28","unstructured":"Poggi de Arag\u00e3o, M., Uchoa, E.: Integer program reformulation for robust branchand- cut-and-price. In: Annals of Mathematical Programming in Rio, B\u00fazios, Brazil, pp. 56\u201361 (2003)"},{"key":"1_CR29","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1016\/S0167-8191(03)00045-0","volume":"29","author":"T. Ralphs","year":"2003","unstructured":"Ralphs, T.: Parallel branch and cut for capacitated vehicle routing. Parallel Computing\u00a029, 607\u2013629 (2003)","journal-title":"Parallel Computing"},{"key":"1_CR30","unstructured":"Ralphs, T., Kopman, L., Pulleyblank, W., Jr., L.T.: On the capacitated vehicle routing problem. Mathematical Programming 94 (2003) 343\u2013359"},{"key":"1_CR31","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1016\/S0166-218X(01)00351-1","volume":"123","author":"P. Toth","year":"2002","unstructured":"Toth, P., Vigo, D.: Models, relaxations and exact approaches for the capacitated vehicle routing problem. Discrete Applied Mathematics\u00a0123, 487\u2013512 (2002)","journal-title":"Discrete Applied Mathematics"},{"key":"1_CR32","series-title":"Monographs on Discrete Mathematics and Applications","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718515","volume-title":"The Vehicle Routing Problem","author":"P. Toth","year":"2002","unstructured":"Toth, P., Vigo, D.: The Vehicle Routing Problem. Monographs on Discrete Mathematics and Applications. SIAM, Philadelphia (2002)"},{"key":"1_CR33","unstructured":"Wenger, K.: Generic Cut Generation Methods for Routing Problems. PhD thesis, Institute of Computer Science, University of Heidelberg (2003)"},{"key":"1_CR34","doi-asserted-by":"crossref","unstructured":"Werneck, R.F., Setubal, J.C.: Finding minimum congestion spanning trees. ACM J. of Experimental Algorithmics\u00a05 (2000)","DOI":"10.1145\/351827.384253"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-25960-2_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,3]],"date-time":"2021-11-03T22:14:32Z","timestamp":1635977672000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-25960-2_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540221135","9783540259602"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-25960-2_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}