Jae Sik Lee, Monique Guignard, An Approximate Algorithm for Multidimensional Zero-One Knapsack Problems -- A Parametric Approach, Management Science, Vol. 34, No. 3, Focussed Issue on Heuristics (Mar.

This fictional dilemma, the “knapsack problem,” belongs to a class of mathematical problems famous for pushing the limits of computing. And the knapsack problem is more than a thought experiment.

The unbounded knapsack problem: given a knapsack of some capacity and a set of items that have a weight and a value, determine the maximum value of items you can place in your knapsack. The number ...