LS 4 - optimality vs feasibility, graph coloring

Loading...
View Syllabus

Skills You'll Learn

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

Reviews

4.9 (530 ratings)
  • 5 stars
    90.56%
  • 4 stars
    7.54%
  • 3 stars
    0.94%
  • 1 star
    0.94%
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.

From the lesson
Local Search

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.