Polynomial-Time Separation of Simple Comb Inequalities

Authors:
Adam N. Letchford;Andrea Lodi
Affiliations:
-;-
Venue:
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Year:
2002

Citing 17
Cited 2

Integer and combinatorial optimization

Integer and combinatorial optimization
A cutting plane algorithm for minimum perfect 2-matchings

Computing
A new approach to the maximum-flow problem

Journal of the ACM (JACM)
Decomposition and optimization over cycles in binary matroids

Journal of Combinatorial Theory Series B
Facet identification for the symmetric traveling salesman polytope

Mathematical Programming: Series A and B
A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems

SIAM Review
The symmetric traveling salesman polytope and its graphical relaxation: composition of valid inequalities

Mathematical Programming: Series A and B
The traveling salesman problem in graphs with some excluded minors

Mathematical Programming: Series A and B
The graphical relaxation: a new framework for the Symmetric Traveling Salesman Polytope

Mathematical Programming: Series A and B
Worst-case comparison of valid inequalities for the TSP

Mathematical Programming: Series A and B
On the number of small cuts in a graph

Information Processing Letters
{0, 12 }-Chva´tal-Gomory cuts

Mathematical Programming: Series A and B
Computing All Small Cuts in an Undirected Network

SIAM Journal on Discrete Mathematics
Separating clique trees and bipartition inequalities having a fixed number of handles and teeth in polynomial time

Mathematics of Operations Research
Separating Maximally Violated Comb Inequalities in Planar Graphs

Mathematics of Operations Research
Separating a Superclass of Comb Inequalities in Planar Graphs

Mathematics of Operations Research
Finding Cuts in the TSP (A preliminary report)

Finding Cuts in the TSP (A preliminary report)

Polynomial-Time Separation of a Superclass of Simple Comb Inequalities

Mathematics of Operations Research
Exploiting planarity in separation routines for the symmetric traveling salesman problem

Discrete Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 [29] 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.