Pages that link to "Item:Q3169059"
From MaRDI portal
The following pages link to A Fully Polynomial-Time Approximation Scheme for Single-Item Stochastic Inventory Control with Discrete Demand (Q3169059):
Displayed 28 items.
- A deterministic fully polynomial time approximation scheme for counting integer knapsack solutions made easy (Q306252) (← links)
- Calculating target inventory levels for constrained production: a fast simulation-based approximation (Q342006) (← links)
- Stochastic lot-sizing problem with inventory-bounds and constant order-capacities (Q613461) (← links)
- Fully polynomial-time approximation schemes for time-cost tradeoff problems in series-parallel project networks (Q833589) (← links)
- Approximation schemes for non-separable non-linear Boolean programming problems under nested knapsack constraints (Q1651695) (← links)
- The stochastic lot-sizing problem with quantity discounts (Q1652181) (← links)
- Stochastic lot sizing problem with nervousness considerations (Q1652600) (← links)
- 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)
- Resource allocation in rooted trees subject to sum constraints and nonlinear cost functions (Q2032152) (← links)
- Strongly polynomial FPTASes for monotone dynamic programs (Q2088581) (← links)
- Fully polynomial time \((\Sigma,\Pi)\)-approximation schemes for continuous nonlinear newsvendor and continuous stochastic dynamic programs (Q2089771) (← links)
- An FPTAS for two performance measures for the relocation scheduling problem subject to fixed processing sequences (Q2128769) (← links)
- A technical note: fully polynomial time approximation schemes for minimizing the makespan of deteriorating jobs with nonlinear processing times (Q2215197) (← links)
- Bi-criteria path problem with minimum length and maximum survival probability (Q2284640) (← links)
- A review of four decades of time-dependent scheduling: main results, new topics, and open problems (Q2305016) (← links)
- The finite horizon investor problem with a budget constraint (Q2379989) (← links)
- Near-Optimal Algorithms for the Assortment Planning Problem Under Dynamic Substitution and Stochastic Demand (Q2806071) (← 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)
- Toward Breaking the Curse of Dimensionality: An FPTAS for Stochastic Dynamic Programs with Multidimensional Actions and Scalar States (Q4634100) (← links)
- A Faster FPTAS for #Knapsack (Q5002742) (← links)
- Automatic Generation of FPTASes for Stochastic Monotone Dynamic Programs Made Easier (Q5013571) (← links)
- Combining Polyhedral Approaches and Stochastic Dual Dynamic Integer Programming for Solving the Uncapacitated Lot-Sizing Problem Under Uncertainty (Q5086004) (← links)
- Computation of Exact Bootstrap Confidence Intervals: Complexity and Deterministic Algorithms (Q5130518) (← links)
- Provably Near-Optimal Approximation Schemes for Implicit Stochastic and Sample-Based Dynamic Programs (Q5148198) (← links)
- Sampling-Based Approximation Schemes for Capacitated Stochastic Inventory Control Models (Q5219734) (← links)