arXiv cs.AI
· Papers
Connected by Construction: Learning Tractable Near-Tour Marginals for Traveling Salesman Problems
arXiv:2607.12127v1 Announce Type: new Abstract: Learning-based methods for the traveling salesman problem (TSP) are often evaluated through the tours produced after decoding or search, but the learned object itself frequently lives in a surrogate space such as heatmaps, assignments, construction policies, or search-gui