Maximally Violated Mod-p Cuts for the Capacitated Vehicle-Routing Problem

References

• Applegate D., Bixby R., Chvátal V., Cook W. Finding cuts in the TSP (a preliminary report). (1995) . DIMACS Technical Report 95-05, DIMACS, Rutgers University, New Brunswick, NJGoogle Scholar
• Augerat P. Approche polyèdrale du problème de tournées de véhicules. (1995) . Ph.D. thesis, Laboratoire ARTEMIS-IMAG, Institut National Polytechnique de Grenoble, Grenoble, FranceGoogle Scholar
• Augerat P., Belenguer J. M., Benavent E., Corberán A., Naddef D. Separating capacity constraints in the CVRP using tabu search. Eur. J. Oper. Res. (1998) 106:546–557Crossref, Google Scholar
• Augerat P., Belenguer J. M., Benavent E., Corberán A., Naddef D., Rinaldi G. Computational results with a branch and cut code for the capacitated vehicle routing problem. (1995) . Technical Report RR 949-M, Université Joseph Fourier, Grenoble, FranceGoogle Scholar
• Blasum U. Anwendung des Branch & Cut Verfahrens auf das kapazitierte Vehicle-Routing Problem. (1999) . Ph.D. thesis, Mathematisch-Naturwissenschaftliche Fakultät der Universität Köln, Köln, Germany. http://www.zaik.uni-koeln.de/AFSGoogle Scholar
• Blasum U., Hochstättler W. Application of the branch and cut method to the vehicle routing problem. (2002) . Technical Report zaik2000-386, Zentrum für Angewandte Informatik Köln, Köln, Germany. http://www.zaik.uni-koeln.deGoogle Scholar
• Caprara A., Fischetti M. {0, ½}-Chvátal-Gomory cuts. Math. Programming (1996) 74:221–235Crossref, Google Scholar
• Caprara A., Fischetti M., Letchford A. N. On the separation of maximally violated mod-k cuts. Math. Programming Ser. A (2000) 87:37–56Crossref, Google Scholar
• De Vitis A. Capacity constraints and extensions in vehicle routing problems. (1998) . Ph.D. thesis, Istituto di Analisi dei Sistemi ed Informatica “A. Ruberti”—CNR, Rome, ItalyGoogle Scholar
• Fleischer L. Building chain and cactus representations of all minimum cuts from Hao-Orlin in the same asymptotic run time. J. Algorithms (1999) 33:51–72Crossref, Google Scholar
• Fukasawa R., de Aragão M. Poggi, Reis M., Uchoa E. Robust branch-and-cut-and-price for the capacitated vehicle routing problem. (2003) . Rep. RPEP Vol. 3 No. 8, Sept. 2003, Departamento de Engenharia de Produção, Universidade Federal Fluminense, Niterói, BrazilGoogle Scholar
• Fukasawa R., Lysgaard J., de Aragão M. Poggi, Reis M., Uchoa E., Werneck R. F. Robust branch-and-cut-and-price for the capacitated vehicle routing problem. Integer Programming and Combinatorial Optimization, Proc. 10th Internat. IPCO Conf. (2004) 3064New York, NY, USA(Springer, Heidelberg, Germany) 1–15June 2004, LNCSCrossref, Google Scholar
• Hao J., Orlin J. B. A faster algorithm for finding the minimum cut in a directed graph. J. Algorithms (1994) 17:424–446Crossref, Google Scholar
• Jünger M., Thienel S. Introduction to ABACUS—A branch-and-cut system. Oper. Res. Lett. (1998) 22:83–95Crossref, Google Scholar
• Laporte G., Dell’Amico M., Maffioli F., Martello S. Vehicle routing. Annotated Bibliographies in Combinatorial Optimization (1997) (John Wiley & Sons, New York) 223–240Google Scholar
• Letchford A. N., Eglese R. W., Lysgaard J. Multistars, partial multistars and the capacitated vehicle routing problem. Math. Programming Ser. A (2002) 94:21–40Crossref, Google Scholar
• Lysgaard J., Letchford A. N., Eglese R. W. A new branch-and-cut algorithm for the capacitated vehicle routing problem. Math. Programming Ser. A (2004) 100:423–445Crossref, Google Scholar
• Naddef D., Rinaldi G., Toth P., Vigo D. Branch-and-cut algorithms for the capacitated VRP. The Vehicle Routing Problem, SIAM Monographs on Discrete Mathematics and Applications (2002) (SIAM, Philadelphia, PA) 53–84Crossref, Google Scholar
• Ralphs T. K.Vehicle Routing Data Sets (2003) . http://www.branchandcut.org/VRP/dataGoogle Scholar
• Ralphs T. K., Kopman L., Pulleyblank W. R., Trotter L. E. On the capacitated vehicle routing problem. Math. Programming Ser. B (2003) 94:343–359Crossref, Google Scholar
• Toth P., Vigo D.The Vehicle Routing Problem, SIAM Monographs on Discrete Mathematics and Applications (2002) (SIAM, Philadelphia, PA) Google Scholar
• Wenger K. M. Generic cut generation methods for routing problems. (2003) . Ph.D. thesis, Institute of Computer Science, University of Heidelberg, Heidelberg, GermanyGoogle Scholar