3 papers
math.OC2026
Tight Formulations for Unit Commitment with Different Levels of Details -- Part I: Models and Theoretical Insights
Maaike B. Elgersma, Karen I. Aardal, Mathijs M. de Weerdt +1
The unit commitment (UC) problem is paramount for optimal operation of power systems, but it faces computational limitations in large-scale settings, especially in investment or st…
cs.AI2024
How To Discover Short, Shorter, and the Shortest Proofs of Unsatisfiability: A Branch-and-Bound Approach for Resolution Proof Length Minimization
Konstantin Sidorov, Koos van der Linden, Gonçalo Homem de Almeida Correia +2
Modern software for propositional satisfiability problems gives a powerful automated reasoning toolkit, capable of outputting not only a satisfiable/unsatisfiable signal but also a…
math.OC2024
Tight MIP Formulations for Optimal Operation and Investment of Storage Including Reserves
Maaike B. Elgersma, Germán Morales-España, Karen I. Aardal +3
Fast and accurate large-scale energy system models are needed to investigate the potential of storage to complement the fluctuating energy production of renewable energy systems. H…