.... Solving TSPs


World TSP

National TSPs

Bonn Institute

Bonn Institute

Back to XQF131

XQF131 - Computation Log

Instance Created:  April 26, 2002
Number of Cities:  131
Optimal Value:  564
Solved:  April 29, 2002
Solution Method:  Concorde, QSopt LP solver
Solution Time:  1.0 seconds, AMD Athlon 1900+


Date Gap Lower Bound Tour
4.29.02 Optimal 564 - Concorde (defaults), using QSopt as an LP solver. The run was carried out on a single AMD Althlon 1900+ processor (1.6 GHz), in 1.0 seconds, using 1 nodes in the branch-and-bound tree. 564 - 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