Approximation Algorithm for the Stochastic Multiperiod Inventory Problem via a Look-Ahead Optimization Approach
From MaRDI portal
Publication:5247610
DOI10.1287/moor.2013.0639zbMath1310.90124OpenAlexW1963643694MaRDI QIDQ5247610
Publication date: 24 April 2015
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/591c8906ad77d4ad0f197f7547b1594b7aea62fe
Approximation methods and heuristics in mathematical programming (90C59) Inventory, storage, reservoirs (90B05) Approximation algorithms (68W25)
Related Items (1)
Cites Work
- Unnamed Item
- On complexity of multistage stochastic programs
- Approximation Algorithms for the Stochastic Lot-Sizing Problem with Order Lead Times
- Provably Near-Optimal Balancing Policies for Multi-Echelon Stochastic Inventory Control Models
- Integrating Replenishment Decisions with Advance Demand Information
- A 2-Approximation Algorithm for Stochastic Inventory Control Models with Lost Sales
- Inventory Planning with Forecast Updates: Approximate Solutions and Cost Error Bounds
- A Single-Unit Decomposition Approach to Multiechelon Inventory Systems
- Approximation Algorithms for Capacitated Stochastic Inventory Control Models
- Approximation Algorithms for Stochastic Inventory Control Models
- Optimal Policies for Multiechelon Inventory Problems with Markov-Modulated Demand
- Optimal Policies and Approximations for a Serial Multiechelon Inventory System with Time-Correlated Demand
- The Nonstationary Infinite Horizon Inventory Problem
- Near Myopic Heuristics for the Fixed-Life Perishability Problem
- A Simple Heuristic for Computing Nonstationary (s, S) Policies
- The Finite Horizon Nonstationary Stochastic Inventory Problem: Near-Myopic Bounds, Heuristics, Testing
- The Nonstationary Stochastic Lead-Time Inventory Problem: Near-Myopic Bounds, Heuristics, and Testing
- Myopic Heuristics for the Random Yield Problem
- Inventory Control in a Fluctuating Demand Environment
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Optimal Policy for a Multi-Product, Dynamic, Nonstationary Inventory Problem
- Optimality of Myopic Inventory Policies for Several Substitute Products
- The Near-Myopic Nature of the Lagged-Proportional-Cost Inventory Problem with Lost Sales
This page was built for publication: Approximation Algorithm for the Stochastic Multiperiod Inventory Problem via a Look-Ahead Optimization Approach