Research output: Working paper
Research output: Working paper
}
TY - UNPB
T1 - Exploiting planarity in separation routines for the symmetric travelling salesman problem
AU - Letchford, A N
AU - Pearson, N
N1 - This was eventually published as: A.N. Letchford & N.A. Pearson (2008) Exploiting planarity in separation routines for the symmetric traveling salesman problem. Discr. Opt., 5(2), 220-230.
PY - 2005
Y1 - 2005
N2 - At present, the most successful approach to solving large-scale instances of the Symmetric Travelling 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.
AB - At present, the most successful approach to solving large-scale instances of the Symmetric Travelling 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.
KW - travelling salesman problem
KW - planar graphs
KW - cutting planes
M3 - Working paper
T3 - Management Science Working Paper Series
BT - Exploiting planarity in separation routines for the symmetric travelling salesman problem
PB - The Department of Management Science
CY - Lancaster University
ER -