Adaptive cut selection in mixed-integer linear programming
Cutting plane selection is a subroutine used in all modern mixed-integer linear programming
solvers with the goal of selecting a subset of generated cuts that induce optimal solver …
solvers with the goal of selecting a subset of generated cuts that induce optimal solver …
The branch-and-bound algorithm in optimizing mathematical programming models to achieve power grid observability
Phasor Measurement Units (PMUs) are the backbone of smart grids that are able to
measure power system observability in real-time. The deployment of synchronized sensors …
measure power system observability in real-time. The deployment of synchronized sensors …
Dynamic optimization on quantum hardware: Feasibility for a process industry use case
The quest for real-time dynamic optimization solutions in the process industry represents a
formidable computational challenge, particularly within the realm of applications like model …
formidable computational challenge, particularly within the realm of applications like model …
[PDF][PDF] Signal temporal logic control synthesis among uncontrollable dynamic agents with conformal prediction
The control of dynamical systems under temporal logic specifications among uncontrollable
dynamic agents is challenging due to the agents'a-priori unknown behavior. Existing works …
dynamic agents is challenging due to the agents'a-priori unknown behavior. Existing works …
PySCIPOpt-ML: Embedding trained machine learning models into mixed-integer programs
A standard tool for modelling real-world optimisation problems is mixed-integer
programming (MIP). However, for many of these problems there is either incomplete …
programming (MIP). However, for many of these problems there is either incomplete …
The mip workshop 2023 computational competition on reoptimization
This paper describes the computational challenge developed for a computational
competition held in 2023 for the 20 th anniversary of the Mixed Integer Programming …
competition held in 2023 for the 20 th anniversary of the Mixed Integer Programming …
A proof system for certifying symmetry and optimality reasoning in integer programming
J van Doornmalen, L Eifler, A Gleixner… - arXiv preprint arXiv …, 2023 - arxiv.org
We present a proof system for establishing the correctness of results produced by
optimization algorithms, with a focus on mixed-integer programming (MIP). Our system …
optimization algorithms, with a focus on mixed-integer programming (MIP). Our system …
Verifying message-passing neural networks via topology-based bounds tightening
Since graph neural networks (GNNs) are often vulnerable to attack, we need to know when
we can trust them. We develop a computationally effective approach towards providing …
we can trust them. We develop a computationally effective approach towards providing …
Branching via cutting plane selection: Improving hybrid branching
Cutting planes and branching are two of the most important algorithms for solving mixed-
integer linear programs. For both algorithms, disjunctions play an important role, being used …
integer linear programs. For both algorithms, disjunctions play an important role, being used …
Optimal Power Flow Management for a Solar PV-Powered Soldier-Level Pico-Grid
Users ought to decide how to operate and manage power systems in order to achieve
various goals. As a result, many strategies have been developed to aid in this regard …
various goals. As a result, many strategies have been developed to aid in this regard …