1. Applegate, D., Bixby, R., Chvátal, V., Cook, W.: Finding cuts in the TSP (A preliminary report). DIMACS Technical Report 95-05, 1995. Available at
ftp://dimacs.rutgers.edu/pub/dimacs/TechnicalReports/TechReports/1995/
2. Applegate, D., Bixby, R., Chvátal, V., Cook, W.: On the solution of traveling salesman problems. Documenta Mathematica Extra Volume (Proceedings of the International Congress of Mathematicians), 645–656, 1998. Also available at
http://www.mathematik.uni-bielefeld.de/documenta/xvol-icm/17/17.html
3. Applegate, D., Bixby, R., Chvátal, V., Cook, W.: Concorde, 1999. Available at
http://www.math.princeton.edu/tsp/concorde.html
4. Applegate, D., Bixby, R., Chvátal, V., Cook, W.: Solving Traveling Salesman Problems. To appear.
5. Balas, E.: Facets of the knapsack polytope. Mathematical Programming 8, 146–164, 1975.