The Traveling Salesman Problem (TSP)
Library Home || Full Table of Contents || Suggest a Link || Library Help
|The problem: given a finite number of cities and the cost of travel between each pair of them, find the cheapest way of visiting them all and returning to your starting point. This site includes a link to TSPLIB, Gerhard Reinelt's library of some hundred instances of the problem, and computer code that has solved more than twenty previously unsolved instances. With links to related sites.|
© 1994-2013 Drexel University. All rights reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.