The SCIP Optimization Suite provides a collection of software packages for mathematical
optimization, centered around the constraint integer programming (CIP) framework SCIP …

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 …

In the last couple of decades, developments in SAT-based optimization have led to highly
efficient maximum satisfiability (MaxSAT) solvers, but in contrast to the SAT solvers on which …

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 …

Satisfiability (SAT) solvers have been using the same input format for decades: a formula in
conjunctive normal form. Cardinality constraints appear frequently in problem descriptions …

The dramatic improvements in combinatorial optimization algorithms over the last decades
have had a major impact in artificial intelligence, operations research, and beyond, but the …

While certification has been successful in the context of satisfiablity solving, with most state-
of-the-art solvers now able to provide proofs of unsatisfiability, in maximum satisfiability …

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 must …

In this study we continue the success story of fuzz testing automated reasoning tools by
providing the first extensive fuzzing study on MaxSAT solvers. As somewhat expected we …

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 …