67 citations · 68 across the 4 of their papers we have counts for
4 papers
Learning Cuts via Enumeration Oracles
Daniel Thuerck, Boro Sofranac, Marc E. Pfetsch +1
Cutting-planes are one of the most important building blocks for solving large-scale integer programming (IP) problems to (near) optimality. The majority of cutting plane approache…
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…
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…
Accelerating Domain Propagation: an Efficient GPU-Parallel Algorithm over Sparse Matrices
Boro Sofranac, Ambros Gleixner, Sebastian Pokutta
Fast domain propagation of linear constraints has become a crucial component of today's best algorithms and solvers for mixed integer programming and pseudo-boolean optimization to…