Facet identification for the symmetric traveling salesman polytope

Several procedures for the identification of facet inducing inequalities for the symmetric traveling salesman polytope are given. An identification procedure accepts as input the support graph of a point which does not belong to the polytope, and returns as output some of the facet inducing inequalities violated by the point. A procedure which always accomplishes this task is calledexact, otherwise it is calledheuristic. We give exact procedures for the subtour elimination and the 2-matching constraints, based on the Gomory—Hu and Padberg—Rao algorithms respectively. Efficient reduction procedures for the input graph are proposed which accelerate these two algorithms substantially. Exact and heuristic shrinking conditions for the input graph are also given that yield efficient procedures for the identification of simple and general comb inequalities and of some elementary clique tree inequalities. These procedures constitute the core of a polytopal cutting plane algorithm that we have devised and programmed to solve a substantial number of large-scale problem instances with sizes up to 2392 nodes to optimality.

[1]  M. Grötschel,et al.  Solving matching problems with linear programming , 1985, Math. Program..

[2]  Nicos Christofides,et al.  An Algorithm for the Vehicle-dispatching Problem , 1969 .

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

[4]  Patrick D. Krolak,et al.  A man-machine approach toward solving the traveling salesman problem , 1970, DAC '70.

[5]  B. Gillett,et al.  Multi-terminal vehicle-dispatch algorithm , 1976 .

[6]  Giovanni Rinaldi,et al.  An efficient algorithm for the minimum capacity cut problem , 1990, Math. Program..

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

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

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

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

[11]  Giovanni Rinaldi,et al.  A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems , 1991, SIAM Rev..

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

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

[14]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[15]  M. Padberg,et al.  Addendum: Optimization of a 532-city symmetric traveling salesman problem by branch and cut , 1990 .

[16]  H. Weyl.  Elementare Theorie der konvexen Polyeder , 1934 .

[17]  J. P. Secrétan,et al.  Der Saccus endolymphaticus bei Entzündungsprozessen , 1944 .

[18]  Michele Conforti,et al.  A construction for binary matroids , 1987, Discret. Math..

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