Knapsack 4 - dynamic programming

Video placeholder
Loading...
View Syllabus

Skills You'll Learn

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

Reviews

4.8 (750 ratings)

  • 5 stars
    89.33%
  • 4 stars
    7.86%
  • 3 stars
    1.20%
  • 2 stars
    0.13%
  • 1 star
    1.46%

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.

GD

May 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

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.