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]. © 2010 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Dantzig, G. B., Fulkerson, D. R., Johnson, S. M., Chvátal, V., & Cook, W. (2010). Solution of a large-scale traveling-salesman problem. In 50 Years of Integer Programming 1958-2008: From the Early Years to the State-of-the-Art (pp. 7–28). Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-68279-0_1
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
