O'Reilly logo

In Pursuit of the Traveling Salesman by William J. Cook

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

Bibliography

[1] Albers, D. J., C. Reid. 1986. An interview with George B. Dantzig: The father of linear programming. The College Mathematics Journal 17, 293–314.

[2] Applegate, D. L., R. E. Bixby, V. Chvátal, W. Cook. 2006. The Traveling Salesman Problem: A Computational Study. Princeton University Press, Princeton, New Jersey.

[3] Arora, S., B. Barak. 2009. Computational Complexity: A Modern Approach. Cambridge University Press, New York.

[4] Biggs, N. L., E. K. Lloyd, R. J. Wilson. 1976. Graph Theory 1736–1936. Clarendon Press, Oxford, UK.

[5] Chvátal, V. 1973. Edmonds polytopes and a hierarchy of combinatorial problems. Discrete Mathematics 4, 305–37.

[6] Clay Mathematics Institute. 2000. Millennium problems. http://www.claymath.org/millennium/ ...

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

Start Free Trial

No credit card required