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

The Journal of the Operational Research Society, Vol. 57, No. 6 (Jun., 2006), pp. 718-726 (9 pages) In this paper, we propose a reactive local search-based algorithm for the disjunctively constrained ...

We describe an algorithm for the 0-1 knapsack problem (KP), which relies mainly on three new ideas. The first one is to focus on what we call the core of the problem, namely, a knapsack problem ...