Size Generalization for Diffusion Routing Solvers.

arXiv:2610.17192v1 Announce Type: new Abstract: Routing problems, like the Traveling Salesman Problem (TSP) and the Capacitated Vehicle Routing Problem (CVRP), are NP-hard and slow to solve for large instances. Diffusion-based solvers can be trained in a super