Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 233,435,358 papers from all fields of science
Search
Sign In
Create Free Account
SCIP
SCIP (Solving Constraint Integer Programs) is a mixed integer programming solver and a framework for Branch and cut and Branch and price, developed…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
19 relations
AMPL
Branch and cut
Branch and price
C++
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
More Virtuous Smoothing
Luze Xu
,
Jon Lee
,
Daphne E. Skipper
SIAM Journal on Optimization
2018
Corpus ID: 53636835
In the context of global optimization of mixed-integer nonlinear optimization formulations, we consider smoothing univariate…
Expand
2016
2016
Constraint Programming for Strictly Convex Integer Quadratically-Constrained Problems
Wen-Yang Ku
,
J. Christopher Beck
International Conference on Principles and…
2016
Corpus ID: 31046724
Inspired by the geometric reasoning exploited in discrete ellipsoid-based search (DEBS) from the communications literature, we…
Expand
2015
2015
A General Local Search Solver for FlatZinc
Sara Ceschia
,
L. Gaspero
,
Andrea Schaerf
,
Tommaso Urli
2015
Corpus ID: 16939072
MiniZinc [5, 7] is a high-level declarative modeling language that has become quite popular in the lastfew years. One of the main…
Expand
2015
2015
Generating subtour constraints for the TSP from pure integer solutions
Ulrich Pferschy
,
Rostislav Staněk
2015
Corpus ID: 15492296
The traveling salesman problem (TSP) is one of the most prominent combinatorial optimization problems. Given a complete graph G…
Expand
2014
2014
Combining Discrete Ellipsoid-Based Search and Branch-and-Cut for Binary Quadratic Programming Problems
Wen-Yang Ku
,
J. Christopher Beck
Integration of AI and OR Techniques in Constraint…
2014
Corpus ID: 40174882
We propose a hybrid algorithm that combines discrete ellipsoid-based search (DEBS) and a branch-and-cut (B&C) MIP solver to solve…
Expand
2014
2014
A simulated annealing based heuristic for the multi-source single-path multi-commodity network flow problem
Kai Wei
,
Xiangyong Li
,
Shaochong Lin
,
Chongfang Yue
,
Shuqin Li
International Conference on Service Systems and…
2014
Corpus ID: 35055385
In this paper, we introduce the multi-source single-path multi-commodity network flow problem (MSMCF), which arises in the…
Expand
2012
2012
A Pseudo-Boolean Set Covering Machine
Pascal Germain
,
Sébastien Giguère
,
Jean-Francis Roy
,
Brice Zirakiza
,
François Laviolette
,
Claude-Guy Quimper
International Conference on Principles and…
2012
Corpus ID: 9746947
The Set Covering Machine (SCM) is a machine learning algorithm that constructs a conjunction of Boolean functions. This algorithm…
Expand
2005
2005
Severe Cognitive Impairment Profile (SCIP) Vergleich mit der Severe Impairment Battery (SIB) bei schwer dementen Alterspatienten Severe Cognitive Impairment Profile (SCIP): Comparison with the Severe…
A. Monsch
,
C. Feldmann
,
+4 authors
R. Spiegel
2005
Corpus ID: 148360148
Zusammenfassung: Das SCIP wurde in den USA wenige Jahre nach der SIB als neuropsychologische Skala fur die Untersuchung…
Expand
1995
1995
SCIP: A Secure Network Layer un- derUnix
A. Helme
,
Erik Plaggenmarsch
1995
Corpus ID: 14499722
This report describes the design and implementation of a secure IP layer under Unix for the Berkeley 4.4 TCP/IP protocol suite…
Expand
1994
1994
Competitive Intelligence and Social Advantage
E. Davenport
,
B. Cronin
Library Trends
1994
Corpus ID: 40997521
THIS ARTICLE PRESENTS A BRIEF CONSPECTUS of current issues in civilian competitive intelligence (CI). The authors note an…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE