67 citations · 70 across the 12 of their papers we have counts for
13 papers
Bounding the Null Space: Interval-Based Uncertainty Quantification for Non-Identifiable Groundwater Models
Maximilian Ramgraber, Ksenia Bestuzheva
Groundwater models are routinely non-identifiable: sparse subsurface observations leave many combinations of parameters, states, and boundary conditions equally consistent with the…
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…
The SCIP Optimization Suite 9.0
Suresh Bolusani, Mathieu Besançon, Ksenia Bestuzheva +28
The SCIP Optimization Suite provides a collection of software packages for mathematical optimization, centered around the constraint integer programming (CIP) framework SCIP. This…
Strengthening SONC Relaxations with Constraints Derived from Variable Bounds
Ksenia Bestuzheva, Helena Völker, Ambros Gleixner
Nonnegativity certificates can be used to obtain tight dual bounds for polynomial optimization problems. Hierarchies of certificate-based relaxations ensure convergence to the glob…
Enabling Research through the SCIP Optimization Suite 8.0
Ksenia Bestuzheva, Mathieu Besançon, Wei-Kun Chen +32
The SCIP Optimization Suite provides a collection of software packages for mathematical optimization centered around the constraint integer programming framework SCIP. The focus of…
Global Optimization of Mixed-Integer Nonlinear Programs with SCIP 8
Ksenia Bestuzheva, Antonia Chmiela, Benjamin Müller +3
For over ten years, the constraint integer programming framework SCIP has been extended by capabilities for the solution of convex and nonconvex mixed-integer nonlinear programs (M…
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…
Efficient Separation of RLT Cuts for Implicit and Explicit Bilinear Terms
Ksenia Bestuzheva, Ambros Gleixner, Tobias Achterberg
The reformulation-linearization technique (RLT) is a prominent approach to constructing tight linear relaxations of non-convex continuous and mixed-integer optimization problems. T…
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…
Invex Optimization Revisited
Ksenia Bestuzheva, Hassan Hijazi
Given a non-convex optimization problem, we study conditions under which every Karush-Kuhn-Tucker (KKT) point is a global optimizer. This property is known as KT-invexity and allow…