TY - BOOK
T1 - The SCIP Optimization Suite 7.0
AU - Gamrath, Gerald
AU - Anderson, Daniel
AU - Bestuzheva, Ksenia
AU - Chen, Wei-Kun
AU - Eifler, Leon
AU - Gasse, Maxime
AU - Gemander, Patrick
AU - Gleixner, Ambros
AU - Gottwald, Leona
AU - Halbig, Katrin
AU - Hendel, Gregor
AU - Hojny, Christopher
AU - Koch, Thorsten
AU - Le Bodic, Pierre
AU - Maher, Stephen J.
AU - Matter, Frederic
AU - Miltenberger, Matthias
AU - Mühmer, Erik
AU - Müller, Benjamin
AU - Pfetsch, Marc E.
AU - Schlösser, Franziska
AU - Serrano, Felipe
AU - Shinano, Yuji
AU - Tawfik, Christine
AU - Vigerske, Stefan
AU - Wegscheider, Fabian
AU - Weninger, Dieter
AU - Witzig, Jakob
PY - 2020
Y1 - 2020
N2 - The SCIP Optimization Suite provides a collection of software packages for mathematical optimization centered around the constraint integer programming framework SCIP. This paper discusses enhancements and extensions contained in version 7.0 of the SCIP Optimization Suite. The new version features the parallel presolving library PaPILO as a new addition to the suite. PaPILO 1.0 simplifies mixed-integer linear optimization problems and can be used stand-alone or integrated into SCIP via a presolver plugin. SCIP 7.0 provides additional support for decomposition algorithms. Besides improvements in the Benders’ decomposition solver of SCIP, user-defined decomposition structures can be read, which are used by the automated Benders’ decomposition solver and two primal heuristics. Additionally, SCIP 7.0 comes with a tree size estimation that is used to predict the completion of the overall solving process and potentially trigger restarts. Moreover, substantial performance improvements of the MIP core were achieved by new developments in presolving, primal heuristics, branching rules, conflict analysis, and symmetry handling. Last, not least, the report presents updates to other components and extensions of the SCIP Optimization Suite, in particular, the LP solver SoPlex and the mixed-integer semidefinite programming solver SCIP-SDP.
AB - The SCIP Optimization Suite provides a collection of software packages for mathematical optimization centered around the constraint integer programming framework SCIP. This paper discusses enhancements and extensions contained in version 7.0 of the SCIP Optimization Suite. The new version features the parallel presolving library PaPILO as a new addition to the suite. PaPILO 1.0 simplifies mixed-integer linear optimization problems and can be used stand-alone or integrated into SCIP via a presolver plugin. SCIP 7.0 provides additional support for decomposition algorithms. Besides improvements in the Benders’ decomposition solver of SCIP, user-defined decomposition structures can be read, which are used by the automated Benders’ decomposition solver and two primal heuristics. Additionally, SCIP 7.0 comes with a tree size estimation that is used to predict the completion of the overall solving process and potentially trigger restarts. Moreover, substantial performance improvements of the MIP core were achieved by new developments in presolving, primal heuristics, branching rules, conflict analysis, and symmetry handling. Last, not least, the report presents updates to other components and extensions of the SCIP Optimization Suite, in particular, the LP solver SoPlex and the mixed-integer semidefinite programming solver SCIP-SDP.
KW - Constraint integer programming
KW - linear programming
KW - mixed-integer linear programming
KW - mixed-integer nonlinear programming
KW - optimization solver
KW - branch-and-cut
KW - branch-and-price
KW - column generation
KW - Benders' decomposition
KW - parallelization
KW - mixed-integer semidefinite programming
M3 - Report
T3 - ZIB-Report
BT - The SCIP Optimization Suite 7.0
PB - Zuse Institut Berlin
CY - Berlin
ER -