Graph-Constrained Diffusion with Progressive Distillation for Traveling Salesman Problem
Diffusion models have shown strong promise for neural combinatorial optimization, yet existing approaches define the forward noising process over a fully connected graph, discarding the sparse topological structure inherent to the Traveling Salesman Problem (TSP), and their multi-step inference incurs prohibitive laten...