Skip to search formSkip to main contentSkip to account menu

SCIP

SCIP (Solving Constraint Integer Programs) is a mixed integer programming solver and a framework for Branch and cut and Branch and price, developed… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
In the context of global optimization of mixed-integer nonlinear optimization formulations, we consider smoothing univariate… 
2016
2016
Inspired by the geometric reasoning exploited in discrete ellipsoid-based search (DEBS) from the communications literature, we… 
2015
2015
MiniZinc [5, 7] is a high-level declarative modeling language that has become quite popular in the lastfew years. One of the main… 
2015
2015
The traveling salesman problem (TSP) is one of the most prominent combinatorial optimization problems. Given a complete graph G… 
2014
2014
We propose a hybrid algorithm that combines discrete ellipsoid-based search (DEBS) and a branch-and-cut (B&C) MIP solver to solve… 
2014
2014
In this paper, we introduce the multi-source single-path multi-commodity network flow problem (MSMCF), which arises in the… 
2012
2012
The Set Covering Machine (SCM) is a machine learning algorithm that constructs a conjunction of Boolean functions. This algorithm… 
2005
2005
Zusammenfassung: Das SCIP wurde in den USA wenige Jahre nach der SIB als neuropsychologische Skala fur die Untersuchung… 
1995
1995
This report describes the design and implementation of a secure IP layer under Unix for the Berkeley 4.4 TCP/IP protocol suite… 
1994
1994
THIS ARTICLE PRESENTS A BRIEF CONSPECTUS of current issues in civilian competitive intelligence (CI). The authors note an…