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

A branch and bound algorithm for solution of the "knapsack problem," max Σ v i x i where Σ w i x i ≤ W and x i = 0, 1, is presented which can obtain either optimal or approximate solutions. Some ...

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.