IDEAS home Printed from https://ideas.repec.org/h/spr/oprchp/978-3-319-28697-6_21.html
   My bibliography  Save this book chapter

A Polyhedral Study of the Quadratic Traveling Salesman Problem

In: Operations Research Proceedings 2014

Author

Listed:
  • Anja Fischer

    (TU Dortmund)

Abstract

In this paper we summarize some of the results of the author’s Ph.D.-thesis. We consider an extension of the traveling salesman problem (TSP). Instead of each path of two nodes, an arc, the costs depend on each three nodes that are traversed in succession. As such a path of three nodes, a 2-arc, is present in a tour if the two corresponding arcs are contained in that tour, we speak of a quadratic traveling salesman problem (QTSP). This problem is motivated by an application in biology, special cases are the TSP with reload costs as well as the angular-metric TSP. Linearizing the quadratic objective function, we derive a linear integer programming formulation and present a polyhedral study of the associated polytope. This includes the dimension as well as three groups of facet-defining inequalities. Some are related to the Boolean quadric polytope and some forbid conflicting configurations. Furthermore, we describe approaches to strengthen valid inequalities of TSP in order to get stronger inequalities for QTSP.

Suggested Citation

  • Anja Fischer, 2016. "A Polyhedral Study of the Quadratic Traveling Salesman Problem," Operations Research Proceedings, in: Marco Lübbecke & Arie Koster & Peter Letmathe & Reinhard Madlener & Britta Peis & Grit Walther (ed.), Operations Research Proceedings 2014, edition 1, pages 143-149, Springer.
    • Handle: RePEc:spr:oprchp:978-3-319-28697-6_21
    DOI: 10.1007/978-3-319-28697-6_21
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Brad D. Woods & Abraham P. Punnen, 0. "A class of exponential neighbourhoods for the quadratic travelling salesman problem," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-30.
    2. Brad D. Woods & Abraham P. Punnen, 2020. "A class of exponential neighbourhoods for the quadratic travelling salesman problem," Journal of Combinatorial Optimization, Springer, vol. 40(2), pages 303-332, August.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:oprchp:978-3-319-28697-6_21. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.