Drexel dragonThe Math ForumDonate to the Math Forum

The Math Forum Internet Mathematics Library

The Traveling Salesman Problem (TSP)

_____________________________________
Library Home || Full Table of Contents || Suggest a Link || Library Help
_____________________________________

Visit this site: http://www.cs.concordia.ca/~chvatal/tsp/tsp.html
Author:Vasek Chvátal
Description: 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.
Levels: College, Research
Languages: English
Resource Types: Problems/Puzzles
Math Topics: Optimization

[Privacy Policy] [Terms of Use]

_____________________________________
Home || The Math Library || Quick Reference || Search || Help
_____________________________________

© 1994-2013 Drexel University. All rights reserved.
http://mathforum.org/
 The Math Forum is a research and educational enterprise of the Goodwin College of Professional Studies.The Math Forum is a research and educational enterprise of the Drexel University School of Education.