Save for later

Delivery Problem

This course is a part of Introduction to Discrete Mathematics for Computer Science, a 5-course Specialization series from Coursera.

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: [email protected]

Get Details and Enroll Now

OpenCourser is an affiliate partner of Coursera.

Set Reminder Save for later

Get a Reminder

Not ready to enroll yet? We'll send you an email reminder for this course

Send to:

Coursera

&

University of California San Diego

Rating 4.8 based on 10 ratings
Length 4 weeks
Effort 3 weeks of study, 2–5 hours/week
Starts Aug 12 (last week)
Cost $99
From University of California San Diego, National Research University Higher School of Economics via Coursera
Instructor Alexander S. Kulikov
Download Videos On all desktop and mobile devices
Language English
Subjects Programming Mathematics
Tags Computer Science Algorithms Math And Logic

Get a Reminder

Get an email reminder about this course

Send to:

What people are saying

According to other learners, here's what you need to know

2-approximation algorithm sections in one review

The material doesn't start off too hard but gets more difficult in the dynamic programming and 2-approximation algorithm sections.

very nice course in one review

Very Nice Course, Have fun!

efforts through google in one review

Left a lot of gaps to be filled by self learning efforts through Google etc; as each video had a line or two that weren't explained up to the mark.

hard but gets in one review

into studying algorithms in one review

This is a nice way to end the course and, seaways nicely into studying algorithms in general.

low intuitive mathematical in one review

Could have made video instruction a little more friendly to people with low intuitive mathematical knowledge.

Careers

An overview of related careers and their average salaries in the US. Bars indicate income percentile.

Well Site Leader Contractor Manager $62k

Well Operator Consultant $78k

Well Service e-line shop foreman $84k

Well Test / Admin $85k

Well tester / Flowback / Operator $89k

Well Operator $94k

Assistant Well Site Leader Manager $97k

Well Tie-In Designer $102k

Well Test Operator Lead $107k

Senior Well Construction Engineer $115k

Principal Well Tie-In Designer 1 $170k

President Well Site Leader $310k

Write a review

Your opinion matters. Tell us what you think.

Coursera

&

University of California San Diego

Rating 4.8 based on 10 ratings
Length 4 weeks
Effort 3 weeks of study, 2–5 hours/week
Starts Aug 12 (last week)
Cost $99
From University of California San Diego, National Research University Higher School of Economics via Coursera
Instructor Alexander S. Kulikov
Download Videos On all desktop and mobile devices
Language English
Subjects Programming Mathematics
Tags Computer Science Algorithms Math And Logic

Similar Courses

Sorted by relevance

Like this course?

Here's what to do next:

  • Save this course for later
  • Get more details from the course provider
  • Enroll in this course
Enroll Now