Delivery Problem
https://www.coursera.org/learn/delivery-problem?specialization=discrete-mathematics
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.
Categoria: Computer Science
Subcategoria: Algorithms
Tipo de Curso: Course
Habilidades:
Idioma: English
Subtitulos: Arabic, French, Portuguese (European), Italian, Vietnamese, German, Russian, English, Spanish
Rating: 4.7stars
Vistas: 359
Sitio Web: Coursera
Duracion: Approx. 13 hours to complete
Volver a
lista de cursos