15 citations · 15 across the 4 of their papers we have counts for
4 papers
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…
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…
Certifying Parity Reasoning Efficiently Using Pseudo-Boolean Proofs
Stephan Gocht, Jakob Nordström
The dramatic improvements in combinatorial optimization algorithms over the last decades have had a major impact in artificial intelligence, operations research, and beyond, but th…
Certified Symmetry and Dominance Breaking for Combinatorial Optimisation
Bart Bogaerts, Stephan Gocht, Ciaran McCreesh +1
Symmetry and dominance breaking can be crucial for solving hard combinatorial search and optimisation problems, but the correctness of these techniques sometimes relies on subtle a…