Solving the Asymmetric Traveling Salesman Problem via Trace-Guided Cost Augmentation

Neural Information Processing Systems 

We propose a novel continuous relaxation framework for the Asymmetric Traveling Salesman Problem (ATSP) by leveraging differentiable constraints that encourage acyclic structures and valid permutations.