TY - BOOK
T1 - The SCIP optimization suite 5.0
AU - Gleixner, Ambros
AU - Eiffler, Leon
AU - Gally, Tristan
AU - Gamrath, Gerald
AU - Gemander, Patrick
AU - Gottwald, Robert Lion
AU - Hendel, Gregor
AU - Hojny, Christopher
AU - Koch, Thorsten
AU - Miltenberger, Matthias
AU - Müller, Benjamin
AU - Pfetsch, Marc E.
AU - Puchert, Christian
AU - Rehfeldt, Daniel
AU - Schlösser, Franziska
AU - Serrano, Felipe
AU - Shinano, Zuji
AU - Viernickel, Jan Merlin
AU - Vigerske, Stefan
AU - Weninger, Dieter
AU - Witt, Jonas T.
AU - Witzig, Jakob
PY - 2017
Y1 - 2017
N2 - This article describes new features and enhanced algorithms made available in version 5.0 of the SCIP Optimization Suite. In its central component, the constraint integer programming solver SCIP, remarkable performance improvements have been achieved for solving mixed-integer linear and nonlinear programs. On MIPs, SCIP 5.0 is about 41 % faster than SCIP 4.0 and over twice as fast on instances that take at least 100 seconds to solve. For MINLP, SCIP 5.0 is about 17 % faster overall and 23 % faster on instances that take at least 100 seconds to solve. This boost is due to algorithmic advances in several parts of the solver such as cutting plane generation and management, a new adaptive coordination of large neighborhood search heuristics, symmetry handling, and strengthened McCormick relaxations for bilinear terms in MINLPs. Besides discussing the theoretical background and the implementational aspects of these developments, the report describes recent additions for the other software packages connected to SCIP, in particular for the LP solver SoPlex, the Steiner tree solver SCIP-Jack, the MISDP solver SCIP-SDP, and the parallelization framework UG.
AB - This article describes new features and enhanced algorithms made available in version 5.0 of the SCIP Optimization Suite. In its central component, the constraint integer programming solver SCIP, remarkable performance improvements have been achieved for solving mixed-integer linear and nonlinear programs. On MIPs, SCIP 5.0 is about 41 % faster than SCIP 4.0 and over twice as fast on instances that take at least 100 seconds to solve. For MINLP, SCIP 5.0 is about 17 % faster overall and 23 % faster on instances that take at least 100 seconds to solve. This boost is due to algorithmic advances in several parts of the solver such as cutting plane generation and management, a new adaptive coordination of large neighborhood search heuristics, symmetry handling, and strengthened McCormick relaxations for bilinear terms in MINLPs. Besides discussing the theoretical background and the implementational aspects of these developments, the report describes recent additions for the other software packages connected to SCIP, in particular for the LP solver SoPlex, the Steiner tree solver SCIP-Jack, the MISDP solver SCIP-SDP, and the parallelization framework UG.
M3 - Report
BT - The SCIP optimization suite 5.0
ER -