An enhanced L-shaped method for optimizing periodic-review inventory control problems modeled via two-stage stochastic programming
From MaRDI portal
Publication:1713765
DOI10.1016/j.ejor.2018.11.053zbMath1430.90034OpenAlexW2902958550WikidataQ128897731 ScholiaQ128897731MaRDI QIDQ1713765
Publication date: 28 January 2019
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://aaltodoc.aalto.fi/handle/123456789/41976
Applications of mathematical programming (90C90) Stochastic network models in operations research (90B15) Inventory, storage, reservoirs (90B05)
Related Items
A stochastic programming model with endogenous and exogenous uncertainty for reliable network design under random disruption ⋮ Stochastic dynamic programming heuristic for the \((R,s,S)\) policy parameters computation ⋮ A study on the optimal inventory allocation for clinical trial supply chains ⋮ Long-term resource planning in the high-tech industry: capacity or inventory? ⋮ Computing optimal \((R, s, S)\) policy parameters by a hybrid of branch-and-bound and stochastic dynamic programming ⋮ Optimal policy for multi-item systems with stochastic demands, backlogged shortages and limited storage capacity
Cites Work
- Unnamed Item
- Unnamed Item
- A multicut L-shaped based algorithm to solve a stochastic programming model for the mobile facility routing and scheduling problem
- Accelerating Benders decomposition for closed-loop supply chain network design: case of used durable products with different quality levels
- A branch-and-Benders-cut method for nonlinear power design in green wireless local area networks
- On exact solutions for the minmax regret spanning tree problem
- Accelerating Benders stochastic decomposition for the optimization under uncertainty of the petroleum product supply chain
- Large-scale mixed integer programming: Benders-type heuristics
- Scheduling and routing of automated guided vehicles: A hybrid approach
- The deterministic EOQ with partial backordering: A new approach
- Practical enhancements to the Magnanti-Wong method
- A multicut algorithm for two-stage stochastic linear programs
- Partitioning procedures for solving mixed-variables programming problems
- Optimal production and procurement decisions in a supply chain with an option contract and partial backordering under uncertainties
- A survey on Benders decomposition applied to fixed-charge network design problems
- A computational study of Benders decomposition for the integrated aircraft routing and crew scheduling problem
- Decomposition algorithms for stochastic programming on a computational grid
- A partial backorder control for continuous review \((r,Q)\) inventory system with Poisson demand and constant lead time
- Dynamic sequencing and cut consolidation for the parallel hybrid-cut nested L-shaped method
- A two-level supply chain with partial backordering and approximated Poisson demand
- An interior-point Benders based branch-and-cut algorithm for mixed integer programs
- On generating maximal nondominated Benders cuts
- An improved Benders decomposition algorithm for the logistics facility location problem with capacity expansions
- Accelerating Benders Decomposition by Local Branching
- Accelerating Benders method using covering cut bundle generation
- Operating Characteristics of the (S − 1, S) Inventory System with Partial Backorders and Constant Resupply Times
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- The (S − 1, S) Inventory Model under Time Limit on Backorders
- Introduction to Stochastic Programming
- Benders Decomposition for Simultaneous Aircraft Routing and Crew Scheduling
- Inexact Cuts in Benders Decomposition
- L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
- A class of inventory models with customer impatience
- A dynamic two-segment partial backorder control of \((r,Q)\) inventory system
