4 search results - page 1 / 1 » Separating a Superclass of Comb Inequalities in Planar Graph... |
MOR
2000
13 years 4 months ago
2000
MOR
2006
13 years 4 months ago
2006
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 t...
MOR
2010
13 years 3 months ago
2010
We extend the work of Letchford (2000) by introducing a new class of valid inequalities for the traveling salesman problem, called the generalized domino-parity (GDP) constraints....
DISOPT
2008
13 years 5 months ago
2008
At present, the most successful approach to solving large-scale instances of the Symmetric Traveling Salesman Problem to optimality is branch-and-cut. The success of branch-and-cu...