3 papers
math.OC2019
Conflict-Driven Heuristics for Mixed Integer Programming
Jakob Witzig, Ambros Gleixner
Two essential ingredients of modern mixed-integer programming (MIP) solvers are diving heuristics that simulate a partial depth-first search in a branch-and-bound search tree and c…
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…