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

The problem can be stated as following: given a finite number of objects and a knapsack, find the maximum total profit under the constraint that the total weight of all chosen objects is at most the ...

Improve this page Add a description, image, and links to the knapformer-knapsack-problem topic page so that developers can more easily learn about it.