The ramping polytope and cut generation for the unit commitment problem
Year of publication: |
2018
|
---|---|
Authors: | Knueven, Ben ; Ostrowski, Jim ; Wang, Jianhui |
Published in: |
INFORMS journal on computing : JOC. - Catonsville, MD : INFORMS, ISSN 1091-9856, ZDB-ID 1316077-1. - Vol. 30.2018, 4, p. 739-749
|
Subject: | unit commitment | cut generation | extended formulations |
-
Two-level decomposition algorithm for crew rostering problems with fair working condition
Nishi, Tatsushi, (2014)
-
Modeling defender-attacker problems as robust linear programs with mixed-integer uncertainty sets
Borrero, Juan S., (2021)
-
Aircraft routing and crew pairing : updated algorithms at Air France
Parmentier, Axel, (2020)
- More ...
-
Practice summary : improved reliability via optimization in residential microgrids
McIlvenna, Amelia, (2020)
-
Wang, Jianhui, (2010)
-
Wang, Jianhui, (2011)
- More ...