Knapsack 5 - relaxation, branch and bound

Loading...
View Syllabus

Skills You'll Learn

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

Reviews

4.9 (516 ratings)
  • 5 stars
    90.50%
  • 4 stars
    7.55%
  • 3 stars
    0.96%
  • 1 star
    0.96%
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.

AD
Jun 5, 2019

Excellent course! The course video are very clear and build on each other as the course progress. It is well structured. The assignments have the right amount of difficulty.

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.