Coursera Spring Sale
40% Off Coursera Plus Annual!
Grab it
Explore the fascinating world of the Traveling Salesman Problem (TSP) through this comprehensive seminar that debunks common misconceptions about computational complexity while showcasing real-world applications and cutting-edge solutions. Discover how Amazon drivers navigate daily delivery routes through 150+ customer stops using TSP optimization, and learn why claims about laptops needing 1,000 years to solve a 22-city problem ignore seven decades of mathematical advancement. Examine the techniques that won the $100,000 Amazon Last Mile Routing Challenge, developed in collaboration with Stephan Held and Keld Helsgaun, and understand how modern methods can solve 22-city problems easily even on smartphones. Delve into remarkable large-scale applications including the precise optimization of walking tours through 81,998 bars in Korea and the creation of a 3D route visiting 136,606,128 stars with a guarantee of being no more than 1.00016 times longer than the shortest possible tour. Investigate the broader implications for complexity theory and computational limits in engineering and science, while considering how focused research on seemingly unsolvable problems can produce results that exceed expectations and advance our understanding of what's computationally possible.
