The symmetric traveling salesman polytope: New facets from the graphical relaxation

Mathematics of Operations Research

Volumn 32, Issue 1, 2007, Pages 233-256

  Naddef, Denis ^a   Rinaldi, Giovanni ^b  

^a LABORATOIRE G SCOP   (France)

^b CNR   (Italy)

Author keywords

Facet; Hamiltonian cycle; Linear inequality; Polyhedron; Traveling salesman problem

Indexed keywords

COMPUTATION THEORY; GRAPH THEORY; HAMILTONIANS; LINEAR SYSTEMS; PROBLEM SOLVING;

FACETS; HAMILTONIAN CYCLE; LINEAR INEQUALITY; POLYHEDRONS;

TRAVELING SALESMAN PROBLEM;

EID: 33847275207     PISSN: 0364765X     EISSN: 15265471     Source Type: Journal    
DOI: 10.1287/moor.1060.0244     Document Type: Article

References (24)

1. Balas, E., M. Fischetti. 1997. On the monotonization of polyhedra. Math. Progmmming 77 59-84.
2. Christof, T., G. Reinelt. 1996. Combinatorial optimization and small polytopes. TOP 4 1-53.
3. Chvátal, V. 1973. Edmonds polytopes and weakly Hamiltonian graphs. Math. Programming 5 29-40.
4. Clochard, J. M., D. Naddef. 1993. Using path inequalities in a branch and cut code for the symmetric traveling salesman problem. G. Rinaldi, L. A. Wolsey, eds. Proc. 3rd Math. Programming Conf. Integer Programming Combin. Optim. CORE, Louvain-la-Neuve, Belgium, 291-311.
5. 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.
6. Goemans, M. X. 1995. Worst-case comparison of valid inequalities for the TSP. Math. Programming 69 335-349.
7. Grötschel, M. 1980. On the monotone symmetric travelling salesman problem: Hypohamiltonian/hypotraceable graphs and facets. Math. Oper. Res. 5 285-292.
8. Grötschel, M., L. Lovász. 1995. Combinatorial optimization. R. L. Graham, M. Grötschel, L. Lovász, eds. Handbook of Combinatorics, Vol. II, Chap. 28. North-Holland, Amsterdam, The Netherlands, 1541-1597.
9. Grötschel, M., M. W. Padberg. 1979. On the symmetric travelling salesman problem I: Inequalities. Math. Programming 16 265-280.
10. Grötschel, M., M. W. Padberg. 1979. On the symmetric travelling salesman problem II: Lifting theorems and facets. Math. Programming 16 281-302.
11. Grötschel, M., W. R. Pulleyblank. 1986. Clique tree inequalities and the symmetric travelling salesman problem. Math. Oper. Res. 11 537-569.
12. Jünger, M., G. Reinelt, G. Rinaldi. 1995. The traveling salesman problem. M. O. Ball, T. L. Magnanti, C. L. Monma, G. L. Nemhauser, eds. Network Models, Handbooks in Operations Research and Management Science, Vol. 7, Chap. 4. North-Holland, Amsterdam, The Netherlands, 225-330.
13. Lawler, E. L., J. K. Lenstra, A. H. G. Rinnooy Kan, D. B. Shmoys, eds. 1985. The Traveling Salesman Problem. Wiley-Interscience Series in Discrete Mathematics. John Wiley & Sons, Chichester.
14. Naddef, D. 2002. Polyhedral theory, branch and cut algorithms for the symmetric traveling salesman problem. G. Gutin, A. Punnen, eds. The Traveling Salesman Problem and Its Variations. Combinatorial Optimization. Kluwer Academic Publisher, Dordrecht, The Netherlands, 29-116.
15. Naddef, D., Y. Pochet. 2001. The symmetric traveling salesman polytope revisited. Math. Oper. Res. 26 700-722.
16. Naddef, D., G. Rinaldi. 1988. The symmetric traveling salesman polytope: New facets from the graphical relaxation. Technical Report 248, IASI-CNR, Rome, Italy.
17. Naddef, D., G. Rinaldi. 1991. The symmetric traveling salesman polytope and its graphical relaxation: Composition of valid inequalities. Math. Programming 51 359-400.
18. Naddef, D., G. Rinaldi. 1993. The graphical relaxation: A new framework for the symmetric traveling salesman polytope. Math. Programming 58 53-88.
19. Naddef, D., S. Thienel. 2002. Efficient separation routines for the symmetric traveling salesman problem. I: General tools and comb separation. Math. Programming 92(2) 237-255.
20. Naddef, D., S. Thienel. 2002. Efficient separation routines for the symmetric traveling salesman problem. II: Separating multihandle inequalities. Math. Programming 92(2) 257-283.
21. Naddef, D., E. Wild. 2003. The domino inequalities: Facets for the symmetric traveling salesman polytope. Math. Programming 98 223-251.
22. Nemhauser, G. L., L. A. Wolsey. 1988. Integer and Combinatorial Optimization. Discrete Mathematics and Optimization. Wiley-Interscience, New York.
23. Oswald, M., G. Reinelt, D. O. Theis. 2005. Not every GTSP facet induces a STSP facet. M. Jünger, V. Kaibel, eds. Integer Programming & Combinatorial Optimization (IPCO) XI, Lecture Notes in Computer Science, Vol. 3509. Springer-Verlag GmbH, Berlin, Germany, 468-482.
24. Padberg, M. W., S. Hong. 1980. On the symmetric travelling salesman problem: A computational study. Math. Programming Stud. 12 78-107.