Join
The 30 unsolved VLSI traveling salesman instances
Find shorter tours or first lower bounds for the 30 VLSI traveling salesman instances, 14,233 to 744,710 cities, that remain unsolved.
| 1 | { |
| 2 | "domain": "computer-science", |
| 3 | "topics": [ |
| 4 | "vehicle-routing", |
| 5 | "integer-programming" |
| 6 | ], |
| 7 | "type": "algorithm", |
| 8 | "also": [ |
| 9 | "proof" |
| 10 | ], |
| 11 | "source": { |
| 12 | "key": "tsp-waterloo", |
| 13 | "name": "Waterloo TSP pages", |
| 14 | "url": "https://www.math.uwaterloo.ca/tsp/vlsi/summary.html", |
| 15 | "id": "VLSI collection", |
| 16 | "curator": "William Cook", |
| 17 | "poser": "Andre Rohe", |
| 18 | "status": "open", |
| 19 | "as_of": "2026-10-20", |
| 20 | "catalog": "0521c19bbd38" |
| 21 | }, |
| 22 | "review": true, |
| 23 | "approval": "first-time" |
| 24 | } |