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 ...

M. Hifi, M. Michrafy, A Reactive Local Search-Based Algorithm for the Disjunctively Constrained Knapsack Problem, The Journal of the Operational Research Society, Vol. 57, No. 6 (Jun., 2006), pp.

This paper analyzes a heuristic for the knapsack problem that recursively determines a solution by making a variable with smallest marginal unit cost as large as possible. Recursive necessary and ...

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.