0/1 Knapsack - related
Suppose air travel restrictions specify that one can only pack in k items from a specified “problem
list” of items, called L. You have a set of unrestricted items A and problem set of item B ⊆ L. Let
A ∪ B = S where S = {s1, s2, . . . sn}. Each item has weight wi and provides benefit bi. Set up a dynamic programming recurrence to solve the problem of packing your suitcase with maximum weight W in order to maximize your benefit.