Transformation of facets of the general routing problem polytope

SIAM Journal on Optimization

Volumn 16, Issue 1, 2006, Pages 220-234

  Reinelt, Gerhard ^a   Theis, Dirk Oliver ^a  

^a UNIVERSITY OF HEIDELBERG   (Germany)

Author keywords

Facets; General routing problem; Polytope; Rural postman problem; Separation

Indexed keywords

BRIDGES; MATHEMATICAL TRANSFORMATIONS; POLYNOMIALS; PROBLEM SOLVING; SEPARATION;

FACETS; GENERAL ROUTING PROBLEM; POLYTOPE; RURAL POSTMAN PROBLEM;

ALGORITHMS;

EID: 33144457621     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/040607307     Document Type: Article

References (20)

1. F. BARAHONA AND M. GRÖTSCHEL, On the cycle polytope of a binary matroid, J. Combin. Theory Ser. B, 40 (1986), pp. 40-62.
2. E. BENAVENT, A. CORBERÁN, AND J. M. SANCHIS, Linear programming based methods for solving arc routing problems, in Arc Routing: Theory, Solutions, and Applications, M. Dror, ed., Kluwer Academic Publishers, Boston, 2000, pp. 231-275.
3. N. CHRISTOFIDES, V. CAMPOS, A. CORBERÁN, AND E. MOTA, An Algorithm for the Rural Postman Problem on a Graph, Technical report, Imperial College, London, 1981.
4. A. CORBERÁN, A. N. LETCHFORD, AND J. M. SANCHIS, A cutting plane algorithm for the general routing problem, Math. Program. Ser A, 90 (2001), pp. 291-316.
5. A. CORBERÁN AND J. M. SANCHIS, A polyhedral approach to the rural postman problem, Eur. J. Oper. Res., 79 (1994), pp. 95-114.
6. A. CORBERÁN AND J. M. SANCHIS, The general routing problem polyhedron: Facets from the RPP and GTSP polyhedra., Eur. J. Oper. Res., 108 (1998), pp. 538-550.
7. G. CORNUÉJOLS, J. FONLUPT, AND D. NADDEF, The traveling salesman problem on a graph and some related integer polyhedra, Math. Program., 33 (1985), pp. 1-27.
8. G. GHIANI AND G. LAPORTE, A branch-and-cut algorithm for the undirected rural postman problem, Math. Program. Ser. A, 87 (2000), pp. 467-481.
9. A. V. GOLDBERG AND R. E. TARJAN, A new approach to the maximum flow problem, J. Association for Computing Machinery, 35 (1988), pp. 921-940.
10. M. GRÖTSCHEL, L. LOVÁSZ, AND A. SCHRIJVER, Geometric Algorithms and Combinatorial Optimization, Wiley, New York, 1988.
11. J. K. LENSTRA AND A. H. G. RINNOOY KAN, On general routing problems, Networks, 6 (1976), pp. 273-280.
12. A. N. LETCHFORD, New inequalities for the general routing problem, Eur. J. Oper. Res., 96 (1997), pp. 317-322.
13. A. N. LETCHFORD, The general routing polyhedron: A unifying framework, Eur. J. Oper. Res., 112 (1999), pp. 122-133.
14. A. N. LETCHFORD, G. REINELT, AND D. O. THEIS, A faster exact separation algorithm for blossom inequalities, in Integer Programming and Combinatorial Optimization IPCO, Lecture Notes Comput. Sci. 3064, D. Bienstock and G. Nemhauser, eds., Springer-Verlag, Berlin Heidelberg, 2004, pp. 196-205.
15. C. ORLOFF, A fundamental problem in vehicle routing, Networks, 4 (1974), pp. 35-64.
16. M. W. PADBERG AND M. R. RAO, Odd minimum cut-sets and b-matchings, Math. Oper. Res., 7 (1982), pp. 67-80.
17. G. REINELT AND D. O. THEIS, On the general routing problem polytope, A. Clark, R. Eglese, A. N. Letchford, and M. B. Wright, eds., special issue of Discrete Appl. Math. on Combinatorial Optimization (CO2004), to appear.
18. G. REINELT AND D. O. THEIS, A note on the undirected rural postman problem polytope, Math. Program., to appear.
19. D. O. THEIS, Das General Routing Problem mit binären Variablen, diploma thesis, University of Heidelberg, Heidelberg, Germany, 2001.
20. G. M. ZIEGLER, Lectures on Polytopes, Graduate Texts in Mathematics, Vol. 152, Springer-Verlag, Berlin, 1998.