A resource allocation problem, called the dynamic and stochastic knapsack problem (DSKP), is studied. A known quantity of resource is available, and demands for the resource arrive randomly over time.

We study the incremental knapsack problem, where one wishes to sequentially pack items into a knapsack whose capacity expands over a finite planning horizon, with the objective of maximizing ...

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