On the complexity of the unit commitment problem

DOI10.1007/s10479-018-2827-xzbMath1407.90269OpenAlexW2795585957WikidataQ130018193 ScholiaQ130018193MaRDI QIDQ1730706

Pascale Bendotti, Pierre Fouilhoux, Cécile Rottner

Publication date: 6 March 2019

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-018-2827-x

zbMATH Keywords

complexitydynamic programmingunit commitment problemsubproblem of decomposition scheme

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Dynamic programming (90C39)

Related Items (3)

A long-term unit commitment problem with hydrothermal coordination for economic and emission control in large-scale electricity systems ⋮ Symmetry-breaking inequalities for ILP with structured sub-symmetry ⋮ Orbitopal fixing for the full (sub-)orbitope and application to the unit commitment problem

Cites Work

• Unnamed Item
• Tight MIP formulations of the power-based unit commitment problem
• About Lagrangian methods in integer optimization
• The min-up/min-down unit commitment polytope
• A tight MIP formulation of the unit commitment problem with start-up and shut-down constraints
• Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard
• A primal-proximal heuristic applied to the French unit-commitment problem
• Solving Nonlinear Single-Unit Commitment Problems with Ramping Constraints
• Short-Term Scheduling of Thermal-Electric Generators Using Lagrangian Relaxation
• Optimization by decomposition and coordination: A unified approach
• The Ramping Polytope and Cut Generation for the Unit Commitment Problem

This page was built for publication: On the complexity of the unit commitment problem