Solution of a Large-Scale Traveling-Salesman Problem

Vašek Chvátal (), William Cook (), George B. Dantzig, Delbert R. Fulkerson and Selmer M. Johnson
Additional contact information
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

Chapter Chapter 1 in 50 Years of Integer Programming 1958-2008, 2010, pp 7-28 from Springer

Abstract: 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].

Keywords: Convex Hull; Linear Programming Problem; Linear Constraint; Travel Salesman Problem; Simplex Method (search for similar items in EconPapers)
Date: 2010
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-540-68279-0_1

Ordering information: This item can be ordered from
http://www.springer.com/9783540682790

DOI: 10.1007/978-3-540-68279-0_1

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().