1 citations · 1 across the 9 of their papers we have counts for
7 papers · 1 filter
The SCIP Optimization Suite 10.0
Christopher Hojny, Mathieu Besançon, Ksenia Bestuzheva +31
The SCIP Optimization Suite provides a collection of software packages for mathematical optimization, centered around the constraint integer programming (CIP) framework SCIP. This…
Branch and price for nonlinear production-maintenance scheduling in complex machinery
João Dionísio, Ambros Gleixner, João Pedro Pedroso +1
This paper proposes a mixed-integer nonlinear programming approach for joint scheduling of long-term maintenance decisions and short-term production for groups of complex machines…
Sparsity-driven Aggregation of Mixed Integer Programs
Liding Xu, Gioni Mexi, Ksenia Bestuzheva
Cutting planes are crucial for the performance of branch-and-cut algorithms for solving mixed-integer programming (MIP) problems, and linear row aggregation has been successfully a…
State-of-the-art Methods for Pseudo-Boolean Solving with SCIP
Gioni Mexi, Dominik Kamp, Yuji Shinano +8
The Pseudo-Boolean problem deals with linear or polynomial constraints with integer coefficients over Boolean variables. The objective lies in optimizing a linear objective functio…
Strengthening SONC Relaxations with Constraints Derived from Variable Bounds
Ksenia Bestuzheva, Ambros Gleixner, Helena Völker
Certificates of polynomial nonnegativity can be used to obtain tight dual bounds for polynomial optimization problems. We consider Sums of Nonnegative Circuit (SONC) polynomials ce…
A Computational Study of Perspective Cuts
Ksenia Bestuzheva, Ambros Gleixner, Stefan Vigerske
The benefits of cutting planes based on the perspective function are well known for many specific classes of mixed-integer nonlinear programs with on/off structures. However, we ar…