The SCIP optimization suite 8.0
K Bestuzheva, M Besançon, WK Chen… - arxiv preprint arxiv …, 2021 - arxiv.org
The SCIP Optimization Suite provides a collection of software packages for mathematical
optimization centered around the constraint integer programming framework SCIP. This …
optimization centered around the constraint integer programming framework SCIP. This …
Large-scale unit commitment under uncertainty: an updated literature survey
W Van Ackooij, I Danti Lopez, A Frangioni… - Annals of Operations …, 2018 - Springer
Abstract The Unit Commitment problem in energy management aims at finding the optimal
production schedule of a set of generation units, while meeting various system-wide …
production schedule of a set of generation units, while meeting various system-wide …
The SCIP optimization suite 9.0
S Bolusani, M Besançon, K Bestuzheva… - arxiv preprint arxiv …, 2024 - arxiv.org
The SCIP Optimization Suite provides a collection of software packages for mathematical
optimization, centered around the constraint integer programming (CIP) framework SCIP …
optimization, centered around the constraint integer programming (CIP) framework SCIP …
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 …
A unified framework for symmetry handling
J van Doornmalen, C Hojny - Mathematical Programming, 2024 - Springer
Handling symmetries in optimization problems is essential for devising efficient solution
methods. In this article, we present a general framework that captures many of the already …
methods. In this article, we present a general framework that captures many of the already …
Efficient MIP techniques for computing the relaxation complexity
G Averkov, C Hojny, M Schymura - Mathematical Programming …, 2023 - Springer
The relaxation complexity rc (X) of the set of integer points X contained in a polyhedron is
the minimal number of inequalities needed to formulate a linear optimization problem over X …
the minimal number of inequalities needed to formulate a linear optimization problem over X …
Efficient propagation techniques for handling cyclic symmetries in binary programs
J van Doornmalen, C Hojny - INFORMS Journal on …, 2024 - pubsonline.informs.org
The presence of symmetries in binary programs typically degrades the performance of
branch-and-bound solvers. In this article, we derive efficient variable fixing algorithms to …
branch-and-bound solvers. In this article, we derive efficient variable fixing algorithms to …
State-of-the-art Methods for Pseudo-Boolean Solving with SCIP
The Pseudo-Boolean problem deals with linear or polynomial constraints with integer
coefficients over Boolean variables. The objective lies in optimizing a linear objective …
coefficients over Boolean variables. The objective lies in optimizing a linear objective …
Detecting and Handling Reflection Symmetries in Mixed-Integer (Nonlinear) Programming
C Hojny - arxiv preprint arxiv:2405.08379, 2024 - arxiv.org
Symmetries in mixed-integer (nonlinear) programs (MINLP), if not handled appropriately, are
known to negatively impact the performance of (spatial) branch-and-bound algorithms …
known to negatively impact the performance of (spatial) branch-and-bound algorithms …
Symmetry-breaking inequalities for ILP with structured sub-symmetry
We consider integer linear programs whose solutions are binary matrices and whose (sub-)
symmetry groups are symmetric groups acting on (sub-) columns. Such structured sub …
symmetry groups are symmetric groups acting on (sub-) columns. Such structured sub …