Pages that link to "Item:Q5892239"
From MaRDI portal
The following pages link to A Computationally Efficient FPTAS for Convex Stochastic Dynamic Programs (Q5892239):
Displayed 9 items.
- On the complexity of energy storage problems (Q1662159) (← links)
- The TV advertisements scheduling problem (Q1733325) (← links)
- A faster FPTAS for counting two-rowed contingency tables (Q1983128) (← links)
- Fully polynomial time \((\Sigma,\Pi)\)-approximation schemes for continuous nonlinear newsvendor and continuous stochastic dynamic programs (Q2089771) (← links)
- Knapsack problem with objective value gaps (Q2361124) (← links)
- Toward Breaking the Curse of Dimensionality: An FPTAS for Stochastic Dynamic Programs with Multidimensional Actions and Scalar States (Q4634100) (← links)
- (Q5002731) (← links)
- Provably Near-Optimal Approximation Schemes for Implicit Stochastic and Sample-Based Dynamic Programs (Q5148198) (← links)
- Single machine scheduling with assignable due dates to minimize maximum and total late work (Q6167395) (← links)