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

The traveling salesperson problem is so difficult that practical solutions can never be perfect – only good enough. The challenge is coming up with the best approximations.

© La Conversation - vendredi 9 avril 2021