If you've ever been on a cross-country road trip, the traveling salesman problem should feel familiar: If you have a given number of cities, what's the most efficient route you can take to visit each city and land back where you started? It may sound like an easy problem to solve, but it's enough of a challenge that mathematicians and computer scientists have been racking their brains over it for centuries.
Simple Problem, Impossible Solution
Inching Ever Closer
Written by Ashley Hamer March 28, 2017
Wake up with the smartest email in your inbox.
Our Best Articles Daily