Solving Asymmetric Traveling Salesman Problem via Trace-Guided Cost Augmentation
–Neural Information Processing Systems
The Asymmetric Traveling Salesman Problem (ATSP) is one of the most fundamental and notoriously challenging problems in combinatorial optimization. We propose a novel continuous relaxation framework for ATSP that leverages differentiable constraints to encourage acyclic structures and valid permutations.
Neural Information Processing Systems
Jun-17-2026, 07:35:34 GMT