# Noon lecture

On 30.06.2011 at 12:20 in S11, there is the following noon lecture:

# The benefit of adaptivity in the stochastic knapsack problem with dependence on the state of nature

## Abstract

We consider a stochastic variant of the NP-hard 0/1 knapsack problem in which item values are deterministic and item sizes are random variables with known, arbitrary distributions. These distributions depend on a common random variable $\theta$ denoting the state of the nature. We assume that if we fix a value of $\theta$, then the size variables are independent. So $\theta$ induces a limited dependency among the sizes of different items.

Items are placed in the knapsack sequentially, and the act of placing an item in the knapsack instantiates its size. The goal is to compute a policy that maximizes the expected value of items successfully placed in the knapsack, where the final overflowing item contributes no value. We consider both nonadaptive policies (that designate a priori a fixed permutation of items to insert) and adaptive policies (that

Webmaster: kamweb.mff.cuni.cz         Modified: 25. 02. 2019