Definitions from Wiktionary (travelling salesman problem)
▸ 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.
▸ Words similar to travelling salesman problem
▸ Usage examples for travelling salesman problem
▸ Idioms related to travelling salesman problem
▸ Wikipedia articles (New!)
▸ Words that often appear near travelling salesman problem
▸ Rhymes of travelling salesman problem
▸ Invented words related to travelling salesman problem
▸ 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.
Similar:
traveling-salesman problem,
travelling-salesman problem,
traveling salesman problem,
Canadian traveller problem,
dial-a-ride problem,
optimization problem,
tabu search,
Lin-Kernighan heuristic,
Prouhet-Tarry-Escott problem,
Chinese postman problem,
more...
▸ Words similar to travelling salesman problem
▸ Usage examples for travelling salesman problem
▸ Idioms related to travelling salesman problem
▸ Wikipedia articles (New!)
▸ Words that often appear near travelling salesman problem
▸ Rhymes of travelling salesman problem
▸ Invented words related to travelling salesman problem