Nathan Klein

1

Article

0

Comments
Finding 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

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

Nathan Klein, University of Washington

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.

Contact Nathan for

  • General
  • Media request
  • Speaking request
  • Consulting / Advising
  • Research collaboration
  • Research supervision