Computing with Domino-Parity Inequalities for the Traveling Salesman Problem (TSP)

@article{Cook2007ComputingWD,
  title={Computing with Domino-Parity Inequalities for the Traveling Salesman Problem (TSP)},
  author={William J. Cook and Daniel G. Espinoza and Marcos Goycoolea},
  journal={INFORMS J. Comput.},
  year={2007},
  volume={19},
  pages={356-365}
}
We describe methods for implementing separation algorithms for domino-parity inequalities for the symmetric traveling salesman problem. These inequalities were introduced by Letchford (2000), who showed that the separation problem can be solved in polynomial time when the support graph of the LP solution is planar. In our study we deal with the problem of how to use this algorithm in the general (nonplanar) case, continuing the work of Boyd et al. (2001). Our implementation includes pruning… 

Figures and Tables from this paper

Generalized Domino-Parity Inequalities for the Symmetric Traveling Salesman Problem
TLDR
It is shown that a subset of GDP constraints containing all of the clique-tree inequalities can be separated in polynomial time, provided that the support graph G* is planar, and provided that the authors bound the number of handles by a fixed constant h.
Primal Cutting Plane Methods for the Traveling Salesman Problem
Most serious attempts at solving the traveling salesman problem (TSP) are based on the dual fractional cutting plane approach, which moves from one lower bound to the next. This thesis describes
Mathematical Programming Approaches to the Traveling Salesman Problem
TLDR
This entry introduces the main theoretical and algorithmic tools involved in the formulations of the TSP, polyhedral theory, separation routines, and exact TSP algorithms.
The Generalized Median Tour Problem: Modeling, Solving and an Application
TLDR
The Generalized Median Tour Problem, which is motivated in the health supplies distribution for urban and rural areas, is introduced and several solution strategies are developed to avoid subtours based on branch & cut.
Traveling Salesman Problem with Clustering
TLDR
This work presents an approach which leads to an automatic clustering with a clustering parameter governing the sizes of the clusters, such that all nodes of a cluster are visited contiguously.
A new efficient tour construction heuristic for the Traveling Salesman Problem
TLDR
A new efficient heuristic method to create initial individuals for the Traveling Salesman Problem (TSP), which the authors will call Circle Group Heuristic (CGH).
Metropolitan fiber optical network planning model based on self organizing neural networks
TLDR
A model for metropolitan optical network design that relies on self organizing neural networks and graph theory adapted algorithms and has a ring topology while the second layer has a tree topology with a maximum depth constraint is presented.
...
1
2
...

References

SHOWING 1-10 OF 28 REFERENCES
Separating Maximally Violated Comb Inequalities in Planar Graphs
TLDR
This paper considers the problem of finding violated comb inequalities in a fractional solution in the subtour elimination polytope whose graph is planar, and proposes an algorithm that runs in O(n + MC(n)) time, whereMC(n) is the time to compute all minimum cuts of a planar graph.
A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
An algorithm is described for solving large-scale instances of the Symmetric Traveling Salesman Problem (STSP) to optimality. The core of the algorithm is a “polyhedral” cutting-plane procedure that
The domino inequalities: facets for the symmetric traveling salesman polytope
TLDR
It is shown in [5] that one does not lose any facet inducing inequality restricting the Domino Parity inequalities to Domino inequalities, except maybe for some very particular case.
On the domino-parity inequalities for the STSP
TLDR
This work presents several performance enhancements for this separation routine for the STSP within a branch and cut framework, and discusses the implementation of this improved algorithm.
Separating a Superclass of Comb Inequalities in Planar Graphs
  • A. Letchford
  • Mathematics, Computer Science
    Math. Oper. Res.
  • 2000
TLDR
Ageneralization of comb inequalities is defined and it is shown that the associated separation problem can be solved efficiently when the subgraph induced by the edges withx*e>0 is planar.
Edmonds polytopes and weakly hamiltonian graphs
TLDR
A direct application of the linear programming duality theorem leads to a new necessary condition for the existence of hamiltonian circuits; this condition appears to be stronger than the ones previously known.
On the symmetric travelling salesman problem I: Inequalities
TLDR
It is proved that all subtour-elimination and all comb inequalities define facets of the symmetric travelling salesman polytope.
Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems
TLDR
An implementation of Dantzig et al.'s method is discussed that is suitable for TSP instances having 1,000,000 or more cities, and used as a step towards understanding the applicability and limits of the general cutting-plane method in large-scale applications.
Polynomial-Time Separation of a Superclass of Simple Comb Inequalities
TLDR
This work gives a polynomial-time separation algorithm for a class of valid inequalities which includes all simple comb inequalities, which generalize the classical 2-matching inequalities of Edmonds and Chvatal.
...
1
2
3
...