The SCIP Optimization Suite provides a collection of software packages for mathematical
optimization centered around the constraint integer programming frame-work SCIP. This …

The maximal covering location problem (MCLP) and the partial set covering location
problem (PSCLP) are two fundamental problems in facility location and have widespread …

Large-scale LP problems from industry usually contain much redundancy that severely hurts
the efficiency and reliability of solving LPs, making presolve (ie, the problem simplification …

Presolving has become an essential component of modern mixed integer program (MIP)
solvers, both in terms of computational performance and numerical robustness. In this paper …

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 …

This paper provides a discussion and evaluation of presolving methods for mixed-integer
semidefinite programs. We generalize methods from the mixed-integer linear case and …

We introduce a calculus for incremental pre-processing for SMT and instantiate it in the
context of z3. It identifies when powerful formula simplifications can be retained when …

Presolving is a critical component in modern mixed integer programming (MIP) solvers. In
this paper, we propose a new and effective presolving method named inequation-based …

Linear bilevel optimization problems are known to be strongly NP-hard and the
computational techniques to solve these problems are often motivated by techniques from …

Proof-based learning is learning mathematics through proof and proving to strengthen
students' concepts. The use of APOS theory (Action, Process, Object, and Schema) aims to …