🔬 Science The traveling salesman problem asks for the shortest route between cities — it's computationally intractable for large numbers of cities. Fact #5070 👍 Like 👎 Nope 📣 Share ✨ Next Fact 👍 0 · 👎 0