IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-540-68279-0_1.html
   My bibliography  Save this book chapter

Solution of a Large-Scale Traveling-Salesman Problem

In: 50 Years of Integer Programming 1958-2008

Author

Listed:
  • Vašek Chvátal

    (Concordia University, Canada Research Chair in Combinatorial Optimization, Department of Computer Science and Software Engineering)

  • William Cook

    (School of Industrial and Systems Engineering, Georgia Institute of Technology)

  • George B. Dantzig
  • Delbert R. Fulkerson
  • Selmer M. Johnson

Abstract

The RAND Corporation in the early 1950s contained “what may have been the most remarkable group of mathematicians working on optimization ever assembled” [6]: Arrow, Bellman, Dantzig, Flood, Ford, Fulkerson, Gale, Johnson, Nash, Orchard-Hays, Robinson, Shapley, Simon, Wagner, and other household names. Groups like this need their challenges. One of them appears to have been the traveling salesman problem (TSP) and particularly its instance of finding a shortest route through Washington, DC, and the 48 states [4, 7].

Suggested Citation

  • Vašek Chvátal & William Cook & George B. Dantzig & Delbert R. Fulkerson & Selmer M. Johnson, 2010. "Solution of a Large-Scale Traveling-Salesman Problem," Springer Books, in: Michael Jünger & Thomas M. Liebling & Denis Naddef & George L. Nemhauser & William R. Pulleyblank & (ed.), 50 Years of Integer Programming 1958-2008, chapter 0, pages 7-28, Springer.
    • Handle: RePEc:spr:sprchp:978-3-540-68279-0_1
    DOI: 10.1007/978-3-540-68279-0_1
    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
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    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:spr:sprchp:978-3-540-68279-0_1. 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.