Lancaster EPrints

Exploiting planarity in separation routines for the symmetric travelling salesman problem

Letchford, A N and Pearson, N (2008) Exploiting planarity in separation routines for the symmetric travelling salesman problem. Discrete Optimization, 5 (2). pp. 220-230. ISSN 1572-5286

[img]
Preview
PDF (Exploiting planarity in separation routines for the symmetric travelling salesman problem) - Draft Version
Download (456Kb) | Preview

    Abstract

    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-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: Article
    Journal or Publication Title: Discrete Optimization
    Uncontrolled Keywords: traveling salesman problem ; planar graphs ; cutting planes
    Subjects: H Social Sciences > HB Economic Theory
    Departments: Lancaster University Management School > Management Science
    ID Code: 44643
    Deposited By: ep_importer_pure
    Deposited On: 11 Jul 2011 19:19
    Refereed?: Yes
    Published?: Published
    Last Modified: 09 Apr 2014 22:25
    Identification Number:
    URI: http://eprints.lancs.ac.uk/id/eprint/44643

    Actions (login required)

    View Item