| Article ID: | iaor20102921 |
| Volume: | 37 |
| Issue: | 1 |
| Start Page Number: | 11 |
| End Page Number: | 15 |
| Publication Date: | Jan 2009 |
| Journal: | Operations Research Letters |
| Authors: | Cook William, Helsgaun Keld, Goycoolea Marcos, Espinoza Daniel G, Applegate David L, Bixby Robert E, Chvtal Vaek |
We describe a computer code and data that together certify the optimality of a solution to the 85,900-city traveling salesman problem pla85900, the largest instance in the TSPLIB collection of challenge problems.