CSE201, Winter 2025, Lec6: Dynamic programming, the knapsack problem
C. Seshadhri · 81:00
Dynamic programming is a method for turning discrete optimization problems—choose a subset or permutation of *n* items to maximize or minimize an easy-to-evaluate function—into polynomial time when a recurrence has on...