The Symmetric Traveling Salesman Polytope Revisited

References

• Applegate D., Bixby R., Chvátal V., Cook W. On the solution of traveling salesman problems. Documenta Math. (1998) Extra Volume:645–656Google Scholar
• Boyd S., Cunningham W. Small traveling salesman polytopes. Math. Oper. Res. (1991) 16:259–271Link, Google Scholar
• Boyd S., Cockburn S., Vella D. On the domino-parity inequalities for the for the traveling salesman problem. (2000) . Technical report, University of Ottawa, Ottawa, CanadaGoogle Scholar
• Boyd S., Cunningham W., Queyranne M., Wang Y. Ladders for the traveling salesmen. SIAM J. Optim. (1993) 5:408–420Crossref, Google Scholar
• Chvátal V. Edmonds polytopes and weakly Hamiltonian graphs. Math. Programming (1973) 5:29–40Crossref, Google Scholar
• Cockburn S. On the DP constraints for the for the traveling salesman problem. (2000) . Technical report, University of Ottawa, Ottawa, CanadaGoogle Scholar
• Cornuéjols G., Fonlupt J., Naddef D. The traveling salesman problem on a graph and some ralated polyhedra. Math. Programming (1985) 33:1–27Crossref, Google Scholar
• Fleischmann B. A new class of cutting planes of the symmetric traveling salesman problem. Math. Programming (1988) 40:225–246Crossref, Google Scholar
• Grötschel M., Padberg M. On the symmetric traveling salesman problem I: inequalities. Math. Programming (1979) 16:265–280Crossref, Google Scholar
• Grötschel M., Padberg M. On the symmetric traveling salesman problem II: lifting theorems and facets. Math. Programming (1979) 16:281–302Crossref, Google Scholar
• Grötschel M., Pulleyblank W. Clique tree inequalities and the symmetric traveling salesman problem. Math. Oper. Res. (1986) 11:537–569Link, Google Scholar
• Letchford A. Separating a superclass of comb inequalities in planar graphs. Math. Oper. Res. (2000) 25(3):443–454Link, Google Scholar
• Naddef D., Cook W., Seymour P. Handles and teeth in the symmetric traveling salesman polytope. Polyhedral Combinatorics (1990) (AMS and ACM, Providence, RI) 61–74DIMACS Series in Discrete Mathematics and Theoretical Computer ScienceGoogle Scholar
• Naddef D. The binested inequalities of the symmetric traveling salesman polytope. Math. Oper. Res. (1992) 17:882–900Link, Google Scholar
• Naddef D. On the domino inequalities for the Symmetric Traveling Salesman polytope. (2001) . Technical report, Laboratoire ID-IMAG, The sharpest cuts, MPS/SIAM series in Optimization, ForthcomingGoogle Scholar
• Naddef D., Rinaldi G. The symmetric traveling salesman polytope and its graphical relaxation: composition of valid inequalities. Math. Programming (1991) 51:359–400Crossref, Google Scholar
• Naddef D., Rinaldi G. The crown inequalities for the traveling salesman polytope. Math. Oper. Res. (1992) 17:308–326Link, Google Scholar
• Naddef D., Rinaldi G. The graphical relaxation: a new framework for the symmetric traveling salesman polytope. Math. Programming (1993) 58:53–88Crossref, Google Scholar
• Padberg M., Hong S. On the symmetric traveling salesman problem: a computational study. Math. Programming Stud. (1980) 12:78–107Crossref, Google Scholar