travelling salesperson problem
0 sources
Summary
travelling salesperson problem is an optimization problem[1]. It draws 9,165 Wikipedia views per month (optimization problem category, ranking #1 of 7).[2]
Key Facts
- Named after: Peddler[3], door-to-door[4], traveling salesperson[5]
- Commons category: Traveling salesman problem[6]
- Topic's main category: Category:Travelling salesman problem[7]
- Solved by: swarm intelligence[8]
- Stack Exchange tag: https://stackoverflow.com/tags/traveling-salesman[9], https://or.stackexchange.com/tags/traveling-salesman[10]
- Maintained by WikiProject: WikiProject Mathematics[11]
- Computational complexity: NP-complete[12]
Why It Matters
travelling salesperson problem has Wikipedia articles in 27 language editions, a strong signal of global cultural recognition.[13] It is known by 89 alternative names across languages and contexts.[14]