XQL662 - Computation Log
Instance Created: April 26, 2002
Number of Cities: 662
Optimal Value: 2513
Solved: April 29, 2002
Solution Method: Concorde, QSopt LP solver
Solution Time: 212.5 seconds, AMD Athlon 1900+
||2513 - Concorde (defaults), using QSopt as an LP solver. The run was carried out on a single AMD Althlon 1900+ processor (1.6 GHz), in 212.5 seconds, using 7 nodes in the branch-and-bound tree.
||2513 - Found during branching run by Lin-Kernighan heuristic.
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: May 6, 2002