A Fully Polynomial-Time Approximation Scheme for Single-Item Stochastic Inventory Control with Discrete Demand
From MaRDI portal
Publication:3169059
DOI10.1287/moor.1090.0391zbMath1231.90030OpenAlexW2101831095WikidataQ59592335 ScholiaQ59592335MaRDI QIDQ3169059
Jim Orlin, David Simchi-Levi, Mohamed Mostagir, Diego Klabjan, Nir Halman
Publication date: 27 April 2011
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.1090.0391
Stochastic programming (90C15) Approximation methods and heuristics in mathematical programming (90C59) Inventory, storage, reservoirs (90B05) Dynamic programming (90C39)
Related Items
An FPTAS for two performance measures for the relocation scheduling problem subject to fixed processing sequences ⋮ Fully polynomial-time approximation schemes for time-cost tradeoff problems in series-parallel project networks ⋮ A deterministic fully polynomial time approximation scheme for counting integer knapsack solutions made easy ⋮ The finite horizon investor problem with a budget constraint ⋮ Asymptotic Optimality of Constant-Order Policies for Lost Sales Inventory Models with Large Lead Times ⋮ Approximation schemes for non-separable non-linear Boolean programming problems under nested knapsack constraints ⋮ The stochastic lot-sizing problem with quantity discounts ⋮ Stochastic lot sizing problem with nervousness considerations ⋮ Calculating target inventory levels for constrained production: a fast simulation-based approximation ⋮ On the complexity of energy storage problems ⋮ Combining Polyhedral Approaches and Stochastic Dual Dynamic Integer Programming for Solving the Uncapacitated Lot-Sizing Problem Under Uncertainty ⋮ Stochastic lot-sizing problem with inventory-bounds and constant order-capacities ⋮ Optimality Gap of Constant-Order Policies Decays Exponentially in the Lead Time for Lost Sales Models ⋮ A technical note: fully polynomial time approximation schemes for minimizing the makespan of deteriorating jobs with nonlinear processing times ⋮ Computation of Exact Bootstrap Confidence Intervals: Complexity and Deterministic Algorithms ⋮ The TV advertisements scheduling problem ⋮ Toward Breaking the Curse of Dimensionality: An FPTAS for Stochastic Dynamic Programs with Multidimensional Actions and Scalar States ⋮ A Faster FPTAS for #Knapsack ⋮ Provably Near-Optimal Approximation Schemes for Implicit Stochastic and Sample-Based Dynamic Programs ⋮ A faster FPTAS for counting two-rowed contingency tables ⋮ Resource allocation in rooted trees subject to sum constraints and nonlinear cost functions ⋮ Bi-criteria path problem with minimum length and maximum survival probability ⋮ Near-Optimal Algorithms for the Assortment Planning Problem Under Dynamic Substitution and Stochastic Demand ⋮ Sampling-Based Approximation Schemes for Capacitated Stochastic Inventory Control Models ⋮ A review of four decades of time-dependent scheduling: main results, new topics, and open problems ⋮ Strongly polynomial FPTASes for monotone dynamic programs ⋮ Fully polynomial time \((\Sigma,\Pi)\)-approximation schemes for continuous nonlinear newsvendor and continuous stochastic dynamic programs ⋮ Automatic Generation of FPTASes for Stochastic Monotone Dynamic Programs Made Easier
