A Canceling Heuristic for the Directed Traveling Salesman Problem

Steffen Borgwardt, Zachary Sorenson

The Traveling Salesman Problem (TSP) is one of the classic and hard problems in combinatorial optimization. We develop a new heuristic that uses a connection between Minimum Cost F…