Solving Real-World Atsp Instances By Branch-And-Cut

Recently, Fischetti, Lodi and Toth [15] surveyed exact methods for the Asymmetric Traveling Salesman Problem (ATSP) and computationally compared branch-and-bound and branch-and-cut codes. The results of this comparison proved that branch-and-cut is the most effective method to solve hard ATSP instances. In the present paper the branch-and-cut algorithms by Fischetti and Toth [17] and by Applegate, Bixby, Chvatal and Cook [2] are considered and tested on a set of 35 real-world instances including 16 new instances recently presented in [12].