Alternative spellings

• travelling-salesman problem , traveling salesman problem , traveling-salesman problem

Noun

1. The problem in combinatorial optimization in which, given a number of cities and the costs of travelling from one to the other, it is required to determine the cheapest route that visits each city once and then returns to the initial city.

See also

• MathWorld article on the travelling salesman problem