Knapsack 6 - search strategies, depth first, best first, least discrepancy

Loading...
Visualiser le programme de cours

Compétences que vous apprendrez

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

Avis

4.9 (314 notes)
  • 5 stars
    288 ratings
  • 4 stars
    20 ratings
  • 3 stars
    4 ratings
  • 1 star
    2 ratings
XW

Jul 16, 2017

Awesome course, learned a lot for solving NP hard problem. It could be hard for people without basic algorithm and data structure background.

EB

Jun 19, 2017

The course Materials and instructors are awesome.\n\nThis course is very good and essential in my point of view for researchers.

À partir de la leçon
Knapsack

Enseigné par

  • Professor Pascal Van Hentenryck

    Professor Pascal Van Hentenryck

  • Dr. Carleton Coffrin

    Dr. Carleton Coffrin

    Adjunct Lecturer

Explorer notre catalogue

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