Christian Puchert

TL;DR: The SCIP Optimization Suite 5.0 as discussed by the authors is the latest version of the constraint integer programming solver SCIP for solving mixed-integer linear and nonlinear programs, and it is about 41 % faster than SCIP 4.0 and over twice as fast on instances that take at least 100 seconds to solve.

TL;DR: The SCIP Optimization Suite as discussed by the authors provides a collection of software packages for mathematical optimization centered around the constraint integer programming framework SCIP, which includes the MIP and MINLP core with new primal heuristics and a new selection criterion for cutting planes.

TL;DR: This paper highlights the new features of version 3.2 of the SCIP Optimization Suite and presents new and improved extensions of SCIP, namely solvers for multi-criteria optimization, Steiner tree problems, and mixed-integer semidefinite programs.

TL;DR: The SCIP Optimization Suite as mentioned in this paper is a collection of optimization software that consists of the branch-cut-and-price framework and mixed-integer programming solver SCIP, the Linear Programming solver SoPlex, the modeling language Zimpl, the parallelization framework UG, and the generic GCG.

TL;DR: Several primal heuristics are implemented in the branch-and-price solver GCG based on the SCIP framework that make use of the reformulation yielded by the Dantzig-Wolfe decomposition.