Sunday, October 25, 2020

The tour was found using an array of heuristic-search techniques for solving the Traveling Salesman problem (TSP). The quality guarantee was obtained by a linear programming, cutting-plane method. More details can be found here.
Bill and Keld's work has been featured in New Scientist magazine.