Polynomial-Time Separation of a Superclass of Simple Comb Inequalities

Authors:
Lisa K. Fleischer;Adam N. Letchford;Andrea Lodi
Affiliations:
Department of Computer Science, Dartmouth College, 6211 Sudikoff Laboratory, Hanover, NH 03755-3510;Department of Management Science, Lancaster University, Lancaster LA1 4YW, Great Britain;DEIS, University of Bologna, Viale Risorgimento 2, 40136 Bologna, Italy/ currently at IBM, T. J. Watson Research Center, Yorktown Heights, NY 10598, USA
Venue:
Mathematics of Operations Research
Year:
2006

Citing 13
Cited 2

A new approach to the maximum-flow problem

Journal of the ACM (JACM)
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 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
Polynomial-Time Separation of Simple Comb Inequalities

Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
A study of domino-parity and k-parity constraints for the TSP

IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization

Exploiting planarity in separation routines for the symmetric traveling salesman problem

Discrete Optimization
Fast separation algorithms for three-index assignment problems

ISCO'12 Proceedings of the Second international conference on Combinatorial 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 [Edmonds, J. 1965. Maximum matching and a polyhedron with 0--1 vertices. J. Res. Nat. Bur. Standards69B 125--130] and also the so-called Chvátal comb inequalities. In 1982, Padberg and Rao [Padberg, M. W., M. R. Rao. 1982. Odd minimum cut-sets and b-matchings. Math. Oper. Res.7 67--80] gave a polynomial-time separation algorithm for the 2-matching inequalities, i.e., an algorithm 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 separation algorithm for a class of valid inequalities which includes all simple comb inequalities.