|
|
Definition of Travelling salesman problem
1. Noun. (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. ¹
¹ Source: wiktionary.com
Lexicographical Neighbors of Travelling Salesman Problem
Other Resources:
