From Wikipedia, a free encyclopedia written in simple English for easy reading.
[edit] Summary
"Given the distances between any two points, what is the shortest route a salesman can make from point A, visiting all points, and returning to point A? This is the Travelling Salesman problem, an NP-Hard problem in mathematics."
I made this image to illustrate the "traveling salesman" problem. I put no restrictions on its use.
[edit] Licensing
(If anyone wants to replace this with a more attractive image, it won't hurt my feelings one bit.)
Links
The following pages link to this file: