In particular, we show that a nonstandard approach we call "left-right" dynamic programming is better suited for this problem than the standard "bottom-up" approach, and we show how this "left-right" ...

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