3 papers
cs.AI2024
Certified MaxSAT Preprocessing
Hannes Ihalainen, Andy Oertel, Yong Kiam Tan +3
Building on the progress in Boolean satisfiability (SAT) solving over the last decades, maximum satisfiability (MaxSAT) has become a viable approach for solving NP-hard optimizatio…
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.NA2021
Fast ultrametric matrix-vector multiplication
Tobias Hofmann, Andy Oertel
We study the properties of ultrametric matrices aiming to design methods for fast ultrametric matrix-vector multiplication. We show how to encode such a matrix as a tree structure…