The following pages link to (Q4527034):
Displayed 10 items.
- On two-stage stochastic knapsack problems (Q643023) (← links)
- A PTAS for the chance-constrained knapsack problem with random item sizes (Q974983) (← links)
- Upper bounds for the 0-1 stochastic knapsack problem and a B\&B algorithm (Q993710) (← links)
- A fully polynomial-time approximation scheme for approximating a sum of random variables (Q1785211) (← links)
- A column and constraint generation algorithm for the dynamic knapsack problem with stochastic item sizes (Q2246190) (← links)
- Approximability of the two-stage stochastic knapsack problem with discretely distributed weights (Q2448903) (← links)
- Semi-Infinite Relaxations for the Dynamic Knapsack Problem with Stochastic Item Sizes (Q2817835) (← links)
- Toward Breaking the Curse of Dimensionality: An FPTAS for Stochastic Dynamic Programs with Multidimensional Actions and Scalar States (Q4634100) (← links)
- Relaxation Analysis for the Dynamic Knapsack Problem with Stochastic Item Sizes (Q4646440) (← links)
- STATIC STOCHASTIC KNAPSACK PROBLEMS (Q5358058) (← links)