zbMATH — the first resource for mathematics

Solution of a large-scale traveling-salesman problem. (English) Zbl 1187.90007
Jünger, Michael (ed.) et al., 50 years of integer programming 1958–2008. From the early years to the state-of-the-art. Papers based on the presentations at the special session at the 12th combinatorial optimization workshop AUSSOIS 2008, Aussois, France January 7–11, 2008. With DVD. Berlin: Springer (ISBN 978-3-540-68274-5/hbk; 978-3-540-68279-0/ebook). 7-28 (2010).
Summary: The RAND Corporation in the early 1950s contained “what may have been the most remarkable group of mathematicians working on optimization ever assembled”: 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.
For the entire collection see [Zbl 1181.90003].

90-03 History of operations research and mathematical programming
01A60 History of mathematics in the 20th century
90C27 Combinatorial optimization
Full Text: DOI