Scheduling - jobshop, disjunctive global constraint

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

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

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

Рецензии

4.8 (оценок: 588)
  • 5 stars
    89.62%
  • 4 stars
    8.16%
  • 3 stars
    0.85%
  • 2 stars
    0.17%
  • 1 star
    1.19%
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.

AM
5 февр. 2017 г.

I like the instructor teaching approach and the evaluation system, the subject itself took me a lot of effort and i think the LNS technique should be teached just after local search.

Из урока
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

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

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