Scippy

SCIP

Solving Constraint Integer Programs

scipdefplugins.h
Go to the documentation of this file.
1 /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
2 /* */
3 /* This file is part of the program and library */
4 /* SCIP --- Solving Constraint Integer Programs */
5 /* */
6 /* Copyright (C) 2002-2016 Konrad-Zuse-Zentrum */
7 /* fuer Informationstechnik Berlin */
8 /* */
9 /* SCIP is distributed under the terms of the ZIB Academic License. */
10 /* */
11 /* You should have received a copy of the ZIB Academic License */
12 /* along with SCIP; see the file COPYING. If not email to scip@zib.de. */
13 /* */
14 /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
15 
16 /**@file scipdefplugins.h
17  * @ingroup PUBLICMETHODS
18  * @brief default SCIP plugins
19  * @author Tobias Achterberg
20  */
21 
22 /*--+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/
23 
24 #ifndef __SCIP_SCIPDEFPLUGINS_H__
25 #define __SCIP_SCIPDEFPLUGINS_H__
26 
27 #include "scip/scip.h"
28 
29 /* include header files here, such that the user only has to include
30  * scipdefplugins.h
31  */
33 #include "scip/branch_cloud.h"
35 #include "scip/branch_fullstrong.h"
36 #include "scip/branch_inference.h"
37 #include "scip/branch_leastinf.h"
38 #include "scip/branch_mostinf.h"
39 #include "scip/branch_multaggr.h"
40 #include "scip/branch_nodereopt.h"
41 #include "scip/branch_pscost.h"
42 #include "scip/branch_random.h"
43 #include "scip/branch_relpscost.h"
44 #include "scip/compr_largestrepr.h"
45 #include "scip/compr_weakcompr.h"
46 #include "scip/cons_abspower.h"
47 #include "scip/cons_and.h"
48 #include "scip/cons_bivariate.h"
50 #include "scip/cons_conjunction.h"
51 #include "scip/cons_countsols.h"
52 #include "scip/cons_cumulative.h"
53 #include "scip/cons_disjunction.h"
54 #include "scip/cons_indicator.h"
55 #include "scip/cons_integral.h"
56 #include "scip/cons_knapsack.h"
57 #include "scip/cons_linear.h"
58 #include "scip/cons_linking.h"
59 #include "scip/cons_logicor.h"
60 #include "scip/cons_nonlinear.h"
61 #include "scip/cons_or.h"
62 #include "scip/cons_orbitope.h"
64 #include "scip/cons_quadratic.h"
65 #include "scip/cons_setppc.h"
66 #include "scip/cons_soc.h"
67 #include "scip/cons_sos1.h"
68 #include "scip/cons_sos2.h"
70 #include "scip/cons_varbound.h"
71 #include "scip/cons_xor.h"
72 #include "scip/disp_default.h"
75 #include "scip/heur_bound.h"
76 #include "scip/heur_clique.h"
77 #include "scip/heur_coefdiving.h"
78 #include "scip/heur_crossover.h"
79 #include "scip/heur_dins.h"
81 #include "scip/heur_dualval.h"
82 #include "scip/heur_feaspump.h"
83 #include "scip/heur_fixandinfer.h"
84 #include "scip/heur_fracdiving.h"
85 #include "scip/heur_guideddiving.h"
86 #include "scip/heur_indicator.h"
87 #include "scip/heur_intdiving.h"
88 #include "scip/heur_intshifting.h"
91 #include "scip/heur_mutation.h"
92 #include "scip/heur_nlpdiving.h"
94 #include "scip/heur_octane.h"
95 #include "scip/heur_ofins.h"
96 #include "scip/heur_oneopt.h"
97 #include "scip/heur_pscostdiving.h"
98 #include "scip/heur_proximity.h"
99 #include "scip/heur_randrounding.h"
100 #include "scip/heur_rens.h"
101 #include "scip/heur_reoptsols.h"
102 #include "scip/heur_rins.h"
103 #include "scip/heur_rootsoldiving.h"
104 #include "scip/heur_rounding.h"
106 #include "scip/heur_shifting.h"
108 #include "scip/heur_subnlp.h"
109 #include "scip/heur_trivial.h"
111 #include "scip/heur_trysol.h"
112 #include "scip/heur_twoopt.h"
113 #include "scip/heur_undercover.h"
114 #include "scip/heur_vbounds.h"
115 #include "scip/heur_veclendiving.h"
116 #include "scip/heur_zeroobj.h"
117 #include "scip/heur_zirounding.h"
118 #include "scip/nodesel_bfs.h"
120 #include "scip/nodesel_dfs.h"
121 #include "scip/nodesel_estimate.h"
123 #include "scip/nodesel_uct.h"
124 #include "scip/nodesel_restartdfs.h"
125 #include "scip/presol_boundshift.h"
126 #include "scip/presol_components.h"
128 #include "scip/presol_domcol.h"
129 #include "scip/presol_implfree.h"
130 #include "scip/presol_dualagg.h"
131 #include "scip/presol_dualinfer.h"
133 #include "scip/presol_implics.h"
134 #include "scip/presol_inttobinary.h"
135 #include "scip/presol_redvub.h"
136 #include "scip/presol_trivial.h"
137 #include "scip/presol_tworowbnd.h"
138 #include "scip/presol_stuffing.h"
139 #include "scip/prop_dualfix.h"
140 #include "scip/prop_genvbounds.h"
141 #include "scip/prop_obbt.h"
142 #include "scip/prop_probing.h"
143 #include "scip/prop_pseudoobj.h"
144 #include "scip/prop_redcost.h"
145 #include "scip/prop_rootredcost.h"
146 #include "scip/prop_vbounds.h"
147 #include "scip/reader_bnd.h"
148 #include "scip/reader_ccg.h"
149 #include "scip/reader_cip.h"
150 #include "scip/reader_cnf.h"
151 #include "scip/reader_diff.h"
152 #include "scip/reader_fix.h"
153 #include "scip/reader_fzn.h"
154 #include "scip/reader_gms.h"
155 #include "scip/reader_lp.h"
156 #include "scip/reader_mps.h"
157 #include "scip/reader_opb.h"
158 #include "scip/reader_osil.h"
159 #include "scip/reader_pip.h"
160 #include "scip/reader_ppm.h"
161 #include "scip/reader_pbm.h"
162 #include "scip/reader_rlp.h"
163 #include "scip/reader_sol.h"
164 #include "scip/reader_wbo.h"
165 #include "scip/reader_zpl.h"
166 #include "scip/sepa_eccuts.h"
167 #include "scip/sepa_cgmip.h"
168 #include "scip/sepa_clique.h"
169 #include "scip/sepa_closecuts.h"
170 #include "scip/sepa_cmir.h"
171 #include "scip/sepa_disjunctive.h"
172 #include "scip/sepa_flowcover.h"
173 #include "scip/sepa_gomory.h"
174 #include "scip/sepa_impliedbounds.h"
175 #include "scip/sepa_intobj.h"
176 #include "scip/sepa_mcf.h"
177 #include "scip/sepa_oddcycle.h"
178 #include "scip/sepa_rapidlearning.h"
179 #include "scip/sepa_strongcg.h"
180 #include "scip/sepa_zerohalf.h"
181 #include "scip/scipshell.h"
182 
183 #include "nlpi/nlpi_ipopt.h"
184 
185 #ifdef __cplusplus
186 extern "C" {
187 #endif
188 
189 /** includes default SCIP plugins into SCIP */
190 extern
192  SCIP* scip /**< SCIP data structure */
193  );
194 
195 #ifdef __cplusplus
196 }
197 #endif
198 
199 #endif
presolver that converts integer variables with domain [a,a+1] to binaries
SCIP_RETCODE SCIPincludeDefaultPlugins(SCIP *scip)
constraint handler for disjunction constraints
reliable pseudo costs branching rule
Primal heuristic to improve incumbent solution by flipping pairs of variables.
LNS heuristic using a clique partition to restrict the search neighborhood.
RLP file reader (LP format with generic variables and row names)
NLP diving heuristic that chooses fixings w.r.t. the fractionalities.
primal heuristic that tries a given solution
probability based branching rule based on an article by J. Pryor and J.W. Chinneck ...
trivialnegation primal heuristic
Improvement heuristic that alters single variable values.
node selector for hybrid best estimate / best bound search
constraint handler for cumulative constraints
preroot heuristic that alternatingly fixes variables and propagates domains
Constraint handler for variable bound constraints .
LP rounding heuristic that tries to recover from intermediate infeasibilities and shifts continuous v...
CNF file reader.
Pseudo objective propagator.
LP rounding heuristic that tries to recover from intermediate infeasibilities.
reduced cost strengthening using root node reduced costs and the cutoff bound
random variable branching rule
diff file reader
constraint handler for indicator constraints
fix singleton continuous variables
trivial primal heuristic
Undercover primal heuristic for MINLPs.
dominated column presolver
CIP file reader.
aggregate variables by dual arguments
node selector for depth first search with periodical selection of the best node
enum SCIP_Retcode SCIP_RETCODE
Definition: type_retcode.h:53
LP diving heuristic that chooses fixings in direction of incumbent solutions.
default display columns
edge concave cut separator
LP diving heuristic that chooses fixings w.r.t. the fractionalities.
OS instance language (OSiL) format file reader.
disjunctive cut separator
constraint handler for indicator constraints over arbitrary constraint types
least infeasible LP branching rule
Constraint handler for "and" constraints, .
flowcover separator
file writer for portable pixmap file format (PPM), open with common graphic viewer programs (e...
nodereopt branching rule
constraint handler for second order cone constraints
LP diving heuristic that chooses fixings w.r.t. the pseudo cost values.
Constraint handler for counting feasible solutions.
Constraint handler for the set partitioning / packing / covering constraints .
trivial presolver: round fractional bounds on integer variables, fix variables with equal bounds ...
file reader for variable bounds
LP diving heuristic that chooses fixings w.r.t. the matrix coefficients.
constraint handler for (partitioning/packing) orbitope constraints w.r.t. the full symmetric group ...
Constraint handler for "or" constraints, .
variable upper and lower bound propagator
Constraint handler for knapsack constraints of the form , x binary and .
LP diving heuristic that fixes variables with integral LP value.
primal heuristic that uses dualvalues for successive switching variable values
cloud branching rule
weakcompr tree compression
LNS heuristic that tries to combine several feasible solutions.
constraint handler for conjunction constraints
SCIP command line interface.
propagator using the LP reduced cost and the cutoff bound
closecuts meta separator
Constraint handler for logicor constraints (equivalent to set covering, but algorithms are suited fo...
ZIMPL model file reader.
Local branching heuristic according to Fischetti and Lodi.
LP diving heuristic that chooses fixings w.r.t. the active constraints the variable appear in...
constraint handler for quadratic constraints
exploit implied free variables for multi-aggregation
LNS heuristic that tries to randomly mutate the incumbent solution.
file reader for polynomial mixed-integer programs in PIP format
complemented mixed integer rounding cuts separator (Marchand&#39;s version)
handle partial solutions for linear problems with indicators and otherwise continuous variables ...
node selector for best estimate search
file writer for portable bitmap file format (PBM), open with common graphic viewer programs (e...
LNS heuristic that finds the optimal rounding to a given point.
constraint handler for linking binary variables to an integer variable
Ipopt NLP interface.
full strong LP branching rule
LP diving heuristic that changes variables&#39; objective values using root LP solution as guide...
pseudo costs branching rule
fullstrong branching on fractional and multi-aggregated variables
multi-commodity-flow network cut separator
WBO file reader (LP format with generic variables and row names)
file reader for variable fixings
Column connectivity graph file reader (actually, only a writer)
fix-and-infer primal heuristic
constraint handler for nonlinear constraints
LNS heuristic that combines the incumbent with the LP optimum.
optimization-based bound tightening propagator
implication graph presolver which checks for aggregations
Objective Feasibility Pump 2.0.
eventhdlr for soft time limit
components presolver
LNS heuristic uses the variable lower and upper bounds to determine the search neighborhood.
Gomory MIR Cuts.
reoptsols primal heuristic
constraint handler for bivariate nonlinear constraints
Constraint handler for linear constraints in their most general form, .
Constraint handler for absolute power constraints .
integer objective value separator
ZI Round primal heuristic.
{0,1/2}-cuts separator
do bound tightening by using two rows
LP diving heuristic that fixes variables with a large difference to their root solution.
GAMS file reader and writer.
most infeasible LP branching rule
implied bounds separator
all variables full strong LP branching rule
Constraint handler for "xor" constraints, .
DINS primal heuristic.
Diving heuristic that chooses fixings w.r.t. changes in the solution density after Pryor and Chinneck...
remove redundant variable upper bound constraints
dual inference presolver
LP file reader.
pseudo-Boolean file reader (opb format)
node selector for best first search
heuristic that tries to solve the problem without objective. In Gurobi, this heuristic is known as "H...
probing propagator
FlatZinc file reader.
file reader for primal solutions
NLP local search primal heuristic using sub-SCIPs.
Chvatal-Gomory cuts computed via a sub-MIP.
LP diving heuristic that rounds variables with long column vectors.
constraint handler for the integrality constraint
inference history branching rule
gateextraction presolver
constraint handler for SOS type 1 constraints
rapidlearning separator
Simple and fast LP rounding heuristic.
largestrepr tree compression
presolver that converts integer variables with domain [a,a+1] to binaries
Strong CG Cuts (Letchford & Lodi)
octane primal heuristic based on Balas, Ceria, Dawande, Margot, and Pataki
randomized LP rounding heuristic which also generates conflicts via an auxiliary probing tree ...
constraint handler for pseudoboolean constraints
constraint handler for SOS type 2 constraints
uct node selector which balances exploration and exploitation by considering node visits ...
clique separator
LP rounding heuristic that tries to recover from intermediate infeasibilities, shifts integer variabl...
constraint handler for bound disjunction constraints
LP diving heuristic that changes variable&#39;s objective value instead of bounds, using pseudo cost valu...
fixing roundable variables to best bound
oddcycle separator
node selector for depth first search
improvement heuristic which uses an auxiliary objective instead of the original objective function wh...
node selector for breadth-first search
SCIP callable library.
(extended) MPS file reader
heuristic which fixes all integer variables to a bound (lower/upper) and solves the remaining LP ...
generalized variable bounds propagator
presolver that converts integer variables with domain [a,b] to integer variables with domain [0...
OFINS - Objective Function Induced Neighborhood Search - a primal heuristic for reoptimization.