SCIP: solving constraint integer programs

By Tobias Achterberg. Mathematical Programming Computation, 2009

1,352 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Computer Networks and Communications, Electrical and Electronic Engineering

View Paper: https://www.semanticscholar.org/paper/54a259ceb28165a6855918f16ac3b360e0758c5a

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

In Computer Networks and Communications

In Electrical and Electronic Engineering

Citations in the corpus

Hybrid Branching (2009, methodology): “Therefore, one has to combine them into a single score value, which we do by multiplication [1].”
Leveraging linear and mixed integer programming for SMT (2014, neutral): “0.0-ex+spx) [13], [26], and glpk (4.52) [17].”
Bayesian network learning with cutting planes (2011, methodology): “However here IP is effected in a more conventional manner than Jaakkola et al, using the SCIP (Solving Constraint Integer Programs) framework [2].”
VizLinter: A Linter and Fixer Framework for Data Visualization (2021, methodology): “BIP is an NP-Complete problem, whose solution can be found using the Branch-and-Cut algorithm [41] or various well-established solvers such as SCIP [3] and CBC [17].”
MINLP Solver Software (2011, methodology): “In this category we have alphaBB, AlphaECP, AOA, BARON, DICOPT, LaGO, and LindoGlobal.”
Progress in presolving for mixed integer programming (2015, methodology): “The basic version performs all the presolving steps implemented in SCIP (for more details, we refer to [2]), but disables the techniques newly introduced in this paper, which are included in the advanced presolving.”
Combining Retrieval, Statistics, and Inference to Answer Elementary Science Questions (2016, methodology): “To score answer options, we ﬁrst build the model M ( q, A, T ) and solve it using an off-the-shelf ILP solver SCIP (Achterberg 2009).”
Traveling Salesman Problem (2008, positive): “2 Formulations We implemented the different formulations based on the SCIP[2] IP solver(2).”
Enterprise-wide optimization for industrial demand side management: Fundamentals, advances, and perspectives (2016, background): “Nonconvexities further increase the computational complexity since finding the global optimum now requires the use of global solvers, such as BARON (Tawarmalani & Sahinidis, 2005), SCIP (Achterberg, 2009), and ANTIGONE (Misener & Floudas, 2014).”
Algorithms and Software for Convex Mixed Integer Nonlinear Programs (2012, methodology): “Noncommercial MILP solvers include MINTO [94], SCIP [3] and several open-source software included in COIN-”
Question Answering via Integer Programming over Semi-Structured Knowledge (2016, methodology): “We then use an off-the-shelf ILP optimization engine called SCIP [Achterberg, 2009] to determine the best supported answer for Q.”
General Heuristics for Nonconvex Quadratically Constrained Quadratic Programming (2017, methodology): “of the solvers here: GloMIQO [MF13], BARON [Sah14], Ipopt [WLMK09], Couenne [IBM13], and others provide global methods for (mixed-integer) QCQPs. Gurobi [GO15], CPLEX [IBM13], MOSEK [ApS17], and SCIP [Ach09]provide globalmethods formixed-integer nonlinearprograms, with limited support for nonconvex ”
Automatically improving the anytime behaviour of optimisation algorithms (2014, methodology): “Another example is mixed-integer programming solvers, such as SCIP [1], which often have a large number of configurable parameters affecting the main algorithm used internally, e.”
GloMIQO: Global mixed-integer quadratic optimizer (2012, background): “– SCIP [1,3,30,31] SCIP was originally developed as an mixed-integer programming (MIP) solver, but was recently extended to MIQCQP [30,31].”
Information-based branching schemes for binary linear mixed integer problems (2009, background): “…effort in the integration of approaches from mathematical logic and mathematical programming (see Hooker (1998), Hooker (2000), Dixon and Gins- berg (2000), Achterberg (2007a), Achterberg (2007b), Sandholm and Shields (2006), Avenali (2007), Achterberg (2009) and Achterberg and Berthold (2009)).”