travelling salesman problem

Alternative forms

 * , traveling salesman problem, traveling-salesman problem

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.

Translations

 * Czech: problém obchodního cestujícího
 * Dutch:
 * Finnish: kauppamatkustajan ongelma
 * French: problème du voyageur de commerce, problème du commis voyageur
 * German: Problem des Handlungsreisenden
 * Greek: πρόβλημα του πλανόδιου πωλητή
 * Hebrew: בעיית הסוכן הנוסע
 * Hungarian:
 * Polish: problem komiwojażera
 * Portuguese: problema do caixeiro viajante
 * Turkish: seyyar satıcı problemi