|
Vasek Chvatal, Concordia University, Computer Science and Software Engineering, 1455 blvd. de Maisonneuve Ouest, Montréal, Québec, Canada, H3G 1M8
I will outline a technique for finding TSP cuts that disdains all understanding of the TSP polytope. Its use in Concorde -- a computer code developed by David Applegate, Bob Bixby, Bill Cook, and myself -- was crucial for our solution of a 24,978-city instance (all cities, towns, and villages in Sweden).
|