Concorde was written by David Applegate, Robert E. Bixby, Vaek Chvátal, and William J. Cook.
Source code, binaries, and documentation are available from the Concorde homepage
This solver was implemented by Hans Mittelmann and executes at
#cities x_0 y_0 x_1 y_1 . . . x_n-1 y_n-1
or in TSPLIB format.
The user can currently choose between applying the exact algorithm and the Lin-Kernighan heuristic (especially for large instances). Concorde can be called with the authors' QSopt LP solver or CPLEX. This small benchmark gives you an impression of its performance with different LP solvers. If Concorde terminates prematurely it may have run out of time or memory. Either the fixed random seed 99 can be used or a variable one. Users who submit via web submission (not email or XML-RPC) can further choose to receive a PDF file plotting the optimal resp. final tour.