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.
Об этом курсе
- 5 stars76,53 %
- 4 stars18,15 %
- 3 stars2,79 %
- 2 stars2,23 %
- 1 star0,27 %
Лучшие отзывы о курсе DELIVERY PROBLEM
perfect course! very easy and interesting to follow. Pseudo-Algorithms were very useful and helped a lot to understand the concepts.
This is a nice way to end the course and, seaways nicely into studying algorithms in general.
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 is a very nice course. I feel that a further explanation in the coding problems would be useful since sometimes you are not sure what one should return from the function.
Специализация Introduction to Discrete Mathematics for Computer Science: общие сведения
Часто задаваемые вопросы
Когда я получу доступ к лекциям и заданиям?
Что я получу, оплатив сертификацию?
Можно ли получить финансовую помощь?
Остались вопросы? Посетите Центр поддержки учащихся.