Knapsack 2 - greedy algorithms

video-placeholder
Loading...
Visualiser le programme de cours

Compétences que vous apprendrez

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

Avis

4.8 (587 évaluations)
  • 5 stars
    89.60%
  • 4 stars
    8.17%
  • 3 stars
    0.85%
  • 2 stars
    0.17%
  • 1 star
    1.19%
M
2 juin 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
5 févr. 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.

À partir de la leçon
Knapsack

Enseigné par

  • Placeholder

    Professor Pascal Van Hentenryck

  • Placeholder

    Dr. Carleton Coffrin

    Adjunct Lecturer

Explorer notre catalogue

Rejoignez-nous gratuitement et obtenez des recommendations, des mises à jour et des offres personnalisées.