next up previous
Next: Car 54 Up: Applications of LP Previous: Telecommunications

Traveling Salesman Problem

Given a set of cities, find the shortest route that visits each city exactly once and returns to the home city.


Applications include:


Website:

http://www.keck.caam.rice.edu/tsp/


Largest problem solved to date has more than 13000 cities.



John E Mitchell
2000-04-11