The min-up/min-down unit commitment polytope
type: Item
instance of: scholarly article
title: The min-up/min-down unit commitment polytope
zbMATH Open document ID: 1414.90141
author: Pascale Bendotti
author: Pierre Fouilhoux
author: Cécile Rottner
published in: Journal of Combinatorial Optimization
publication date: 2018-12-06T00:00:00Z
Mathematics Subject Classification ID: 90B30
Mathematics Subject Classification ID: 90B25
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 6990041
zbMATH Keywords: unit commitment problem (UCP)
zbMATH Keywords: min-up/min-down
zbMATH Keywords: polytope
zbMATH Keywords: facet
zbMATH Keywords: branch and cut
MaRDI profile type: Publication
full work available at URL: s10878-018-0273-y
OpenAlex ID: W2794366327
cites work: Facets of the knapsack polytope
cites work: Optimization by decomposition and coordination: A unified approach
cites work: About Lagrangian methods in integer optimization
cites work: A tight MIP formulation of the unit commitment problem with start-up and shut-down constraints
cites work: Separation algorithms for 0-1 knapsack polytopes
cites work: Min-up/min-down polytopes
cites work: Tight MIP formulations of the power-based unit commitment problem
cites work: Modified orbital branching for structured symmetry with an application to unit commitment
cites work: Large-scale unit commitment under uncertainty
Wikidata QID: Q130129293
DOI: 10.1007/S10878-018-0273-Y
description: scientific article; zbMATH DE number 6990041