Polynomial-Time Separation of a Superclass 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

• Type: Journal
• Year: 2006
• Where: MOR
• Authors: Lisa Fleischer, Adam N. Letchford, Andrea Lodi
• Keywords: Comb Inequalities, Inequalities, MOR 2006, Polynomial-time Separation Algorithm