The Traveling Salesman Problem, or TSP for short, is one of the most intensively studied problems in computational mathematics. These pages are devoted to the history, applications, and current research of this challenge of finding the shortest route visiting each member of a collection of locations and returning to your starting point.
Topics include a description of the Concorde TSP Solver, which is the best general-purpose TSP solver available, along with examples of solved small through to extremely large Traveling Salesman Problems.
Blog: TSP blog.
