noun (Commonwealth English)
|travelling salesman problem||
- (mathematics) 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.
- Dutch: handelsreizigersprobleem
- German: Problem des Handlungsreisenden
Supplemental Details:Sponsor an extended definition for travelling salesman problem for as little as $10 per month. Click here to contact us.