travelling salesman problem

travelling salesman problem

English

Alternative forms

• travelling-salesman problem (British, Canada), traveling salesman problem (US), traveling-salesman problem (US)

Noun

travelling salesman problem

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

Czech: problém obchodního cestujícího Dutch: handelsreizigersprobleem (nl) Finnish: kauppamatkustajan ongelma French: problème du voyageur de commerce m, problème du commis voyageur m German: Problem des Handlungsreisenden n Greek: πρόβλημα του πλανόδιου πωλητή n (próvlima tou planódiou polití)

Hebrew: בעיית הסוכן הנוסע‎ Hungarian: az utazó ügynök problémája Polish: problem komiwojażera Portuguese: problema do caixeiro viajante m Turkish: seyyar satıcı problemi

See also

• Hamiltonian path
• MathWorld article on the travelling salesman problem