SCIP
Solving Constraint Integer Programs
scipdefplugins.h
Go to the documentation of this file.
31/*--+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/
default Benders' decomposition plugin
all variables full strong LP branching rule
cloud branching rule
probability based branching rule based on an article by J. Pryor and J.W. Chinneck
full strong LP branching rule
Gomory cut branching rule.
inference history branching rule
least infeasible LP branching rule
lookahead LP branching rule
most infeasible LP branching rule
fullstrong branching on fractional and multi-aggregated variables
nodereopt branching rule
pseudo costs branching rule
random variable branching rule
reliable pseudo costs branching rule
vanilla full strong LP branching rule
largestrepr tree compression
weakcompr tree compression
implementation of concurrent solver interface for SCIP
Constraint handler for AND constraints, .
constraint handler for Benders' decomposition
constraint handler for benderslp decomposition
constraint handler for bound disjunction constraints
constraint handler for cardinality constraints
constraint handler for handling independent components
constraint handler for conjunction constraints
Constraint handler for counting feasible solutions.
constraint handler for cumulative constraints
constraint handler for disjunction constraints
constraint handler that checks bounds on fixed variables
constraint handler for indicator constraints
constraint handler for the integrality constraint
Constraint handler for knapsack constraints of the form , x binary and .
Constraint handler for linear constraints in their most general form, .
constraint handler for linking binary variables to a linking (continuous or integer) variable
Constraint handler for logicor constraints (equivalent to set covering, but algorithms are suited fo...
constraint handler for nonlinear constraints specified by algebraic expressions
Constraint handler for "or" constraints, .
constraint handler for orbisack constraints
constraint handler for (partitioning/packing/full) orbitope constraints w.r.t. the full symmetric gro...
constraint handler for pseudoboolean constraints
Constraint handler for the set partitioning / packing / covering constraints .
constraint handler for SOS type 1 constraints
constraint handler for SOS type 2 constraints
constraint handler for indicator constraints over arbitrary constraint types
constraint handler for symresack constraints
Constraint handler for variable bound constraints .
Constraint handler for XOR constraints, .
dynamic cut selector
ensemble cut selector
hybrid cut selector
default user interface dialog
default display columns
event handler for tree size estimation and restarts
eventhdlr for soft time limit
eventhdlr for solving phase dependent parameter adjustment
absolute expression handler
handler for -x*log(x) expressions
exponential expression handler
logarithm expression handler
power and signed power expression handlers
product expression handler
sum expression handler
handler for sin expressions
constant value expression handler
variable expression handler
handler for variable index expressions
LP diving heuristic that chooses fixings w.r.t. the active constraints the variable appear in.
diving heuristic that selects adaptively between the existing, public dive sets
Adaptive large neighborhood search heuristic that orchestrates popular LNS heuristics.
heuristic which fixes all integer variables to a bound (lower/upper) and solves the remaining LP
LNS heuristic using a clique partition to restrict the search neighborhood.
LP diving heuristic that chooses fixings w.r.t. the matrix coefficients.
primal heuristic trying to complete given partial solutions
LP diving heuristic that chooses fixings w.r.t. conflict locks.
LNS heuristic that tries to combine several feasible solutions.
DINS primal heuristic.
Diving heuristic that chooses fixings w.r.t. changes in the solution density after Pryor and Chinneck...
dynamic partition search
primal heuristic that uses dualvalues for successive switching variable values
LP diving heuristic that tries to construct a Farkas-proof.
Objective Feasibility Pump 2.0.
fix-and-infer primal heuristic
LP diving heuristic that chooses fixings w.r.t. the fractionalities.
LNS heuristic that tries to delimit the search region to a neighborhood in the constraint graph.
LP diving heuristic that chooses fixings in direction of incumbent solutions.
handle partial solutions for linear problems with indicators and otherwise continuous variables
LP diving heuristic that fixes indicator variables controlling semicontinuous variables.
LP diving heuristic that fixes variables with integral LP value.
LP rounding heuristic that tries to recover from intermediate infeasibilities, shifts integer variabl...
LP diving heuristic that fixes variables with a large difference to their root solution.
Local branching heuristic according to Fischetti and Lodi.
locks primal heuristic
LNS heuristic that tries to compute integral solution on optimal LP face.
mpec primal heuristic
multistart heuristic for convex and nonconvex MINLPs
LNS heuristic that tries to randomly mutate the incumbent solution.
NLP diving heuristic that chooses fixings w.r.t. the fractionalities.
LP diving heuristic that changes variable's objective value instead of bounds, using pseudo cost valu...
octane primal heuristic based on Balas, Ceria, Dawande, Margot, and Pataki
OFINS - Objective Function Induced Neighborhood Search - a primal heuristic for reoptimization.
Improvement heuristic that alters single variable values.
PADM primal heuristic.
improvement heuristic which uses an auxiliary objective instead of the original objective function wh...
LP diving heuristic that chooses fixings w.r.t. the pseudo cost values.
randomized LP rounding heuristic which also generates conflicts via an auxiliary probing tree
LNS heuristic that finds the optimal rounding to a given point.
reoptsols primal heuristic
repair primal heuristic
LNS heuristic that combines the incumbent with the LP optimum.
LP diving heuristic that changes variables' objective values using root LP solution as guide.
LP rounding heuristic that tries to recover from intermediate infeasibilities.
Adaptive heuristic to schedule LNS and diving heuristics.
preroot heuristic that alternatingly fixes variables and propagates domains
LP rounding heuristic that tries to recover from intermediate infeasibilities and shifts continuous v...
Simple and fast LP rounding heuristic.
NLP local search primal heuristic using sub-SCIPs.
trivial primal heuristic
trivialnegation primal heuristic
Large neighborhood search heuristic for Benders' decomposition based on trust region methods.
primal heuristic that tries a given solution
Primal heuristic to improve incumbent solution by flipping pairs of variables.
Undercover primal heuristic for MINLPs.
LNS heuristic uses the variable lower and upper bounds to determine the search neighborhood.
LP diving heuristic that rounds variables with long column vectors.
heuristic that tries to solve the problem without objective. In Gurobi, this heuristic is known as "H...
ZI Round primal heuristic.
Definition: objbenders.h:44
bilinear nonlinear handler
nonlinear handlers for convex and concave expressions, respectively
default nonlinear handler that calls expression handler methods
perspective nonlinear handler
nonlinear handler to handle quadratic expressions
quotient nonlinear handler
signomial nonlinear handler
soc nonlinear handler
NLP interface that uses all available NLP interfaces.
filterSQP NLP interface
Ipopt NLP interface.
Worhp NLP interface.
node selector for best first search
node selector for breadth-first search
node selector for depth first search
node selector for best estimate search
node selector for hybrid best estimate / best bound search
node selector for depth first search with periodical selection of the best node
uct node selector which balances exploration and exploitation by considering node visits
presolver that converts integer variables with domain [a,b] to integer variables with domain [0,...
presolver that converts integer variables with domain [a,a+1] to binaries
dominated column presolver
aggregate variables by dual arguments
dual compensation presolver
dual inference presolver
cancel nonzeros of the constraint matrix based on the columns
gateextraction presolver
implication graph presolver which checks for aggregations
presolver that converts integer variables with domain [a,a+1] to binaries
MILP presolver that calls the presolve library on the constraint matrix.
qpkktref presolver
remove redundant variable upper bound constraints
cancel non-zeros of the constraint matrix
fix singleton continuous variables
trivial presolver: round fractional bounds on integer variables, fix variables with equal bounds
do bound tightening by using two rows
fixing roundable variables to best bound
generalized variable bounds propagator
nonlinear OBBT propagator
optimization-based bound tightening propagator
probing propagator
Pseudo objective propagator.
propagator using the LP reduced cost and the cutoff bound
reduced cost strengthening using root node reduced costs and the cutoff bound
propagator for symmetry handling
variable upper and lower bound propagator
file reader for variable bounds
Column connectivity graph file reader (actually, only a writer)
CIP file reader.
CNF file reader.
COR file reader (MPS format of the core problem for stochastic programs)
file reader for decompositions in the constraint based dec-file format.
diff file reader
file reader for variable fixings
FlatZinc file reader.
GAMS file reader and writer.
LP file reader.
(extended) MPS file reader
file reader for partial primal solutions
AMPL .nl file reader.
pseudo-Boolean file reader (opb format)
OS instance language (OSiL) format file reader.
file writer for portable bitmap file format (PBM), open with common graphic viewer programs (e....
file reader for polynomial mixed-integer programs in PIP format
file writer for portable pixmap file format (PPM), open with common graphic viewer programs (e....
RLP file reader (LP format with generic variables and row names)
SMPS file reader - SMPS files lists the cor, tim and sto files for a single instance to be read.
file reader for primal solutions
STO file reader - the stochastic information of an instance in SMPS format.
TIM file reader - the stage information for a stochastic programming instance in SMPS format.
WBO file reader (LP format with generic variables and row names)
ZIMPL model file reader.
SCIP callable library.
SCIP_RETCODE SCIPincludeDefaultPlugins(SCIP *scip)
Definition: scipdefplugins.c:37
SCIP command line interface.
flow cover and complemented mixed integer rounding cuts separator (Marchand's version)
Chvatal-Gomory cuts computed via a sub-MIP.
clique separator
closecuts meta separator
convexproj separator
disjunctive cut separator
edge concave cut separator
gauge separator
Gomory MIR Cuts.
implied bounds separator
integer objective value separator
lagromory separator
multi-commodity-flow network cut separator
principal minor separator
mixing cuts separator
oddcycle separator
rapidlearning separator
reformulation-linearization technique separator
{0,1/2}-cuts separator
Definition: struct_scip.h:70
methods for handling symmetries
default statistics tables