Travelling Salesman's Problem
Library Home || Full Table of Contents || Suggest a Link || Library Help
|Algorithms to solve the travelling salesman's problem (a travelling salesman is to visit a number of cities; how to plan the trip so every city is visited once and just once and the whole trip is as short as possible?) Links to Java applets; the shell principle.|
|Resource Types:||Problems/Puzzles, Web Interactive/Java|
|Math Topics:||Graph Theory, Optimization|
© 1994-2013 Drexel University. All rights reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.