Exploiting planarity in separation routines for the symmetric traveling salesman problem

Authors:
Adam N. Letchford;Nicholas A. Pearson
Affiliations:
Department of Management Science, Lancaster University Management School, Lancaster LA1 4YX, United Kingdom;Department of Management Science, Lancaster University Management School, Lancaster LA1 4YX, United Kingdom
Venue:
Discrete Optimization
Year:
2008

Citing 22
Cited 0

On the cut polytope

Mathematical Programming: Series A and B
A cutting plane algorithm for minimum perfect 2-matchings

Computing
A new approach to the maximum-flow problem

Journal of the ACM (JACM)
Unifying Maximum Cut and Minimum Cut of a Planar Graph

IEEE Transactions on Computers
A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems

SIAM Review
The traveling salesman problem with distances one and two

Mathematics of Operations Research
Implementing an efficient minimum capacity cut algorithm

Mathematical Programming: Series A and B
Faster shortest-path algorithms for planar graphs

Journal of Computer and System Sciences - Special issue: 26th annual ACM symposium on the theory of computing & STOC'94, May 23–25, 1994, and second annual Europe an conference on computational learning theory (EuroCOLT'95), March 13–15, 1995
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
A polynomial-time approximation scheme for weighted planar graph TSP

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Separating a Superclass of Comb Inequalities in Planar Graphs

Mathematics of Operations Research
Separating over Classes of TSP Inequalities Defined by 0 Node-Lifting in Polynominal Time

Proceedings of the 5th International IPCO Conference on Integer Programming and Combinatorial Optimization
Polynomial-Time Separation of Simple Comb Inequalities

Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
A deterministic near-linear time algorithm for finding minimum cuts in planar graphs

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Separation Algorithms for Classes of STSP Inequalities Arising from a New STSP Relaxation

Mathematics of Operations Research
Polynomial-Time Separation of a Superclass of Simple Comb Inequalities

Mathematics of Operations Research
On the domino-parity inequalities for the STSP

Mathematical Programming: Series A and B
Efficient exact algorithms on planar graphs: exploiting sphere cut branch decompositions

ESA'05 Proceedings of the 13th annual European conference on Algorithms
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
Exact algorithms for the Hamiltonian cycle problem in planar graphs

Operations Research Letters
A fast algorithm for minimum weight odd circuits and cuts in planar graphs

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

At present, the most successful approach for solving large-scale instances of the Symmetric Traveling Salesman Problem to optimality is branch-and-cut. The success of branch-and-cut is due in large part to the availability of effective separation procedures; that is, routines for identifying violated linear constraints. For two particular classes of constraints, known as comb and domino-parity constraints, it has been shown that separation becomes easier when the underlying graph is planar. We continue this line of research by showing how to exploit planarity in the separation of three other classes of constraints: subtour elimination, 2-matching and simple domino-parity constraints.