We consider a stochastic variant of the NP-hard 0/1 knapsack problem, in which item values are deterministic and item sizes are independent random variables with known, arbitrary distributions. Items ...

This is a preview. Log in through your library . Abstract Several types of large-sized 0-1 Knapsack Problems (KP) may be easily solved, but in such cases most of the computational effort is used for ...

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