15 citations · 15 across the 4 of their papers we have counts for
Showing math.OCShow all
2 papers · 1 filter
math.OC2024
Certifying MIP-based Presolve Reductions for 0-1 Integer Linear Programs
Alexander Hoen, Andy Oertel, Ambros Gleixner +1
It is well known that reformulating the original problem can be crucial for the performance of mixed-integer programming (MIP) solvers. To ensure correctness, all transformations m…
math.OC2023
Improving Conflict Analysis in MIP Solvers by Pseudo-Boolean Reasoning
Gioni Mexi, Timo Berthold, Ambros Gleixner +1
Conflict analysis has been successfully generalized from Boolean satisfiability (SAT) solving to mixed integer programming (MIP) solvers, but although MIP solvers operate with gene…