ZI929 - Zimbabwe Computation Log
Instance Created: July 29, 2001
Number of Cities: 929
Optimal Value: 95345
Solved: July 30, 2001
Solution Method: concorde (default settings), QSopt LP solver
Solution Time: 544.65 seconds, AMD Athlon 1.33 GHz
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: March 19, 2003