A cutting plane algorithm for the General Routing Problem

Mathematical Programming, Series B

Volumn 90, Issue 2, 2001, Pages 291-316

  Corberán, Angel ^a   Letchford, Adam N ^b   Sanchis, José María ^c  

^a UNIVERSITY OF VALENCIA   (Spain)

^b LANCASTER UNIVERSITY   (United Kingdom)

^c UNIVERSITAT POLITÈCNICA DE VALÈNCIA   (Spain)

Author keywords

Cutting planes; General Routing Problem; Graphical Travelling Salesman Problem; Rural Postman Problem; Valid inequalities

Indexed keywords

EID: 4243433639     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/pl00011426     Document Type: Article

References (29)

1. Applegate, D., Bixby, R.E., Chvátal, V., Cook, W. (1995): Finding cuts in the TSP. DIMACS Technical Report TR 95-05, Rutgers University, New Brunswick, NJ, USA
2. Augerat, P., Belenguer, J.M., Benavent, E., Corberán, A., Naddef, D., Rinaldi, G. (1995): Computational results with a branch-and-cut code for the capacitated vehicle routing problem. Research report RR949-M, ARTEMIS-IMAG, France
3. Belenguer, J.M., Benavent, E. (1998): The capacitated arc routing problem: valid inequalities and facets. Comput. Optim. Appl. 10, 165-187
4. Christofides, N., Campos, V., Corberán, A., Mota, E. (1981): An algorithm for the rural postman problem. Imperial College Report IC.OR.81.5, London
5. Corberán, A., Sanchis, J.M. (1994): A polyhedral approach to the rural postman problem. Eur. J. Opl Res. 79, 95-114
6. Corberán, A., Sanchis, J.M. (1998): The general routing problem polyhedron: facets from the RPP and GTSP polyhedra. Eur. J. Opl Res. 108, 538-550
7. Cornuéjols, G., Fonlupt, J., Naddef, D. (1985): The travelling salesman on a graph and some related integer polyhedra. Math. Program. 33, 1-27
8. Edmonds, J., Johnson, E.L. (1973): Matchings, Euler tours and the Chinese postman problem. Math. Program. 5, 88-124
9. Eiselt, H.A., Gendreau, M., Laporte, G. (1995): Arc-routing problems, part 2: the rural postman problem. Oper. Res. 43, 399-114
10. Fleischmann, B. (1985): A cutting-plane procedure for the travelling salesman problem on a road network. Eur. J. Opl Res. 21, 307-317
11. Ghiani, G., Laporte, G. (2000): A branch-and-cut algorithm for the undirected rural postman problem. Math. Program. 87, 467-482
12. Grötschel, M., Holland, O. (1985): Solving matching problems with linear programming. Math. Program. 33, 243-259
13. Grötschel, M., Padberg, M.W. (1979): On the symmetric travelling salesman problem I: inequalities. Math. Program. 16, 265-280
14. Grötschel, M., Win, Z. (1992): A cutting plane algorithm for the windy postman problem. Math. Program. 55, 339-358
15. Hertz, A., Laporte, G., Nanchen, P. (1999): Improvement procedures for the undirected rural postman problem. INFORMS J. Comput. 11, 53-62
16. Jünger, M., Reinelt, G., Rinaldi, G. (1995): The travelling salesman problem. In: Ball et al., eds., Network Models. Handbooks on Operations Research and Management Science Vol. 7. Elsevier, Amsterdam
17. Jünger, M., Reinelt, G., Rinaldi, G. (1997): The travelling salesman problem. In: Dell'Amico et al., eds., Annotated Bibliographies in Combinatorial Optimization. Wiley, New York
18. Lenstra, J.K., Rinnooy-Kan, A.H.G. (1976): On general routing problems. Networks 6, 273-280
19. Letchford, A.N. (1997): New inequalities for the general routing problem. Eur. J. Opl Res. 96, 317-322
20. Letchford, A.N. (1999): The general routing polyhedron: a unifying framework. Eur. J. Opl Res. 112, 122-133
21. Nagamochi, H., Ono, T., Ibaraki, T. (1994): Implementing an efficient minimum capacity cut algorithm. Math. Program. 67, 325-341
22. Nemhauser, G.L., Wolsey, L.A. (1988): Integer and Combinatorial Optimization. Wiley, New York
23. Nobert, Y., Picard, J.-C. (1996): An optimal algorithm for the mixed Chinese postman problem. Networks 27, 95-108
24. Orloff, C.S. (1974): A fundamental problem in vehicle routing. Networks 4, 35-64
25. Padberg, M.W., Rao, M.R. (1982): Odd minimum cut-sets and b-matchings. Math. Oper. Res. 7, 67-80
26. Padberg, M.W., Rinaldi, G. (1990): Facet identification for the symmetric travelling salesman polytope. Math. Program. 47, 219-257
27. Padberg, M.W., Rinaldi, G. (1991): A branch-and-cut algorithm for the resolution of large-scale symmetric travelling salesman problems. SIAM Rev. 33, 60-100
28. Reinelt, G. (1991): TSPLIB - a travelling salesman problem library. ORSA J. Comput. 3, 376-384
29. Tarjan, R.E. (1972): Depth first search and linear graph algorithms. SIAM J. Comp. 1, 146-60