Pages that link to "Item:Q2917636"
From MaRDI portal
The following pages link to Approximating the Nonlinear Newsvendor and Single-Item Stochastic Lot-Sizing Problems When Data Is Given by an Oracle (Q2917636):
Displaying 12 items.
- Approximation schemes for non-separable non-linear Boolean programming problems under nested knapsack constraints (Q1651695) (← links)
- On the complexity of energy storage problems (Q1662159) (← links)
- The TV advertisements scheduling problem (Q1733325) (← links)
- An FPTAS for the single-item capacitated economic lot-sizing problem with supply and demand (Q1939682) (← 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)
- Newsvendor problems: an integrated method for estimation and optimisation (Q2116868) (← links)
- Optimality Gap of Constant-Order Policies Decays Exponentially in the Lead Time for Lost Sales Models (Q2957476) (← links)
- Asymptotic Optimality of Constant-Order Policies for Lost Sales Inventory Models with Large Lead Times (Q3186534) (← links)
- Polynomial-Time Solvability of Dynamic Lot Size Problems (Q3188765) (← links)
- Automatic Generation of FPTASes for Stochastic Monotone Dynamic Programs Made Easier (Q5013571) (← links)
- Provably Near-Optimal Approximation Schemes for Implicit Stochastic and Sample-Based Dynamic Programs (Q5148198) (← links)
