Solution of a Large-Scale Traveling-Salesman Problem
George B. Dantzig(RAND Corporation), R. Fulkerson(RAND Corporation), Selmer Martin Johnson(RAND Corporation)
Cited by 1,310
Abstract
It is shown that a certain tour of 49 cities, one in each of the 48 states and Washington, D.C., has the shortest road distance. Operations Research, ISSN 0030-364X, was published as Journal of the Operations Research Society of America from 1952 to 1955 under ISSN 0096-3984.
Related Papers
No related papers found
Powered by citation graph analysis