Letchford, A N and Pearson, N (2005) Exploiting planarity in separation routines for the symmetric travelling salesman problem. Working Paper. The Department of Management Science, Lancaster University.Full text not available from this repository.
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.
|Item Type:||Monograph (Working Paper)|
|Additional Information:||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.|
|Uncontrolled Keywords:||travelling salesman problem ; planar graphs ; cutting planes|
|Departments:||Lancaster University Management School > Management Science|
|Deposited On:||11 Jul 2011 22:13|
|Last Modified:||04 Nov 2015 06:56|
Actions (login required)