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

On a Linear-Programming, Combinatorial Approach to the Traveling-Salesman Problem

Author

Listed:
  • G. B. Dantzig

    (The Rand Corporation, Santa Monica, California)

  • D. R. Fulkerson

    (The Rand Corporation, Santa Monica, California)

  • S. M. Johnson

    (The Rand Corporation, Santa Monica, California)

Abstract

This paper elaborates a method of attack on traveling-salesman problems, proposed by the authors in an earlier paper, in which linear programming is used to reduce the combinatorial magnitude of such problems. To illustrate the method, a step-by-step solution of Barachet's ten-city example is presented.

Suggested Citation

  • G. B. Dantzig & D. R. Fulkerson & S. M. Johnson, 1959. "On a Linear-Programming, Combinatorial Approach to the Traveling-Salesman Problem," Operations Research, INFORMS, vol. 7(1), pages 58-66, February.
    • Handle: RePEc:inm:oropre:v:7:y:1959:i:1:p:58-66
    DOI: 10.1287/opre.7.1.58
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.7.1.58
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.7.1.58?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. Šůcha, Přemysl & Agnetis, Alessandro & Šidlovský, Marko & Briand, Cyril, 2021. "Nash equilibrium solutions in multi-agent project scheduling with milestones," European Journal of Operational Research, Elsevier, vol. 294(1), pages 29-41.
    2. Malandraki, Chryssi & Dial, Robert B., 1996. "A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 90(1), pages 45-55, April.
    3. Akbari, Sina & Escobedo, Adolfo R., 2023. "Beyond kemeny rank aggregation: A parameterizable-penalty framework for robust ranking aggregation with ties," Omega, Elsevier, vol. 119(C).
    4. Aardal, K. & van Hoesel, C.P.M., 1995. "Polyhedral techniques in combinatorial optimization," Research Memorandum 014, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    5. Lee, Chia-Yen & Johnson, Andrew L. & Moreno-Centeno, Erick & Kuosmanen, Timo, 2013. "A more efficient algorithm for Convex Nonparametric Least Squares," European Journal of Operational Research, Elsevier, vol. 227(2), pages 391-400.
    6. Keshvari, Abolfazl, 2017. "A penalized method for multivariate concave least squares with application to productivity analysis," European Journal of Operational Research, Elsevier, vol. 257(3), pages 1016-1029.

    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:7:y:1959:i:1:p:58-66. 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.