Chevron Left
Back to Delivery Problem

Learner Reviews & Feedback for Delivery Problem by University of California San Diego

4.7
stars
358 ratings

About the Course

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....

Top reviews

AS

Jul 24, 2018

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.

AT

Nov 19, 2019

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.

Filter by:

26 - 48 of 48 Reviews for Delivery Problem

By Snehal P

Jul 14, 2020

By Kuldeep K

Aug 2, 2020

By Michael L

Dec 23, 2017

By lcy9086

Feb 3, 2019

By ANMOL B 1

Jun 2, 2020

By Julio R

Feb 27, 2021

By Preetam K S

Aug 5, 2020

By Srinivas B

Dec 5, 2020

By visesh b

Dec 5, 2020

By Uttej K G

Dec 5, 2020

By SRI S V S R M

Dec 4, 2020

By Naganaboina S K

Nov 2, 2020

By MUNUKUNTLA B P

Oct 30, 2020

By GERALD M F B B

Oct 3, 2020

By Thiago B D A

Mar 30, 2021

By Ahmad A

Jul 17, 2021

By Nikhil Y

Apr 21, 2020

By Konstantin K

Dec 25, 2017

By Kaustubh M

Feb 18, 2022

By Ivan Y C M

Aug 5, 2020

By SUBHADEEP S

Aug 17, 2020

By Long C

Dec 23, 2021

By Gaoge Z

Aug 2, 2020