traveling-salesman problem

A form of 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.

Ask AI about this wordChatGPTClaudePerplexityGoogle AIGrok

Meanings

noun
  1. alternativeAlternative spelling of travelling salesman problem.
Cite this entry
APA

traveling-salesman problem. (n.d.). In WatkinsX Dictionary. Retrieved November 5, 2026, from https://dictionary.watkinsx.com/word/traveling-salesman%20problem

MLA

“traveling-salesman problem.” WatkinsX Dictionary, https://dictionary.watkinsx.com/word/traveling-salesman%20problem. Accessed November 5, 2026.

Chicago

WatkinsX Dictionary, s.v. “traveling-salesman problem,” accessed November 5, 2026, https://dictionary.watkinsx.com/word/traveling-salesman%20problem.

Source: traveling-salesman problem on Wiktionary, CC BY-SA 4.0.