Traveling Salesman Problem on TSPLIB (1000 < N ≤ 2000)
9.72Optimality GapBQ greedy
Evaluation Results
| Method | Links | |
|---|---|---|
| BQ greedyAvg.time=4.3s2024.05 | 9.72 | |
| LEHD greedyAvg.time=4.4s2024.05 | 10.54 | |
| ICAM aug×8Avg.time=6.5s2024.05 | 11.52 | |
| ELG aug×82024.05 | 11.79 | |
| ICAMAvg.time=1.0s2024.05 | 13.28 | |
| POMO aug×8Avg.time=15.9s2024.05 | 60.27 |