Optimizing over the subtour polytope of the travelling salesman problem

A commonly studied relaxation of the travelling salesman problem is obtained by adding subtour elimination constraints to the constraints of a 2-factor problem and removing the integrality requirement. We investigate the problem of solving this relaxation for a special type of objective function. We also discuss some ways in which this relates to the concept of rank introduced by Chvátal.

[1]  George B. Dantzig,et al.  Solution of a Large-Scale Traveling-Salesman Problem , 1954, Oper. Res..

[2]  T. C. Hu,et al.  Multi-Terminal Network Flows , 1961 .

[3]  Richard M. Karp,et al.  The Traveling-Salesman Problem and Minimum Spanning Trees , 1970, Oper. Res..

[4]  Vasek Chvátal,et al.  Edmonds polytopes and a hierarchy of combinatorial problems , 1973, Discret. Math..

[5]  Vasek Chvátal,et al.  Edmonds polytopes and weakly hamiltonian graphs , 1973, Math. Program..

[6]  J. Edmonds,et al.  Facets of I-matching polyhedra , 1974 .

[7]  Martin Grötschel,et al.  On the symmetric travelling salesman problem I: Inequalities , 1979, Math. Program..

[8]  Martin Grötschel,et al.  On the symmetric travelling salesman problem II: Lifting theorems and facets , 1979, Math. Program..

[9]  M. Padberg,et al.  On the symmetric travelling salesman problem II , 1979 .

[10]  Martin Grötschel,et al.  On the symmetric travelling salesman problem: Solution of a 120-city problem , 1980 .

[11]  Manfred W. Padberg,et al.  On the symmetric travelling salesman problem: A computational study , 1980 .

[12]  Richard M. Karp,et al.  On linear characterizations of combinatorial optimization problems , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[13]  Martin Grötschel,et al.  The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..

[14]  Laurence A. Wolsey,et al.  Trees and Cuts , 1983 .

[15]  Eugene L. Lawler,et al.  Traveling Salesman Problem , 2016 .

[16]  Gérard Cornuéjols,et al.  The traveling salesman problem on a graph and some related integer polyhedra , 1985, Math. Program..

[17]  William R. Pulleyblank,et al.  Clique Tree Inequalities and the Symmetric Travelling Salesman Problem , 1986, Math. Oper. Res..

[18]  William J. Cook,et al.  On cutting-plane proofs in combinatorial optimization , 1989 .