At last! There’s an algorithm that’s closer than ever to solving the traveling salesperson problem

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
Read more at TNW | Tech…