NIST

travelling salesman problem

(classic problem)

Definition: See traveling salesman.

Author: PEB


Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul Black.

Entry modified 28 August 2013.
HTML page formatted Mon Nov 18 10:44:10 2013.

Cite this as:
Paul E. Black, "travelling salesman problem", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 28 August 2013. (accessed TODAY) Available from: http://www.nist.gov/dads/HTML/travellingSalesmanProblem.html