Mathematics of Operations Research, Vol. 33, No. 4 (Nov., 2008), pp. 945-964 (20 pages) We consider a stochastic variant of the NP-hard 0/1 knapsack problem, in which item values are deterministic and ...

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