Traveling Salesman Problem
The traveling salesman problem asks for the shortest route by which a salesman can visit a set of locations and return home. Drag the points to change the locations the salesman visits to see how the route changes.
Contributed by:
Jon McLoone
Based on a program by:
Stephen Wolfram
After work by:
Stan Wagon
X
X
X
Show Source Code
|
Download Source Code Notebook
Traveling Salesman Problem
(
Wolfram
MathWorld
)
"
Traveling Salesman Problem
" from
The Wolfram Demonstrations Project
http://demonstrations.wolfram.com/TravelingSalesmanProblem/
Contributed by:
Jon McLoone
Based on a program by:
Stephen Wolfram
After work by:
Stan Wagon
Combinatorics
High School Trigonometry
Optimization
Traveling Salesman Game
Optimizing the 2008 Beijing Olympic Torch Tour
Affine-Scaling Interior Point Method
A Simple, Standard Linear Programming Scenario
Shortest Path between Two Points on a Sphere
Great Circles on Mercator's Chart
Optimal Bin Packing with Random Lengths
Convergence of Minimization Methods
Reflection of Parallel Rays by a Sphere
Spinning Out Sine and Cosine
Make a new version of this Demonstration
Upload a new Demonstration
Contact The Wolfram Demonstrations Project Team
Site Index
Wolfram Research
© 2008
The Wolfram Demonstrations Project & Contributors
Terms of Use
Privacy Policy
RSS
Atom
