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.
About this Course
- 5 stars76.53%
- 4 stars18.15%
- 3 stars2.79%
- 2 stars2.23%
- 1 star0.27%
TOP REVIEWS FROM DELIVERY PROBLEM
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.
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!
This course is to the point and challenges you with practical application.
perfect course! very easy and interesting to follow. Pseudo-Algorithms were very useful and helped a lot to understand the concepts.
About the Introduction to Discrete Mathematics for Computer Science Specialization
Frequently Asked Questions
When will I have access to the lectures and assignments?
What will I get if I subscribe to this Specialization?
Is financial aid available?
More questions? Visit the Learner Help Center.