Travelling-salesman-problem Definition

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.

Wiktionary

Related Articles

Travelling-salesman-problem Is Also Mentioned In

Find Similar Words

Find similar words to travelling-salesman-problem using the buttons below.

Words Starting With

Words Ending With

Unscrambles

travelling-salesman-problem

Words Starting With T and Ending With M

Starts With T & Ends With M Starts With TR & Ends With M Starts With T & Ends With EM

Word Length

Words Near Travelling-salesman-problem in the Dictionary