travelling salesman problem
Word Rarity
Rare
Frequency: Zipf frequency 3.52 in modern English
37
Scrabble Score
25
Letters
6
Syllables
14
Unique Chars
Meaning
noun
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.
Canadian usage; British usage