Instance Created:  April 26, 2002
Number of Cities:  3256
Status:  Optimal (see summary page)
Best Tour:  10008
Best Lower Bound:  10008

History

Date	Gap	Lower Bound	Tour
6.10.02			10009 - Best of 10 runs of LKH, each with n trials. Total running time 6559 seconds on an AMD Althlon 1900+ processor (1.6 GHz).
24.5.06			10008 - Found by Xiao-Feng Xie.

Notes

1. Concorde is our linear-programming based TSP solver.

2. linkern is an implementation of Martin, Otto, and Felten's Chained Lin-Kernighan heuristic. It is included in the Concorde code.

3. LKH is Keld Helsgaun's powerful implementation of the Lin-Kernighan heuristic.

Back to TSP home.