Delivery Problem
- Offered byCoursera
- Public/Government Institute
Delivery Problem at Coursera Overview
Delivery Problem
at Coursera
Duration | 13 hours |
Total fee | Free |
Mode of learning | Online |
Difficulty level | Beginner |
Official Website | Explore Free Course  |
Credential | Certificate |
Delivery Problem
Table of contents
Delivery Problem at Coursera Highlights
Delivery Problem
at Coursera
- Shareable Certificate Earn a Certificate upon completion
- 100% online Start instantly and learn at your own schedule.
- Course 5 of 5 in the Introduction to Discrete Mathematics for Computer Science Specialization
- Flexible deadlines Reset deadlines in accordance to your schedule.
- Beginner Level
- Approx. 13 hours to complete
- English Subtitles: Arabic, French, Portuguese (European), Italian, Vietnamese, German, Russian, English, Spanish
Read more
Delivery Problem at Coursera Course details
Delivery Problem
at Coursera
Skills you will learn
More about this 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.
- Do you have technical problems? Write to us: coursera@hse.ru
Delivery Problem at Coursera Curriculum
Delivery Problem
at Coursera
Traveling Salesman Problem
Delivery Problem
Shortest Common Superstring Problem
Brute Force Search
Nearest Neighbor
Additional Materials
Puzzle: Delivery Problem
Cycle Weight
Brute Force Algorithm
Average Weight
Nearest Neighbors
Exact Algorithms
Branch and Bound
Dynamic Programming: Main Ideas
Dynamic Programming: Representing Subsets
Dynamic Programming: Code
Branch and Bound
Dynamic Programming
Approximation Algorithms
Approximation Algorithms
Local Search
2-Approximation
Other courses offered by Coursera
– / –
3 months
Beginner
View Other 6716 Courses
Delivery Problem
at Coursera
Student Forum
Anything you would want to ask experts?
Useful Links
Know more about Coursera
Know more about Programs
- Engineering
- Food Technology
- Instrumentation Technology
- BTech Chemical Engineering
- AI & ML Courses
- Aeronautical Engineering
- BTech Petroleum Engineering
- Petroleum Engineering
- VLSI Design
- MTech in Computer Science Engineering
- Metallurgical Engineering
- BTech Robotics Engineering
- BTech in Biotechnology Engineering
- Aerospace Engineering
- BTech Mechatronics Engineering