5 papers
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…
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…
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…
To the Max: Reinventing Reward in Reinforcement Learning
Grigorii Veviurko, Wendelin Böhmer, Mathijs de Weerdt
In reinforcement learning (RL), different reward functions can define the same optimal policy but result in drastically different learning performance. For some, the agent gets stu…
Learning From Scenarios for Stochastic Repairable Scheduling
Kim van den Houten, David M. J. Tax, Esteban Freydell +1
When optimizing problems with uncertain parameter values in a linear objective, decision-focused learning enables end-to-end learning of these values. We are interested in a stocha…