travelling salesman problem
English
Alternative forms
- travelling-salesman problem (British, Canada), traveling salesman problem (US), traveling-salesman problem (US)
Noun
- (mathematics, Britain, 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
mathematical problem
|
|
This article is issued from
Wiktionary.
The text is licensed under Creative
Commons - Attribution - Sharealike.
Additional terms may apply for the media files.