Traveling salesman problem lacks any fast computational fix

Finding the absolutely shortest route to visit a handful of cities and return home sounds remarkably easy until you hit thirty destinations. The number of possible routes wildly explodes into nonillions. Even incredibly powerful supercomputers cannot quickly solve it, forcing programmers to rely entirely on vastly imperfect estimations.