14 citations · 22 across the 9 of their papers we have counts for
14 papers
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…
The Machine Learning for Combinatorial Optimization Competition (ML4CO): Results and Insights
Maxime Gasse, Quentin Cappart, Jonas Charfreitag +38
Combinatorial optimization is a well-established area in operations research and computer science. Until recently, its methods have focused on solving problem instances in isolatio…
An Algorithm-Independent Measure of Progress for Linear Constraint Propagation
Boro Sofranac, Ambros Gleixner, Sebastian Pokutta
Propagation of linear constraints has become a crucial sub-routine in modern Mixed-Integer Programming (MIP) solvers. In practice, iterative algorithms with tolerance-based stoppin…
Learning to Schedule Heuristics in Branch-and-Bound
Antonia Chmiela, Elias B. Khalil, Ambros Gleixner +2
Primal heuristics play a crucial role in exact solvers for Mixed Integer Programming (MIP). While solvers are guaranteed to find optimal solutions given sufficient time, real-world…
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…
A Computational Status Update for Exact Rational Mixed Integer Programming
Leon Eifler, Ambros Gleixner
The last milestone achievement for the roundoff-error-free solution of general mixed integer programs over the rational numbers was a hybrid-precision branch-and-bound algorithm pu…