Traveling Salesman Problem on DIMACS challenge E series 8th
4.562Optimality GapL2R
Evaluation results
| Method | Links | ||
|---|---|---|---|
| L2RDecoding strategy=Greedy, Instance=E10k.0, Scale=10,0002025.03 | 4.562 | 43 | |
| L2RDecoding strategy=Greedy, Instance=E10k.1, Scale=10,0002025.03 | 4.591 | 44 | |
| L2RDecoding strategy=Greedy, Instance=E100k.0, Scale=100,0002025.03 | 4.711 | 8.2 | |
| L2RDecoding strategy=Greedy, Instance=E31k.1, Scale=31,6232025.03 | 4.735 | 2.4 | |
| L2RDecoding strategy=Greedy, Instance=E10k.2, Scale=10,0002025.03 | 4.766 | 45 | |
| L2RDecoding strategy=Greedy, Instance=E316k.0, Scale=316,2282025.03 | 4.82 | 27.1 | |
| L2RDecoding strategy=Greedy, Instance=E31k.0, Scale=31,6232025.03 | 4.822 | 2.4 | |
| L2RDecoding strategy=Greedy, Instance=E100k.1, Scale=100,0002025.03 | 4.976 | 8.5 | |
| L2RDecoding strategy=Greedy, Instance=E1M.0, Scale=1,000,0002025.03 | 5.021 | 2 | |
| L2RDecoding strategy=Greedy, Instance=E10M.0, Scale=10,000,0002025.03 | 5.048 | 96 | |
| L2RDecoding strategy=Greedy, Instance=E3M.0, Scale=3,162,2782025.03 | 5.049 | 12 | |
| INViT-3VDecoding strategy=Greedy, Instance=E10k.0, Scale=10,0002025.03 | 6.636 | 3.8 | |
| INViT-3VDecoding strategy=Greedy, Instance=E31k.0, Scale=31,6232025.03 | 6.97 | 29.2 | |
| INViT-3VDecoding strategy=Greedy, Instance=E10k.1, Scale=10,0002025.03 | 7.08 | 3.8 | |
| INViT-3VDecoding strategy=Greedy, Instance=E31k.1, Scale=31,6232025.03 | 7.222 | 29.1 | |
| INViT-3VDecoding strategy=Greedy, Instance=E10k.2, Scale=10,0002025.03 | 7.382 | 3.8 | |
| LEHDDecoding strategy=Greedy, Instance=E10k.0, Scale=10,0002025.03 | 24.628 | 12 | |
| LEHDDecoding strategy=Greedy, Instance=E10k.2, Scale=10,0002025.03 | 24.743 | 12 | |
| LEHDDecoding strategy=Greedy, Instance=E10k.1, Scale=10,0002025.03 | 26.506 | 12 |