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 (610 évaluations)

  • 5 stars
    89,50 %
  • 4 stars
    7,86 %
  • 3 stars
    1,14 %
  • 2 stars
    0,16 %
  • 1 star
    1,31 %

M

2 juin 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.

GD

1 mai 2019

Filled StarFilled StarFilled StarFilled StarFilled Star

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

À 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.