Chevron Left
Volver a Delivery Problem

Opiniones y comentarios de aprendices correspondientes a Delivery Problem por parte de Universidad de California en San Diego

4.7
estrellas
358 calificaciones

Acerca del Curso

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

Principales reseñas

AS

24 de jul. de 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

19 de nov. de 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.

Filtrar por:

1 - 25 de 48 revisiones para Delivery Problem

por Aren T

19 de nov. de 2019

por Albina G

28 de jun. de 2020

por Ishan B

8 de ene. de 2020

por Arnab M

4 de may. de 2020

por David v R

18 de feb. de 2019

por Ashish S

25 de jul. de 2018

por Christopher W

4 de jun. de 2020

por Deleted A

26 de jun. de 2020

por Pedro H

7 de jul. de 2018

por Ehsan S

19 de jun. de 2018

por Satish K

31 de dic. de 2019

por Steven W

22 de dic. de 2017

por Danielle C G

21 de may. de 2019

por Afnan A

15 de ago. de 2020

por Matias R P d S

27 de may. de 2020

por Manikant R

12 de jun. de 2020

por Aviral K

27 de oct. de 2018

por Luis M V F

14 de ene. de 2020

por Ethan H

23 de feb. de 2021

por Juliano P

2 de ene. de 2021

por Ayrton C A d A

26 de nov. de 2020

por LANKA S R A

31 de oct. de 2020

por Nguyen D L

22 de mar. de 2021

por Divyang S

20 de sep. de 2020

por 叶罗鑫

25 de feb. de 2021