travelling-salesman problem
travelling-salesman problem is the alternative spelling of travelling salesman problem.
Meaning of travelling salesman problem
Noun
travelling salesman problem
- 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.
Questions about travelling-salesman problem
- What is travelling-salesman problem the alternative spelling of?
- Travelling-salesman problem is the alternative spelling of travelling salesman problem.
Words near travelling-salesman problem in the dictionary
Source and license
Adapted from Wiktionary: travelling-salesman problem (page history and authors); travelling salesman problem (page history and authors). Text available under the Creative Commons Attribution-ShareAlike 4.0 license. Word.ws reformatted the entry and added links. Wiktionary data of 2026-09-02.
Last updated:
Cite this entry: “travelling-salesman problem.” Word.ws, https://word.ws/travelling-salesman_problem. Based on Wiktionary, CC BY-SA 4.0.
