Definition of traveling salesman problem in English:

traveling salesman problem

Syllabification: trav·el·ing sales·man prob·lem


A mathematical problem in which one tries to find the shortest route that passes through each of a set of points once and only once.
More example sentences
  • Instead of starting with random collections of answers, such as the various routes in the travelling salesman problem, GP begins with random collections of mathematical operations and inputs: add, x, sine, multiply, y, and so on.
  • A classic example is the travelling salesman problem, which entails working out the shortest route connecting a large number of points in space so that each is visited just once.
  • These ‘ants’ are good for solving a classic algorithm problem, the so-called ‘travelling salesman problem.

Get more from Oxford Dictionaries

Subscribe to remove ads and access premium resources

Word of the day noisome
Pronunciation: ˈnoisəm
having an extremely offensive smell