Stronger cuts for Benders’ decomposition for stochastic Unit Commitment Problems based on interval variables
- 29 July 2026
- journal article
- research article
- Published by Springer Nature in Mathematical Programming Computation
- p. 1-40
Abstract
No abstract availableKeywords
This publication has 31 references indexed in Scilit:
- Methods of Nonsmooth Optimization in Stochastic Programming2025
- A novel matching formulation for startup costs in unit commitmentMathematical Programming Computation, 2020
- Large-scale unit commitment under uncertainty: an updated literature surveyAnnals of Operations Research, 2018
- Obtaining lower bounds from the progressive hedging algorithm for stochastic mixed-integer programsMathematical Programming, 2016
- Decomposition algorithm for large-scale two-stage unit-commitmentAnnals of Operations Research, 2015
- A decomposition approach to the two-stage stochastic unit commitment problemAnnals of Operations Research, 2012
- A primal-proximal heuristic applied to the French Unit-commitment problemMathematical Programming, 2005
- Benchmarking optimization software with performance profilesMathematical Programming, 2002
- A geometric study of duality gaps, with applicationsMathematical Programming, 2001
- Lagrangean relaxation for integer programming1974