travelling salesman problem love

travelling salesman problem


from Wiktionary, Creative Commons Attribution/Share-Alike License

  • n. 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.


Sorry, no etymologies found.


    Sorry, no example sentences found.


Log in or sign up to get involved in the conversation. It's quick and easy.