Lethbridge Number Theory and Combinatorics Seminar: Dave Morris

The Traveling Salesman Problem asks for the shortest route through a collection of cities. This classical problem is very hard, but, by applying Linear Programming (and other techniques), the optimal route has been found in test cases that have tens of thousands of cities. This talk will present some of the powerful methods that are explained in W.J.Cook's book "In Pursuit of the Traveling Salesman".