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

On the Relation Between the Traveling-Salesman and the Longest-Path Problems

Author

Listed:
  • William W. Hardgrave

    (Bell Telephone Laboratories, Inc., Holmdel, New Jersey)

  • George L. Nemhauser

    (The Johns Hopkins University, Baltimore, Maryland)

Abstract

The main result of this paper is that the traveling-salesman problem is a special case of the longest-path problem. Two formulations of the traveling-salesman problem are considered, the version in which the salesman visits each city exactly once and the more general formulation in which each city may be visited more than once. Both cases are reduced to the problem of finding the longest path between two nodes in a finite, connected graph. The remainder of the paper is then devoted to possible algorithms for the longest-path problem, since none presently exist.

Suggested Citation

  • William W. Hardgrave & George L. Nemhauser, 1962. "On the Relation Between the Traveling-Salesman and the Longest-Path Problems," Operations Research, INFORMS, vol. 10(5), pages 647-657, October.
    • Handle: RePEc:inm:oropre:v:10:y:1962:i:5:p:647-657
    DOI: 10.1287/opre.10.5.647
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.10.5.647
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.10.5.647?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
    ---><---

    Citations

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


    Cited by:

    1. Letchford, Adam N. & Nasiri, Saeideh D. & Theis, Dirk Oliver, 2013. "Compact formulations of the Steiner Traveling Salesman Problem and related problems," European Journal of Operational Research, Elsevier, vol. 228(1), pages 83-92.
    2. Rodríguez-Pereira, Jessica & Fernández, Elena & Laporte, Gilbert & Benavent, Enrique & Martínez-Sykora, Antonio, 2019. "The Steiner Traveling Salesman Problem and its extensions," European Journal of Operational Research, Elsevier, vol. 278(2), pages 615-628.

    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:10:y:1962:i:5:p:647-657. 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.