(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.
No comments yet — say something.
Add your own interpretation of "travelling salesman problem".
Regional slang from around the English-speaking world — British, Australian, Irish, Caribbean, Nigerian, Filipino, AAVE, and the hyphenated-English dialects that make the internet sound local.
See all Regional & Other slang on Slangora.