ALGORITHM FOR SOLVING THE TRAVELING SALESMAN PROBLEM
ALGORITHM FOR SOLVING THE TRAVELING SALESMAN PROBLEM
References
Additional sources and materials
1. M. M. Flood. The Traveling Salesman Problem. Opns. Res., 1956, vol. 4, p. 61—75.
2. R. H. Gonzalez. Solution of the Traveling Salesman Problem by Dynamic Programming on the Hypercube. Interim Techn. Rep., 1962, № 18, OR Center, M., I. T.
3. M. Held and R. M. Karp. A Dynamic Programming Approach to Sequencing Problems. J. Soc. Indust, and Appl. Math., 1962, vol. 10, p. 196—210.
4. G. B. D a n t z i g, D. R. Fulkerson and S. M. Johnson. Solution of a Largo Scale Traveling Salesman Problem. Opns. Ros., 1954, vol. 2, p. 393—410.
5. D. W. Sweeney. The Exploration of a NeAv Algorithm for Solving tlie Traveling Salesman Problem. M. S. Thesis, M., I. T., 1963.
6. G. A. G g o e s. A Method for Solving Traveling Salesman Problems. Opns. Res., 1958. vol. 6. p. 791—814.
7. A. D 0 i g and A. H. Land. An Automatic Method of Solving Discrete Programming
Problems. Econometrica, 1960, vol. 28, p. 497—520.
Comments
No posts found