The traveling salesman problem asks for the shortest route between cities — it's computationally intractable for large numbers of cities.

Fact #5070
✨ Next Fact
👍 0 · 👎 0
Want more facts?
We have over 11,491 facts across 15 categories.
Copied!