IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v18y1970i6p1138-1162.html
   My bibliography  Save this article

The Traveling-Salesman Problem and Minimum Spanning Trees

Author

Listed:
  • Michael Held

    (IBM Systems Research Institute, New York, New York)

  • Richard M. Karp

    (University of California, Berkeley, California)

Abstract

This paper explores new approaches to the symmetric traveling-salesman problem in which 1-trees, which are a slight variant of spanning trees, play an essential role. A 1-tree is a tree together with an additional vertex connected to the tree by two edges. We observe that (i) a tour is precisely a 1-tree in which each vertex has degree 2, (ii) a minimum 1-tree is easy to compute, and (iii) the transformation on “intercity distances” c ij → C ij + π i + π j leaves the traveling-salesman problem invariant but changes the minimum 1-tree. Using these observations, we define an infinite family of lower bounds w (π) on C *, the cost of an optimum tour. We show that max π w (π) = C * precisely when a certain well-known linear program has an optimal solution in integers. We give a column-generation method and an ascent method for computing max π w (π), and construct a branch-and-bound method in which the lower bounds w (π) control the search for an optimum tour.

Suggested Citation

  • Michael Held & Richard M. Karp, 1970. "The Traveling-Salesman Problem and Minimum Spanning Trees," Operations Research, INFORMS, vol. 18(6), pages 1138-1162, December.
    • Handle: RePEc:inm:oropre:v:18:y:1970:i:6:p:1138-1162
    DOI: 10.1287/opre.18.6.1138
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.18.6.1138
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.18.6.1138?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:inm:oropre:v:18:y:1970:i:6:p:1138-1162. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.