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. While designing these solutions, we will rely heavily on the material learned in the courses of the specialization: proof techniques, combinatorics, probability, graph theory. We’ll see several examples of using discrete mathematics ideas to get more and more efficient solutions.
AT
A fun conclusion to the specialization that brings all of the mathematics of combinatorics and graph theory together to show how it can be applied to some real world problems.
LA
VERY GOOD COURSE IT IS SO BENTIFITIAL TO THE PEOLPLE WHO ARE INTERTESTED TO DEVELOP THE MATHEMATICAL SKILLS
TA
O curso é muito interessante, porém a explicação é um pouco confusa. Poderia ter uma explicação em vídeo da parte envolvendo programação, e não apenas deixar isso como tarefa
AG
Well structured introductory course into transportation problems. The code in examples is well written and clean. It was a pleasure to study this course.
NL
This series is great. I am confident to tutor my son in CS now.Thanks UCSD and HSE
AA
Great course, but complex matters need to explained more slowly and that's overall for all the specialization, but many thanks! those were some challenging courses!
AS
This final course in 5 course specialization is relatively easy one, although the last problem takes little bit time to solve. Provides good introduction to difficult to learn Delivery problem.
LB
It's a great introductory course to these topics. I didn't particularly enjoy the puzzles and "treasure hunt" in Number Theory and Cryptography but it's just a matter of learning styles I guess.
DS
Amazing course with lots of intuitive examples and puzzles
SW
This is a nice way to end the course and, seaways nicely into studying algorithms in general.
SK
Very good course. If you are really good in python then go ahead with this course. Challenging questions to solve.
DG
This course is to the point and challenges you with practical application.
显示：20/55
A fun conclusion to the specialization that brings all of the mathematics of combinatorics and graph theory together to show how it can be applied to some real world problems.
Well structured introductory course into transportation problems. The code in examples is well written and clean. It was a pleasure to study this course.
Best course I've taken on Coursera. To be honest, I'm not sure it qualifies as a "capstone project"; it was more like a normal course with multiple, smaller programming challenges. Alex's teaching style shone in this practical problem-centered curriculum, and as a result, I was much more engaged than in the theory-heavy courses like Number Theory. I especially enjoyed the module on dynamic programming; it's good to see some more advanced content, even if it's optional. Please make future courses similar to this one!
This one can be completed much faster than the others. It is only 3 weeks. It took me about 6 hours to go through everything. The lessons are well explained and the exercises very helpful.
You should have some understanding of Python (from the previous modules) and graph theory (module 3). This was a fun way to end the specialization!
please make courses on how to code in different libraries, its highly necessary, because most of my friends wont even get the certificate even if they know how to solve problems just because they cant code
all in all 5 stars because im really exhausted
A great course of course.. provides a perfect introduction to the problem and methods of solving the infamous Travelling Salesman Problem!! Go ahead with this course but you are required to have a good working knowledge of Python
Interesting little course on a fascinating problem. The material doesn't start off too hard but gets more difficult in the dynamic programming and 2-approximation algorithm sections. This course is a good introduction to the TSP.
It's a great introductory course to these topics. I didn't particularly enjoy the puzzles and "treasure hunt" in Number Theory and Cryptography but it's just a matter of learning styles I guess.
This final course in 5 course specialization is relatively easy one, although the last problem takes little bit time to solve. Provides good introduction to difficult to learn Delivery problem.
Very good course, I learned concepts about TSP - Traveling Salesman Problem, Branch and Bound, Dynamic Programming, MST - Minimum Spanning Tree and 2-Approximation.
I liked it! Interesting material and challenging assignments! I am going to miss these professors a lot. Thanks for everything you geniuses from HSE!
My personal favourite of the 5 courses in this specialisation due to the programming problems. Was a semi-relaxing way to end the specialisation.
Great way to end a really detailed and engaging specialization that introduces anyone with a minimum background in Python to Algorithms.
perfect course! very easy and interesting to follow. Pseudo-Algorithms were very useful and helped a lot to understand the concepts.
Very good course. If you are really good in python then go ahead with this course. Challenging questions to solve.
VERY GOOD COURSE IT IS SO BENTIFITIAL TO THE PEOLPLE WHO ARE INTERTESTED TO DEVELOP THE MATHEMATICAL SKILLS
This is a nice way to end the course and, seaways nicely into studying algorithms in general.
This series is great. I am confident to tutor my son in CS now.
Thanks UCSD and HSE
This course is to the point and challenges you with practical application.
Amazing course with lots of intuitive examples and puzzles