knapsack (452B)
1 # Knapsack problem 2 3 We have items with weights and values, we want to find the best total value possible while keeping the weight under a certain limit 4 5 It is [np_complete] but not [strongly_np_complete] as there is a [pseudo_polynomial_time] algorithm. 6 7 There is an [fptas] 8 9 Special cases: 10 - [subset_sum] 11 - [change_making_problem] 12 13 Generalizations: [integer_linear_programming] 14 15 Up: [decision_problem], [optimization_problem] 16 17 See also: [bin_packing]