Business Success


.

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
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 centuryFinding the best tour from A through B, C and D and back to A might not be that hard, but adding a few more destinations could give you a headache.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...

Read more: Planning the best route with multiple destinations is hard even for supercomputers – a new...

Metropolitan republishes selected articles from The Conversation USA with permission

Visit The Conversation to see more

Business Marketing