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.
Acerca de este Curso
- 5 stars76,53 %
- 4 stars18,15 %
- 3 stars2,79 %
- 2 stars2,23 %
- 1 star0,27 %
Principales reseñas sobre DELIVERY PROBLEM
Amazing course with lots of intuitive examples and puzzles
VERY GOOD COURSE IT IS SO BENTIFITIAL TO THE PEOLPLE WHO ARE INTERTESTED TO DEVELOP THE MATHEMATICAL SKILLS
Well structured introductory course into transportation problems. The code in examples is well written and clean. It was a pleasure to study this course.
This is a very nice course. I feel that a further explanation in the coding problems would be useful since sometimes you are not sure what one should return from the function.
Acerca de Programa especializado: Introduction to Discrete Mathematics for Computer Science
¿Cuándo podré acceder a las lecciones y tareas?
¿Qué recibiré si compro el Certificado?
¿Hay ayuda económica disponible?
¿Tienes más preguntas? Visita el Centro de Ayuda al Estudiante.