Maximally violated mod-p cuts for the capacitated vehicle-routing problem

INFORMS Journal on Computing

Volumn 18, Issue 4, 2006, Pages 466-479

  Reinelt, Gerhard ^a   Wenger, Klaus M ^b  

^a UNIVERSITY OF HEIDELBERG   (Germany)

^b Much net AG   (Germany)

Author keywords

Branch and cut; Generic cuts; Optimization; Transportation; Vehicle routing

Indexed keywords

EID: 33847017801     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.1040.0125     Document Type: Article

References (22)

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