Delivery Problem

ALUMNOS MATRICULADOS
    ¡Compártelo! Share on Facebook0Share on LinkedIn0Share on Google+0Tweet about this on Twitter


    We’ll implement together an efficient program 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 efficient 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.

    Course Reviews

    N.A.

    ratings
    • 5 stars0
    • 4 stars0
    • 3 stars0
    • 2 stars0
    • 1 stars0

    No Reviews found for this course.

    COMUNIDAD MOOC IR AL CURSO

    *Irás a la plataforma donde se impartirá el mooc y donde podrás registrarte

    • GRATIS
    • 01-11-2017FECHA INICIO
    • University of California, San Diego
    • Alexander S. Kulikov

    Acerca de Mooc.es

    En Mooc.es encontrarás la mayor oferta de cursos de las mejores universidades del mundo.

    El conocimiento al alcance de todos.

    ¡Compártelo!

    Share on Facebook0Share on LinkedIn0Share on Google+0Tweet about this on Twitter
    top