1 citations · 1 across the 4 of their papers we have counts for
4 papers · 1 filter
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…
A Context-Aware Cutting Plane Selection Algorithm for Mixed-Integer Programming
Mark Turner, Timo Berthold, Mathieu Besançon
The current cut selection algorithm used in mixed-integer programming solvers has remained largely unchanged since its creation. In this paper, we propose a set of new cut scoring…
Cutting Plane Selection with Analytic Centers and Multiregression
Mark Turner, Timo Berthold, Mathieu Besançon +1
Cutting planes are a crucial component of state-of-the-art mixed-integer programming solvers, with the choice of which subset of cuts to add being vital for solver performance. We…
Experiments with Conflict Analysis in Mixed Integer Programming
Jakob Witzig, Timo Berthold, Stefan Heinz
The analysis of infeasible subproblems plays an import role in solving mixed integer programs (MIPs) and is implemented in most major MIP solvers. There are two fundamentally diffe…