Knapsack 6 - search strategies, depth first, best first, least discrepancy

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

您将学习的技能

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

审阅

4.8(620 个评分)

  • 5 stars
    89.19%
  • 4 stars
    8.06%
  • 3 stars
    1.12%
  • 2 stars
    0.16%
  • 1 star
    1.45%

M

Jun 2, 2020

Filled StarFilled StarFilled StarFilled StarFilled Star

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

Filled StarFilled StarFilled StarFilled StarFilled Star

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.

从本节课中

Knapsack

教学方

  • Placeholder

    Professor Pascal Van Hentenryck

  • Placeholder

    Dr. Carleton Coffrin

    Adjunct Lecturer

探索我们的目录

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