Combining Polyhedral Approaches and Stochastic Dual Dynamic Integer Programming for Solving the Uncapacitated Lot-Sizing Problem Under Uncertainty
DOI10.1287/IJOC.2021.1118OpenAlexW3118085990MaRDI QIDQ5086004FDOQ5086004
Authors: Franco Quezada, C. Gicquel, S. Kedad-Sidhoum 
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
Recommendations
- A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem
- Stochastic Dual Dynamic Programming for Multiechelon Lot Sizing with Component Substitution
- An extended mixed-integer programming formulation and dynamic cut generation approach for the stochastic lot-sizing problem
- Polynomial-Time Algorithms for Stochastic Uncapacitated Lot-Sizing Problems
- Two-stage stochastic lot-sizing problem under cost uncertainty
valid inequalitiesmultistage stochastic programmingstochastic lot sizingstochastic dual dynamic integer programmingpartial decompositionnode aggregation
Cites Work
- Production Planning by Mixed Integer Programming
- Multi-stage stochastic optimization applied to energy planning
- Risk neutral and risk averse stochastic dual dynamic programming method
- Dynamic sampling algorithms for multi-stage stochastic programs with risk aversion
- Dynamic version of the economic lot size model
- A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem
- Cutting planes for multistage stochastic integer programs
- On stochastic dynamic programming for solving large-scale planning problems under uncertainty
- A multi-stage stochastic integer programming approach for capacity expansion under uncertainty
- 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
- Title not available (Why is that?)
- A fully polynomial-time approximation scheme for single-item stochastic inventory control with discrete demand
- Strong Formulations for Multi-Item Capacitated Lot Sizing
- Heuristic policies for the stochastic economic lot sizing problem with remanufacturing under service level constraints
- HOPS -- Hamming-Oriented Partition Search for production planning in the spinning industry
- Extended formulations for stochastic lot-sizing problems
- Polynomial-Time Algorithms for Stochastic Uncapacitated Lot-Sizing Problems
- Lot-sizing on a tree
- An effective two-stage stochastic multi-trip location-transportation model with social concerns in relief supply chains
- On the time-consistent stochastic dominance risk averse measure for tactical supply chain planning under uncertainty
- Stochastic dual dynamic integer programming
- Single-item dynamic lot-sizing problems: an updated survey
- On parallelization of a stochastic dynamic programming algorithm for solving large-scale mixed \(0-1\) problems under uncertainty
Cited In (3)
This page was built for publication: Combining Polyhedral Approaches and Stochastic Dual Dynamic Integer Programming for Solving the Uncapacitated Lot-Sizing Problem Under Uncertainty
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5086004)
