travelling salesman problem

Definition from Wiktionary, the free dictionary
Jump to: navigation, search

English[edit]

Wikipedia

Alternative forms[edit]

Noun[edit]

travelling salesman problem (uncountable)

  1. (mathematics, UK, Canada) 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.

Translations[edit]

See also[edit]