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.

It is well-known that many instances of the 0-1 knapsack problem can be effectively solved to optimality also for very large values of n (the number of binary variables), while other instances cannot ...