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

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