分野別セミナー

General-purpose solvers that address large and heterogeneous problem classes like mixed-integer nonlinear programming (MINLP) necessarily combine a variety of algorithmic techniques in their solution process. In this talk, we present recent advances in the constraint integer programming-based MINLP solver SCIP with a special focus on analyzing the computational impact of individual solver components such as branching strategies, separation routines, bound tightening techniques, and primal heuristics. We propose the use of so-called filtered performance diagrams in order to exhibit average performance impact not only on the overall collection of a set of benchmark instances, but also on subsets of instances of increasing hardness.