New results on the mixed general routing problem

Operations Research

Volumn 53, Issue 2, 2005, Pages 363-376

  Corberán, Angel ^a   Mejía, Gustave ^b   Sanchis, José M ^c  

^a UNIVERSITY OF VALENCIA   (Spain)

^b UNIVERSIDAD EAFIT   (Colombia)

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

Author keywords

General routing problem; Mixed rural postman problem; Polyhedral combinatorics; Rural postman problem

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; MATHEMATICAL MODELS; PROBLEM SOLVING; SET THEORY; TRAVELING SALESMAN PROBLEM;

GENERAL ROUTING PROBLEM; MIXED RURAL POSTMAN PROBLEM; POLYHEDRAL COMBINATORICS; RURAL POSTMAN PROBLEM;

OPERATIONS RESEARCH;

EID: 18744397561     PISSN: 0030364X     EISSN: None     Source Type: Journal    
DOI: 10.1287/opre.1040.0168     Document Type: Article

References (35)

1. Assad, A. A., B. L. Golden. 1995. Arc routing methods and applications. M. O. Ball, T. L. Magnanti, C. L. Monma, G. L. Nemhauser, eds. Network Routing. Handbooks in Operations Research and Management Science, Vol. 8. North-Holland, Amsterdam, The Netherlands.
2. Benavent, E., A. Corberán, J. M. Sanchis. 2000. Linear programming based methods for solving arc routing problems. M. Dror, ed. Arc Routing: Theory, Solutions and Applications. Kluwer Academic Publishers, Boston, MA.
3. Chopra, S., G. Rinaldi. 1996. The graphical asymmetric traveling salesman polyhedron: Symmetric inequalities. SIAM J. Discrete Math. 9(4) 602-624.
4. Christofides, N., V. Campos, A. Corberán, E. Mota. 1981. An algorithm for the rural postman problem. Report IC.O.R.81.5. Imperial College, London, UK.
5. Christofides, N., V. Campos, A. Corberán, E. Mota. 1986. An algorithm for the rural postman problem on a directed graph. Math. Programming Stud. 26 155-166.
6. Christofides, N., E. Benavent, V. Campos, A. Corberán, E. Mota. 1984. An optimal method for the mixed postman problem. P. Thoft-Christensen, ed. System Modelling and Optimization. Lecture Notes in Control and Information Sciences, Vol. 59. Springer-Verlag, Berlin, Germany.
7. Corberán, A., J. M. Sanchis. 1994. A polyhedral approach to the rural postman problem. Eur. J. Oper. Res. 79 95-114.
8. Corberán, A., J. M. Sanchis. 1998. The general routing problem polyhedron: Facets from the RPP and GTSP polyhedra. Eur. J. Oper. Res. 108 538-550.
9. Corberán, A., A. Letchford, J. M. Sanchis. 2001. A cutting plane algorithm for the general routing problem. Math. Programming 90 291-316.
10. Corberán, A., A. Romero, J. M. Sanchis. 2003. The mixed general routing problem polyhedron. Math. Programming 96 103-137.
11. Cornuèjols, G., J. Fonlupt, D. Naddef. 1985. The traveling salesman problem on a graph and some related integer polyhedra. Math. Programming 33 1-27.
12. Dror, M. ed. 2000a. Arc Routing: Theory, Solutions and Applications. Kluwer Academic Publishers, Boston, MA.
13. Dror, M. 2000b. Arc routing: Complexity and approximability. M. Dror, ed. Arc Routing: Theory, Solutions and Applications. Kluwer Academic Publishers, Boston, MA.
14. Edmonds, J. 1963. The Chinese postman problem. Oper. Res. 13(Suppl. 1) B73-B77.
15. Edmonds, J., E. L. Johnson. 1973. Matching, Euler tours and the Chinese postman. Math. Programming 5 88-124.
16. Eglese, R. W., A. N. Letchford. 2000. Polyhedral theory for arc routing problems. M. Dror, ed. Arc Routing: Theory, Solutions and Applications. Kluwer Academic Publishers, Boston, MA.
17. Eiselt, H. A., M. Gendreau, G. Laporte. 1995a. Arc-routing problems, part 1. The Chinese postman problem. Oper. Res. 43 231-242.
18. Eiselt, H. A., M. Gendreau, G. Laporte. 1995b. Arc-routing problems, part 2. The rural postman problem. Oper. Res. 43 399-414.
19. Fernández, E., R. Garfinkel, O. Meza, M. Ortega. 2003. On the undirected rural postman problem: Tight bounds based on a new formulation. Oper. Res. 51 281-291.
20. Fleischmann, B. 1985. A cutting plane procedure for the traveling salesman problem on a road network. Eur. J. Oper. Res. 21 307-317.
21. Fleischmann, B. 1988. A new class of cutting planes for the STSP. Math. Programming 40 225-246.
22. Ford, L. R., D. R. Fulkerson. 1962. Flows in Networks. Princeton University Press, Princeton, NJ.
23. Ghiani, G., G. Laporte. 2000. A branch and cut algorithm for the rural postman problem. Math. Programming 87 467-481.
24. Grötschel, M., Z. Win. 1992. A cutting plane algorithm for the windy postman problem. Math. Programming 55 339-358.
25. Guan, M. 1962. Graphic programming using odd or even points. Chinese Math. 1 237-277.
26. Hertz, A., M. Mittaz. 2000. Heuristic algorithms. M. Dror, ed. Arc Routing: Theory, Solutions and Applications. Kluwer Academic Publishers, Boston, MA.
27. Lenstra, J., A. Rinnooy-Kan. 1976. On general routing problems. Networks 6 273-280.
28. Letchford, A. N. 1997. New inequalities for the general routing problem. Eur. J. Oper. Res. 96 317-322.
29. Letchford, A. N. 1999. The general routing polyhedron: A unifying frame-work. Eur. J. Oper. Res. 112 122-133.
30. Naddef, D., G. Rinaldi. 1991. The symmetric traveling salesman polytope and its graphical relaxation: Composition of valid inequalities. Math. Programming 51 359-400.
31. Nobert, Y., J. C. Picard. 1996. An optimal algorithm for the mixed Chinese postman problem. Networks 27 95-108.
32. Orloff, C. S. 1974. A fundamental problem in vehicle routing. Networks 435-64.
33. Papadimitriou, C. H. 1976. On the complexity of edge traversing. J. ACM 23 544-554.
34. Reinelt, G., D. Theis. 2004. About the general routing problem polytope. Technical report, Institut für Informatik, Heidelberg University, Heidelberg, Germany.
35. Romero, A. 1997. The rural postman problem on a mixed graph. Ph.D. dissertation (in Spanish), Department of Statistics and Operations Research, University of Valencia, Valencia, Spain.