Combining Polyhedral Approaches and Stochastic Dual Dynamic Integer Programming for Solving the Uncapacitated Lot-Sizing Problem Under Uncertainty
From MaRDI portal
Publication:5086004
DOI10.1287/ijoc.2021.1118OpenAlexW3118085990MaRDI QIDQ5086004
Franco Quezada, Safia Kedad-Sidhoum, Celine Gicquel
Publication date: 30 June 2022
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2021.1118
multistage stochastic programmingvalid inequalitiesstochastic lot sizingstochastic dual dynamic integer programmingpartial decompositionnode aggregation
Related Items
Cites Work
- Unnamed Item
- Dynamic sampling algorithms for multi-stage stochastic programs with risk aversion
- On parallelization of a stochastic dynamic programming algorithm for solving large-scale mixed \(0-1\) problems under uncertainty
- Lot-sizing on a tree
- On stochastic dynamic programming for solving large-scale planning problems under uncertainty
- Multi-stage stochastic optimization applied to energy planning
- A multi-stage stochastic integer programming approach for capacity expansion under uncertainty
- Single-item dynamic lot-sizing problems: an updated survey
- An effective two-stage stochastic multi-trip location-transportation model with social concerns in relief supply chains
- Heuristic policies for the stochastic economic lot sizing problem with remanufacturing under service level constraints
- On the time-consistent stochastic dominance risk averse measure for tactical supply chain planning under uncertainty
- Extended formulations for stochastic lot-sizing problems
- Risk neutral and risk averse stochastic dual dynamic programming method
- HOPS -- Hamming-Oriented Partition Search for production planning in the spinning industry
- Stochastic dual dynamic integer programming
- A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem
- Dynamic Version of the Economic Lot Size Model
- A Fully Polynomial-Time Approximation Scheme for Single-Item Stochastic Inventory Control with Discrete Demand
- Polynomial-Time Algorithms for Stochastic Uncapacitated Lot-Sizing Problems
- Strong Formulations for Multi-Item Capacitated Lot Sizing
- Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case
- Improved Algorithms for Economic Lot Size Problems
- Cutting Planes for Multistage Stochastic Integer Programs
- Production Planning by Mixed Integer Programming
