Polynomial-Time Separation of Simple Comb Inequalities
The comb inequalities are a well-known class of facet-inducing inequalities for the Traveling Salesman Problem, defined in terms of certain vertex sets called the handle and the teeth. We say that a comb inequality is simple if the following holds for each tooth: either the intersection of the tooth with the handle has cardinality one, or the part of the tooth outside the handle has cardinality one, or both. The simple comb inequalities generalize the classical 2-matching inequalities of Edmonds, and also the so-called Chvátal comb inequalities.
In 1982, Padberg and Rao  gave a polynomial-time algorithm for separating the 2-matching inequalities — i.e., for testing if a given fractional solution to an LP relaxation violates a 2-matching inequality. We extend this significantly by giving a polynomial-time algorithm for separating the simple comb inequalities. The key is a result due to Caprara and Fischetti.
KeywordsTravel Salesman Problem Valid Inequality Separation Algorithm Fractional Point Degree Equation
Unable to display preview. Download preview PDF.
- 1.D. Applegate, R.E. Bixby, V. Chvátal & W. Cook (1995) Finding cuts in the TSP (a preliminary report). Technical Report 95-05, DIMACS, Rutgers University, New Brunswick, NJ.Google Scholar
- 4.A. Caprara & A.N. Letchford (2001) On the separation of split cuts and related inequalities. To appear in Math. Program. Google Scholar
- 20.M. Jünger, G. Reinelt & G. Rinaldi (1997) The traveling salesman problem. In M. Dell’Amico, F. Maffioli & S. Martello (eds.) Annotated Bibliographies in Combinatorial Optimization. Chichester, Wiley, 199–221.Google Scholar
- 22.D. Naddef (2001) Polyhedral theory and branch-and-cut algorithms for the symmetric TSP. In G. Gutin & A. Punnen (eds.), The Traveling Salesman Problem and its Variations. Kluwer Academic Publishers, 2002 (to appear).Google Scholar
- 25.D. Naddef & S. Thienel (1998) Efficient separation routines for the symmetric traveling salesman problem I: general tools and comb separation. Working paper, LMC-IMAG, Grenoble.Google Scholar
- 28.M.W. Padberg & M. Grötschel (1985) Polyhedral computations. In E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan & D.B. Schmoys (Eds.) The Traveling Salesman Problem. John Wiley & Sons, Chichester.Google Scholar