info prev up next book cdrom email home

Traveling Salesman Problem

A problem in Graph Theory requiring the most efficient (i.e., least total distance) Tour (i.e., closed path) a salesman can take through each of $n$ cities. No general method of solution is known, and the problem is NP-Hard.

See also Traveling Salesman Constants


Platzman, L. K. and Bartholdi, J. J. ``Spacefilling Curves and the Planar Travelling Salesman Problem.'' J. Assoc. Comput. Mach. 46, 719-737, 1989.

© 1996-9 Eric W. Weisstein