Material Detail

Lecture 13: The Knapsack Problem

Lecture 13: The Knapsack Problem

A pdf of slides that explains the 0-1 Knapsack problem and shows how to solve it using dynamic programming.

Rate

Quality

  • User Rating
  • Comments
  • Learning Exercises
  • Bookmark Collections
  • Course ePortfolios
  • Accessibility Info

More about this material

Browse...

Disciplines with similar materials as Lecture 13: The Knapsack Problem

Comments

Log in to participate in the discussions or sign up if you are not already a MERLOT member.