On the complexity of the unit commitment problem
type: Item
instance of: scholarly article
title: On the complexity of the unit commitment problem
zbMATH Open document ID: 1407.90269
author: Pascale Bendotti
author: Pierre Fouilhoux
author: Cécile Rottner
published in: Annals of Operations Research
publication date: 2019-03-06T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C39
zbMATH DE Number: 7032686
zbMATH Keywords: unit commitment problem
zbMATH Keywords: complexity
zbMATH Keywords: dynamic programming
zbMATH Keywords: subproblem of decomposition scheme
MaRDI profile type: Publication
full work available at URL: s10479-018-2827-x
OpenAlex ID: W2795585957
cites work: Short-Term Scheduling of Thermal-Electric Generators Using Lagrangian Relaxation
cites work: The min-up/min-down unit commitment polytope
cites work: Optimization by decomposition and coordination: A unified approach
cites work: A primal-proximal heuristic applied to the French unit-commitment problem
cites work: About Lagrangian methods in integer optimization
cites work: Solving Nonlinear Single-Unit Commitment Problems with Ramping Constraints
cites work: A tight MIP formulation of the unit commitment problem with start-up and shut-down constraints
cites work: The Ramping Polytope and Cut Generation for the Unit Commitment Problem
cites work: Tight MIP formulations of the power-based unit commitment problem
cites work: Q4739657
cites work: Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard
Wikidata QID: Q130018193
DOI: 10.1007/S10479-018-2827-X
description: scientific article; zbMATH DE number 7032686