1 citations · 1 across the 3 of their papers we have counts for
3 papers
math.OC2019
A Status Report on Conflict Analysis in Mixed Integer Nonlinear Programming
Jakob Witzig, Timo Berthold, Stefan Heinz
Mixed integer nonlinear programs (MINLPs) are arguably among the hardest optimization problems, with a wide range of applications. MINLP solvers that are based on linear relaxation…
math.OC2019
Local Rapid Learning for Integer Programs
Timo Berthold, Peter J. Stuckey, Jakob Witzig
Conflict learning algorithms are an important component of modern MIP and CP solvers. But strong conflict information is typically gained by depth-first search. While this is the n…
math.OC2016★ 1 cited
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…