travelling salesperson problem
NP-hard problem in combinatorial optimization
Press Enter · cited answer in seconds
0 sources
travelling salesperson problem
Summary
travelling salesperson problem is an optimization problem[1]. It draws 3,449 Wikipedia views per month (optimization_problem category, ranking #1 of 7).[2]
Key Facts
- travelling salesperson problem's instance of is recorded as optimization problem[3].
- Peddler is named after travelling salesperson problem[4].
- door-to-door is named after travelling salesperson problem[5].
- traveling salesperson is named after travelling salesperson problem[6].
- travelling salesperson problem's Commons category is recorded as Traveling salesman problem[7].
- travelling salesperson problem's topic's main category is recorded as Category:Travelling salesman problem[8].
- travelling salesperson problem's solved by is recorded as swarm intelligence[9].
- travelling salesperson problem's Stack Exchange tag is recorded as https://stackoverflow.com/tags/traveling-salesman[10].
- travelling salesperson problem's Stack Exchange tag is recorded as https://or.stackexchange.com/tags/traveling-salesman[11].
- travelling salesperson problem's maintained by WikiProject is recorded as WikiProject Mathematics[12].
- travelling salesperson problem's computational complexity is recorded as NP-complete[13].
Body
Definition and Type
travelling salesperson problem's instance of is recorded as optimization problem[3].
Origins
Things named after include Peddler[4], a profession[14]; door-to-door[5], a selling technique[15]; and traveling salesperson[6], a profession[16].
Why It Matters
travelling salesperson problem draws 3,449 Wikipedia views per month (optimization_problem category, ranking #1 of 7).[2] It has Wikipedia articles in 27 language editions, a strong signal of global cultural recognition.[17] It is known by 63 alternative names across languages and contexts.[18]