-
TSP Tour in 3D through 2,079,471 stars
To strike fear in the computing world, just whisper "traveling salesman problem." The echo will be "if we want to figure out the route for 28 cities, the universe will die before we get the result." Indeed, the reputation of the problem is such that advances on small instances (using admittedly cool technology) are ...