The Dynamic and Stochastic Knapsack Problem (DSKP) is defined as follows. Items arrive according to a Poisson process in time. Each item has a demand (size) for a limited resource (the knapsack) and ...

Dynamic programming algorithms are developed for optimal capital allocation subject to budget constraints. We extend the work of Weingartner [17] and Weingartner and Ness [19] by including multilevel ...

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