Clique Tree Inequalities and the Symmetric Travelling Salesman Problem

The linear programming cutting plane approach for solving the travelling salesman problem has recently proven to be highly successful, cf. Crowder and Padberg Crowder, H. P., M. W. Padberg. 1980. Solving large-scale symmetric travelling salesman problems to optimality. Management Sci.26 495--509., Grotschel Grotschel, M. 1980a. On the symmetric travelling salesman problem: Solution of a 120 city problem. Math. Programming Stud.12 61--77., Padberg and Hong Padberg, M. W., S. Hong. 1980. On the symmetric travelling salesman problem: A computational study. Math. Programming Stud.12 78--107.. One of the reasons for this success is certainly the fact that instead of ordinary cutting planes Gomory-cuts etc. problem-specific cutting planes could be used which define facets of the underlying integer programming polytopes. In this paper we shall define a new class of inequalities clique tree inequalities valid for the travelling salesman polytope which properly contains many of the known classes of inequalities like subtour elimination constraints, 2-matching constraints, comb inequalities, and we show that all these new inequalities induce facets of the travelling salesman polytope. Since the general structure of these new inequalities is quite simple we hope that it will be possible to use the inequalities efficiently in cutting plane procedures for the travelling salesman problem.

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

[2]  Martin Grötschel,et al.  Polyedrische Charakterisierungen kombinatorischer Optimierungsprobleme , 1977 .

[3]  Martin Grötschel,et al.  On the Monotone Symmetric Travelling Salesman Problem: Hypohamiltonian/Hypotraceable Graphs and Facets , 1980, Math. Oper. Res..

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

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

[6]  Jack Edmonds,et al.  Maximum matching and a polyhedron with 0,1-vertices , 1965 .

[7]  H. Crowder,et al.  Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality , 1980 .

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

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

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

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

[12]  M. R. Rao,et al.  Odd Minimum Cut-Sets and b-Matchings , 1982, Math. Oper. Res..

[13]  W. T. Tutte Lectures on matroids , 1965 .

[14]  H. Whitney On the Abstract Properties of Linear Dependence , 1935 .