12 Apr 2008 ==================================
Concorde-TSP Benchmark
Concorde with different LP solvers
==================================
Hans Mittelmann
<mittelmann@asu.edu>
Euclidean symmetric traveling salesman problems from TSPLIB:
http://www.informatik.uni-heidelberg.de/groups/comopt/software/TSPLIB95/
were solved with Concorde and different LP solvers.
http://www.tsp.gatech.edu/concorde.html
Platform: 2.4 GHz Opteron64, Linux. Random seed 99. CPU seconds listed.
Logfiles are at: http://plato.asu.edu/ftp/con_bench_logs/
---------------------------------------------------------------- problem Cplex-11.0 QSopt-1.0$ GLPK-4.11 MOSEK-5.0.0.79 ---------------------------------------------------------------- d657 48 89 156 98 d1655 55 100 1360 129 dsj1000 120 147 139 75 fl1400 415 11368 2518 1186 fl3795 3582 >50000 28474 nrw1379 70 126 462 109 pa561 33 67 142 57 pcb1173 94 120 515 108 pcb3038 19309 33706 31424 rat575 60 64 126 78 rl1304 87 112 >64000 154 rl1889 1406 6710 fail 6136 rl5934 >110000 >750000 si1032 87 30 67 79 u724 93 72 147 69 u1060 107 137 693 175 u1432 23 259 169 266 u1817 32746 vm1084 143 210 1272 225 vm1748 247 536 2030 813 ----------------------------------------------------------------- $ 32-bit binary