LS 4 - optimality vs feasibility, graph coloring

video-placeholder
Loading...
查看授课大纲

您将学习的技能

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

审阅

4.8(587 个评分)
  • 5 stars
    89.60%
  • 4 stars
    8.17%
  • 3 stars
    0.85%
  • 2 stars
    0.17%
  • 1 star
    1.19%
M
Jun 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
Feb 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.

从本节课中
Local Search

教学方

  • Placeholder

    Professor Pascal Van Hentenryck

  • Placeholder

    Dr. Carleton Coffrin

    Adjunct Lecturer

探索我们的目录

免费加入并获得个性化推荐、更新和优惠。