Not every GTSP facet induces an STSP facet

Lecture Notes in Computer Science

Volumn 3509, Issue , 2005, Pages 468-482

  Oswald, Marcus ^a   Reinelt, Gerhard ^a   Theis, Dirk Oliver ^a  

^a UNIVERSITY OF HEIDELBERG   (Germany)

Author keywords

Facets; Graphical Traveling Salesman Problem; Polyhedral combinatorics; Polyhedral computation; Symmetric Traveling Salesman Problem

Indexed keywords

COMPUTATIONAL GEOMETRY; GRAPH THEORY; INTEGER PROGRAMMING; PROBLEM SOLVING;

FACETS; GRAPHICAL TRAVELING SALESMAN PROBLEM (GTSP); SPARSE GRAPHS; SYMMETRIC TRAVELING SALESMAN PROBLEM (STSP);

TRAVELING SALESMAN PROBLEM;

EID: 24944541397     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11496915_34     Document Type: Conference Paper

References (19)

1. D. Alevras and M. W. Padberg. Linear optimization and extensions: problems and solutions. Springer-Verlag Berlin Heidelberg, 2001.
2. D. Applegate, R. Bixby, V. Chvátal, and W. Cook. On the solution of the Traveling Salesman Problem. In Doc. Math. J. DMV (Extra Volume ICM), pages 645-656, 1998.
3. D. Applegate, R. Bixby, V. Chvátal, and W. Cook. TSP cuts which do not conform to the template paradigm. In M. Jünger and D. Naddef, editors, Computational Combinatorial Optimization, pages 261-303. Springer-Verlag Berlin Heidelberg, 2001.
4. D. Applegate, R. Bixby, V. Chvátal, and W. Cook. Implementing the Dantzig-Fulkerson-Johnson algorithm for large Traveling Salesman Problems. Math. Program. Ser. B, 97(1-2):91-153, 2003.
5. S. C. Boyd and W. H. Cunningham. Small Travelling Salesman Polytopes. Math. Oper. Res, 16(2):259-271, 1991.
6. R. Carr. Separating over classes of TSP inequalities defined by 0-node lifting in polynomial time. In W. H. Cunningham, S. T. McCormick, and M. Queyranne, editors, Proc. IPCO V, pages 460-474, 1996.
7. R. Carr. Separation algorithms for classes of STSP inequalities arising from a new STSP relaxation. Math. Oper. Res, 29(1):80-91, 2004.
8. T. Christof, M. Jünger, and G. Reinelt. A complete description of the traveling salesman polytope on 8 nodes. OR Letters, 10:497-500, 1991.
9. T. Christof and A. Loöbel. PORTA - a polyhedron representation algorithm, 1998. http://www.informatik.uni-heidelberg.de/groups/comopt/software/ PORTA/.
10. T. Christof and G. Reinelt. SmaPo - library of Small Polytopes. http://www./informatik.uni-heidelberg.degroups/comopt/software/SMAPO//tsp/tsp. html.
11. T. Christof and G. Reinelt. Decomposition and parallelization techniques for enumerating the facets of combinatorial polytopes. Int. J. Comput. Geom. Appl., 11:423-437, 2001.
12. G. Cornuéjols, J. Fonlupt, and D. Naddef. The Traveling Salesman Problem on a Graph and some related Integer Polyhedra. Math. Program., 33:1-27, 1985.
13. G. Dantzig, R. Fulkerson, and S. Johnson. Solution of a large-scale traveling salesman problem. Oper. Res., 2:393-410, 1954.
14. B. Fleischmann. A cutting plane procedure for the travelling salesman problem on road networks. Eur. J. Oper. Res., 21:307-317, 1985.
15. J. Fonlupt and D. Naddef. The Traveling Salesman Problem in graphs whith some excluded minors. Math. Program., 53(2):147-172, 1992.
16. M. X. Goemans. Worst-case comparison of valid inequalities for the TSP. Math. Program., 69(2):335-349, 1995.
17. D. Naddef and G. Rinaldi. The symmetric traveling salesman polytope and its graphical relaxation: Composition of valid inequalities. Math. Program., 51:359-400, 1991.
18. D. Naddef and G. Rinaldi. The graphical relaxation: A new framework for the Symmetric Traveling Salesman Polytope. Math. Program., 58:53-88, 1993.
19. A. Schrijver. Theory of Linear and Integer Programming. Wiley, 1986.