Zuse Institute Berlin

<h2 id="scip-optimization-software">SCIP (optimization software)</h2>

<p>SCIP (Solving Constraint Integer Programs) is a <a href="/facts/Mixed_integer_programming/GduXFQxT">mixed integer programming</a> solver and a framework for <a href="/facts/Branch_and_cut/YJ07W6eP">branch and cut</a> and <a href="/facts/Branch_and_price/xYmlMUYQ">branch and price</a>, developed primarily at Zuse Institute Berlin. Unlike most commercial solvers, SCIP gives the user low-level control of and information about the solving process. Run as a standalone solver, it is one of the fastest non-commercial solvers for mixed integer programs.<a class="footnote-ref" id="fnref:1" href="#fn:1"><sup>1</sup></a>
</p><p>SCIP is implemented as <a href="/facts/C_(programming_language)/Ky2No763">C</a> <a href="/facts/Library_(computing)/xRzL3P7q">callable library</a>.
For user <a href="/facts/Plug-in_(computing)/351Du3Wu">plugins</a>, <a href="/facts/C%252B%252B/Et0F2qn9">C++</a> wrapper classes are provided.
The solver for the LP relaxations is not a native component of SCIP, an open LP interface is provided instead.
Currently supported LP solvers are <a href="/facts/COIN-OR/we1fYPNj">CLP</a>, <a href="/facts/CPLEX/SnfwWLtb">CPLEX</a>, <a href="/facts/MOSEK/zfmWsyqy">MOSEK</a>, SoPlex, and <a href="/facts/FICO_Xpress/mEFKqwEG">Xpress</a>.
SCIP can be run on <a href="/facts/Linux/9FvCKSTq">Linux</a>, <a href="/facts/Mac_OS/EkobAhow">Mac</a>, <a href="/facts/SunOS/oWMcGLqc">Sun</a>, and <a href="/facts/Windows/bwhAhuSL">Windows</a> operating systems.
</p><p>Prior versions of SCIP were distributed under a source-available license that allowed free academic use. Starting from version 8.0.3 the full suite was released under the <a href="/facts/Apache_License/5AeIjas8">Apache 2.0</a> license.<a class="footnote-ref" id="fnref:2" href="#fn:2"><sup>2</sup></a>
</p>
<h3>Features</h3>
<p>The design of SCIP is based on the notion of <a href="/facts/Constraint_programming/rgkCK5bD">constraints</a>. It supports about 20 constraint types for mixed-integer linear programming, mixed-integer nonlinear programming, mixed-integer all-quadratic programming and Pseudo-Boolean<a class="footnote-ref" id="fnref:3" href="#fn:3"><sup>3</sup></a> optimization. It can also solve <a href="/facts/Steiner_Trees/5mhCq8cN">Steiner Trees</a> and <a href="/facts/Multi-objective_optimization/1Hb4gjGJ">multi-objective optimization</a> problems.<a class="footnote-ref" id="fnref:4" href="#fn:4"><sup>4</sup></a><a class="footnote-ref" id="fnref:5" href="#fn:5"><sup>5</sup></a>
</p>
<h3>Interfaces</h3>
<p>There are several native interface libraries available for SCIP. SCIP can be accessed through the modeling system of <a href="/facts/General_Algebraic_Modeling_System/lSMIxcdm">GAMS</a>. Interfaces to <a href="/facts/MATLAB/qPjLISCk">MATLAB</a> and <a href="/facts/AMPL/pzceW9mH">AMPL</a> are available within the standard distribution. There are also currently externalized interfaces for <a href="/facts/Python_(programming_language)/YbuGqofa">Python</a>, <a href="/facts/Java_(programming_language)/9ScgFyAL">Java</a>, <a href="/facts/Julia_(programming_language)/AoB0PJ9C">Julia</a>, and <a href="/facts/Rust_(programming_language)/8JNMV19F">Rust</a>.<a class="footnote-ref" id="fnref:6" href="#fn:6"><sup>6</sup></a>
</p>

<h2 id="further-reading">Further reading</h2>

<ul><li>Achterberg, Tobias (2007), <a href="http://opus4.kobv.de/opus4-tuberlin/frontdoor/index/index/docId/1541"><i>Constraint Integer Programming</i></a>, <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 978-3-89963-892-9.</li></ul>

<h2 id="external-links">External links</h2>

Wikimedia Commons has media related to Konrad-Zuse-Zentrum für Informationstechnik.

<ul><li><a href="http://www.zib.de/">Homepage Zuse Institute Berlin</a></li></ul>

<h2 id="references">References</h2>

<ol>
<li id="fn:1"><p>Mixed Integer Linear Programming Benchmark Mar 18, 2012. <a href="http://plato.asu.edu/ftp/milpc.html" target="_blank">http://plato.asu.edu/ftp/milpc.html</a> <a href="#fnref:1" class="footnote-back-ref">↩</a></p></li>
<li id="fn:2"><p>Release notes for SCIP 8.0 Feb 15, 2023. <a href="https://www.scipopt.org/doc-8.0.3/html/RN80.php" target="_blank">https://www.scipopt.org/doc-8.0.3/html/RN80.php</a> <a href="#fnref:2" class="footnote-back-ref">↩</a></p></li>
<li id="fn:3"><p>Pseudo-Boolean challenge 2009 Feb 11, 2011. <a href="http://www.cril.univ-artois.fr/PB09/results/ranking.php?idev=28" target="_blank">http://www.cril.univ-artois.fr/PB09/results/ranking.php?idev=28</a> <a href="#fnref:3" class="footnote-back-ref">↩</a></p></li>
<li id="fn:4"><p>A Generic Approach to Solving the Steiner Tree Problem and Variants Nov 9, 2015. <a href="https://opus4.kobv.de/opus4-zib/files/5781/MasterThesis.pdf" target="_blank">https://opus4.kobv.de/opus4-zib/files/5781/MasterThesis.pdf</a> <a href="#fnref:4" class="footnote-back-ref">↩</a></p></li>
<li id="fn:5"><p>PolySCIP Aug 15, 2016. <a href="http://polyscip.zib.de/" target="_blank">http://polyscip.zib.de/</a> <a href="#fnref:5" class="footnote-back-ref">↩</a></p></li>
<li id="fn:6"><p>scipopt May 22, 2023. <a href="https://github.com/scipopt/" target="_blank">https://github.com/scipopt/</a> <a href="#fnref:6" class="footnote-back-ref">↩</a></p></li>
</ol>

Zuse Institute Berlin open-in-new

Zuse Institute Berlin