The Traveling Salesman Problem 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.
How to solve the TSP! (YouTube), TSP cutting-plane method (YouTube or as mov)
![]() |
![]() |
![]() |
![]() |
![]() |
Optimal crawl to 49,687 pubs in the UK. | ![]() |
How to visit 1.33 billion stars. |
![]() |
![]() |
![]() |
![]() |
![]() |
IFORS Distinguished Lecture EURO 2019, Dublin |
![]() |
MAA Invited Address 2018 Joint Math Meetings |
![]() |
![]() |
![]() |
![]() |
![]() |
Traveling Salesman Problem DIY Web app for learning/teaching TSP solution methods. |
![]() |
Visit 49,603 historic sites in the US. |
49,693 Historic Sites |
![]() |
Optimal walking tour through the USA | |
TSP Tutorial in Python |
![]() |
Nice intro to the TSP by Peter Norvig | |
Pokemon Go Tours |
![]() |
Shortest routes to Catch 'em All | |
Tour for Extra Milers |
![]() |
Drive to all 3100 US county seats | |
Queen of College Tours |
![]() |
Optimal road trip to visit 647 colleges | |
Hiking Tour of Austria |
![]() |
Get a view of 100 mountain peaks | |
50 USA Landmarks |
![]() |
Dicussion of wildly popular USA tour | |
Scientific American |
![]() |
Short piece on Yogi Berra and the TSP | |
Travelling Salesman |
![]() |
Thriller movie centered around a solution of the TSP | |
Mona Lisa TSP |
![]() |
$1,000 Prize for a 100,000-city challenge problem. | |
pla85900 |
![]() |
Solution of a 85,900-city TSP. | |
Iowa Tour |
![]() |
Optimal route for a 99-county campaign tour. |
![]() |
![]() |
![]() |
![]() |
![]() ![]() |
![]() |
![]() ![]() |
![]() ![]() |
![]() |
![]() ![]() |
![]() ![]() |
![]() |
![]() ![]() |
![]() ![]() |
![]() |
![]() ![]() |
![]() ![]() |
![]() |
![]() ![]() |
![]() |
![]() |
![]() |
The work described here is supported by the Natural Sciences and Engineering Research Council of Canada (NSERC) and the Department of Combinatorics and Optimization at the University of Waterloo.
Contact: William Cook (bico@uwaterloo.ca)