The Ramping Polytope and Cut Generation for the Unit Commitment Problem

From MaRDI portal
Publication:5137957

DOI10.1287/ijoc.2017.0802zbMath1448.90042OpenAlexW2902351935WikidataQ128864463 ScholiaQ128864463MaRDI QIDQ5137957

Ben Knueven, Jim Ostrowski, Jianhui Wang

Publication date: 3 December 2020

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/ec744ceab2e9e11c9450f12225b4d136edb82bfd




Related Items (8)



Cites Work


This page was built for publication: The Ramping Polytope and Cut Generation for the Unit Commitment Problem