Cited in
(22)- Relaxation analysis for the dynamic knapsack problem with stochastic item sizes
- Dynamic node packing
- Single-machine scheduling with general costs under compound-type distributions
- Logarithmic regret in the dynamic and stochastic knapsack problem with equal rewards
- General stochastic single-machine scheduling with regular cost functions
- Approximations to stochastic dynamic programs via information relaxation duality
- Approximation algorithms for stochastic combinatorial optimization problems
- An adaptive stochastic knapsack problem
- Optimal replace-repair strategy for servicing products sold with warranty
- Adaptive Bin Packing with Overflow
- Single-machine scheduling with exponential processing times and general stochastic cost functions
- A column and constraint generation algorithm for the dynamic knapsack problem with stochastic item sizes
- Stochastic knapsack revisited: the service level perspective
- Remarks on the distribution of the sample variance in exponential sampling
- On optimal replacement-repair policy for multi-state deteriorating products under renewing free replacement warranty
- Static stochastic Knapsack problems
- On the relation between complexity and uncertainty
- On the minimization of the weighted number of tardy jobs with random processing times and deadline
- Fifty years of research in scheduling -- theory and applications
- Replacement-repair policy for multi-state deteriorating products under warranty
- On the life and work of Cyrus Derman
- Semi-infinite relaxations for the dynamic knapsack problem with stochastic item sizes
This page was built for publication: A Renewal Decision Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4147809)
