travelling salesman problem

English dictionary entry

Meanings

noun
  1. 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.

Word forms

travelling salesman problem travelling-salesman problem traveling salesman problem traveling-salesman problem

Related words

dial-a-ride problem Hamiltonian path MathWorld article on the travelling salesman problem
This entry uses open data from Wiktionary (CC BY-SA/GFDL). Word forms are used for search and are not indexed as separate pages.