BBZ25234 - Computation Log
Instance Created: April 26, 2002
Number of Cities: 25234
Status: OPEN
Best Tour: 69341
Best Lower Bound: xxx
History
Date |
Gap |
Lower Bound |
Tour |
2.2.03 |
|
|
69341 - Found by Keld Helsgaun,
using a variant of LKH. |
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.
Last Updated: February 3, 2003