Scheduling - jobshop, disjunctive global constraint

video-placeholder
Loading...
Просмотреть программу курса

Получаемые навыки

Constraint Programming, Branch And Bound, Discrete Optimization, Linear Programming (LP)

Рецензии

4.8 (оценок: 696)

  • 5 stars
    89,08 %
  • 4 stars
    8,18 %
  • 3 stars
    1 %
  • 2 stars
    0,14 %
  • 1 star
    1,58 %

M

2 июня 2020 г.

This is, without a doubt, one of the most interesting courses I have ever taken. You will be challenged to create your own ideas and you will get to know what NP hard means in practice.

GD

1 мая 2019 г.

I just completed the course. This an amazing course with an Outstanding professor and highly interesting, although difficult, assignments. Thanks for this! I am proud to have finished

Из урока

Advanced Topics: Part I

These lectures cover some more advanced concepts in optimization. They introduce constraint-programming techniques for scheduling and routing.

Преподаватели

  • Placeholder

    Professor Pascal Van Hentenryck

  • Placeholder

    Dr. Carleton Coffrin

    Adjunct Lecturer

Ознакомьтесь с нашим каталогом

Присоединяйтесь бесплатно и получайте персонализированные рекомендации, обновления и предложения.