Tuesday, April 21, 2015
The Traveling Salesman Problem (TSP) is one of the most intensively studied problems in computational mathematics. Professor Cook has made many contributions to the TSP and has written two books on the topic: The Traveling Salesman Problem: A Computational Study (with David Applegate, Robert Bixby, and Vasek Chvátal) and In Pursuit of the Traveling Salesman: Mathematics at the Limits of Computation. He maintains an extensive website on the history, applications, and current research of the TSP.