In this online course we’ll implement (in Python) together efficient programs for a problem needed by delivery companies all over the world millions times per day — the travelling salesman problem. The goal in this problem is to visit all the given places as quickly as possible. How to find an optimal solution to this problem quickly? We still don’t have provably efficient algorithms for this difficult computational problem and this is the essence of the P versus NP problem, the most important open question in Computer Science. Still, we’ll implement several solutions for real world instances of the travelling salesman problem.
UC San Diego is an academic powerhouse and economic engine, recognized as one of the top 10 public universities by U.S. News and World Report. Innovation is central to who we are and what we do. Here, students learn that knowledge isn't just acquired in the classroom—life is their laboratory.
- 5 stars76.75%
- 4 stars17.92%
- 3 stars2.80%
- 2 stars2.24%
- 1 star0.28%
I liked it! Interesting material and challenging assignments! I am going to miss these professors a lot. Thanks for everything you geniuses from HSE!
This series is great. I am confident to tutor my son in CS now.
Thanks UCSD and HSE
perfect course! very easy and interesting to follow. Pseudo-Algorithms were very useful and helped a lot to understand the concepts.
Great way to end a really detailed and engaging specialization that introduces anyone with a minimum background in Python to Algorithms.