Empowering Targeted Neighborhood Search via Hyper Tour for Large-Scale TSP
arXiv:2510.20169v3 Announce Type: replace
Abstract: Traveling Salesman Problem (TSP) is a classic NP-hard problem that has garnered significant attention from both academia and industry. While neural-based methods have shown promise for solving TSPs, …