Traveling Salesman Problem on Euclidean TSP N=100
7.759Objective ValueOracle (Concorde)
Evaluation results
| Method | Links | ||
|---|---|---|---|
| Oracle (Concorde)2022.06 | 7.759 | 0 | |
| Transformer (Deudon et al.)2022.06 | 7.88 | 1.42 | |
| Diffusion 20-50trained_on=20-50 nodes2022.06 | 7.92 | 2.11 | |
| Diffusion 50trained_on=50 nodes, inference_steps=2562022.06 | 7.93 | 2.19 | |
| Diffusion 50trained_on=50 nodes, inference_steps=642022.06 | 7.942 | 2.35 | |
| 2-opt2022.06 | 8.03 | 3.54 | |
| Diffusion 50trained_on=50 nodes, inference_steps=42022.06 | 8.031 | 3.5 | |
| Diffusion 50trained_on=50 nodes, inference_steps=162022.06 | 8.052 | 3.78 | |
| Transformer (Kool et al.)2022.06 | 8.12 | 4.53 | |
| GNN2022.06 | 8.41 | 8.38 |