MIP 4 - convex hull, polyhedral cuts, warehouse location, node packing, graph coloring

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

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

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

Рецензии

4.9 (оценок: 513)
  • 5 stars
    90.64%
  • 4 stars
    7.40%
  • 3 stars
    0.97%
  • 1 star
    0.97%
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

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.

Из урока
Mixed Integer Programming

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

  • Placeholder

    Professor Pascal Van Hentenryck

  • Placeholder

    Dr. Carleton Coffrin

    Adjunct Lecturer

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

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