Modern approach to the Traveling Salesman Problem

This event is from the archives of The Notice Board. The event has already taken place and the information contained in this post may no longer be relevant or accurate.

Lethbridge Number Theory and Combinatorics Seminar

 

Date:

February 27, 2017

 

Time:

12:00-12:50pm

 

Lecturer(s):

Dave Morris

 

Location:

University of Lethbridge

 

Topic:

Modern approach to the Traveling Salesman Problem

 

Description (in plain text format):

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".

 

Other Information:

Location: B660 University Hall

Web page: http://www.cs.uleth.ca/~nathanng/ntcoseminar/

 

Room or Area: 
B660

Contact:

Barb Hodgson | hodgsonb@uleth.ca | (403) 329-2470 | uleth.ca/artsci/math-computer-science

Attached Files: