What is travelling salesman problem? Here are some definitions.
Noun
(mathematics) The problem in combinatorialoptimization 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.