Knapsack 2 - greedy algorithms

video-placeholder
Loading...
View Syllabus

Skills You'll Learn

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

Reviews

4.8 (618 ratings)

  • 5 stars
    89.15%
  • 4 stars
    8.09%
  • 3 stars
    1.13%
  • 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.

From the lesson

Knapsack

Taught By

  • Placeholder

    Professor Pascal Van Hentenryck

  • Placeholder

    Dr. Carleton Coffrin

    Adjunct Lecturer

Explore our Catalog

Join for free and get personalized recommendations, updates and offers.