Planning the best route with multiple destinations is hard even for supercomputers – a new approach breaks a barrier that's stood for nearly half a century
- Written by Nathan Klein, PhD Student in Computer Science, University of Washington
wundervisuals/E+ via Getty Images
Computers are good at answering questions. What’s the shortest route from my house to Area 51? Is 8,675,309 a prime number? How many teaspoons in a tablespoon? For...