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-2019 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 PUBLICCOREAPI
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  */
32 #include "scip/branch_allfullstrong.h"
33 #include "scip/branch_cloud.h"
34 #include "scip/branch_distribution.h"
35 #include "scip/branch_fullstrong.h"
36 #include "scip/branch_inference.h"
37 #include "scip/branch_leastinf.h"
38 #include "scip/branch_lookahead.h"
39 #include "scip/branch_mostinf.h"
40 #include "scip/branch_multaggr.h"
41 #include "scip/branch_nodereopt.h"
42 #include "scip/branch_pscost.h"
43 #include "scip/branch_random.h"
44 #include "scip/branch_relpscost.h"
45 #include "scip/compr_largestrepr.h"
46 #include "scip/compr_weakcompr.h"
47 #include "scip/cons_abspower.h"
48 #include "scip/cons_and.h"
49 #include "scip/cons_benders.h"
50 #include "scip/cons_benderslp.h"
51 #include "scip/cons_bivariate.h"
52 #include "scip/cons_bounddisjunction.h"
53 #include "scip/cons_cardinality.h"
54 #include "scip/cons_conjunction.h"
55 #include "scip/cons_countsols.h"
56 #include "scip/cons_cumulative.h"
57 #include "scip/cons_disjunction.h"
58 #include "scip/cons_indicator.h"
59 #include "scip/cons_integral.h"
60 #include "scip/cons_knapsack.h"
61 #include "scip/cons_linear.h"
62 #include "scip/cons_linking.h"
63 #include "scip/cons_logicor.h"
64 #include "scip/cons_nonlinear.h"
65 #include "scip/cons_or.h"
66 #include "scip/cons_orbisack.h"
67 #include "scip/cons_orbitope.h"
68 #include "scip/cons_pseudoboolean.h"
69 #include "scip/cons_quadratic.h"
70 #include "scip/cons_setppc.h"
71 #include "scip/cons_soc.h"
72 #include "scip/cons_sos1.h"
73 #include "scip/cons_sos2.h"
74 #include "scip/cons_superindicator.h"
75 #include "scip/cons_symresack.h"
76 #include "scip/cons_varbound.h"
77 #include "scip/cons_xor.h"
78 #include "scip/cons_components.h"
79 #include "scip/disp_default.h"
80 #include "scip/event_solvingphase.h"
81 #include "scip/event_softtimelimit.h"
82 #include "scip/heur_actconsdiving.h"
83 #include "scip/heur_bound.h"
84 #include "scip/heur_clique.h"
85 #include "scip/heur_coefdiving.h"
86 #include "scip/heur_completesol.h"
87 #include "scip/heur_conflictdiving.h"
88 #include "scip/heur_crossover.h"
89 #include "scip/heur_dins.h"
90 #include "scip/heur_distributiondiving.h"
91 #include "scip/heur_dualval.h"
92 #include "scip/heur_farkasdiving.h"
93 #include "scip/heur_feaspump.h"
94 #include "scip/heur_fixandinfer.h"
95 #include "scip/heur_fracdiving.h"
96 #include "scip/heur_gins.h"
97 #include "scip/heur_guideddiving.h"
98 #include "scip/heur_indicator.h"
99 #include "scip/heur_intdiving.h"
100 #include "scip/heur_intshifting.h"
101 #include "scip/heur_linesearchdiving.h"
102 #include "scip/heur_localbranching.h"
103 #include "scip/heur_locks.h"
104 #include "scip/heur_lpface.h"
105 #include "scip/heur_alns.h"
106 #include "scip/heur_multistart.h"
107 #include "scip/heur_mutation.h"
108 #include "scip/heur_mpec.h"
109 #include "scip/heur_nlpdiving.h"
110 #include "scip/heur_objpscostdiving.h"
111 #include "scip/heur_octane.h"
112 #include "scip/heur_ofins.h"
113 #include "scip/heur_oneopt.h"
114 #include "scip/heur_pscostdiving.h"
115 #include "scip/heur_proximity.h"
116 #include "scip/heur_randrounding.h"
117 #include "scip/heur_rens.h"
118 #include "scip/heur_reoptsols.h"
119 #include "scip/heur_repair.h"
120 #include "scip/heur_rins.h"
121 #include "scip/heur_rootsoldiving.h"
122 #include "scip/heur_rounding.h"
123 #include "scip/heur_shiftandpropagate.h"
124 #include "scip/heur_shifting.h"
125 #include "scip/heur_simplerounding.h"
126 #include "scip/heur_subnlp.h"
127 #include "scip/heur_trivial.h"
128 #include "scip/heur_trivialnegation.h"
129 #include "scip/heur_trysol.h"
130 #include "scip/heur_twoopt.h"
131 #include "scip/heur_undercover.h"
132 #include "scip/heur_vbounds.h"
133 #include "scip/heur_veclendiving.h"
134 #include "scip/heur_zeroobj.h"
135 #include "scip/heur_zirounding.h"
136 #include "scip/nodesel_bfs.h"
137 #include "scip/nodesel_breadthfirst.h"
138 #include "scip/nodesel_dfs.h"
139 #include "scip/nodesel_estimate.h"
140 #include "scip/nodesel_hybridestim.h"
141 #include "scip/nodesel_uct.h"
142 #include "scip/nodesel_restartdfs.h"
143 #include "scip/presol_boundshift.h"
144 #include "scip/presol_convertinttobin.h"
145 #include "scip/presol_domcol.h"
146 #include "scip/presol_dualagg.h"
147 #include "scip/presol_dualcomp.h"
148 #include "scip/presol_dualinfer.h"
149 #include "scip/presol_gateextraction.h"
150 #include "scip/presol_implics.h"
151 #include "scip/presol_inttobinary.h"
152 #include "scip/presol_redvub.h"
153 #include "scip/presol_symbreak.h"
154 #include "scip/presol_qpkktref.h"
155 #include "scip/presol_trivial.h"
156 #include "scip/presol_tworowbnd.h"
157 #include "scip/presol_sparsify.h"
158 #include "scip/presol_stuffing.h"
159 #include "scip/presol_symmetry.h"
160 #include "scip/prop_dualfix.h"
161 #include "scip/prop_genvbounds.h"
162 #include "scip/prop_nlobbt.h"
163 #include "scip/prop_obbt.h"
164 #include "scip/prop_orbitalfixing.h"
165 #include "scip/prop_probing.h"
166 #include "scip/prop_pseudoobj.h"
167 #include "scip/prop_redcost.h"
168 #include "scip/prop_rootredcost.h"
169 #include "scip/prop_vbounds.h"
170 #include "scip/reader_bnd.h"
171 #include "scip/reader_ccg.h"
172 #include "scip/reader_cip.h"
173 #include "scip/reader_cnf.h"
174 #include "scip/reader_cor.h"
175 #include "scip/reader_diff.h"
176 #include "scip/reader_fix.h"
177 #include "scip/reader_fzn.h"
178 #include "scip/reader_gms.h"
179 #include "scip/reader_lp.h"
180 #include "scip/reader_mps.h"
181 #include "scip/reader_mst.h"
182 #include "scip/reader_opb.h"
183 #include "scip/reader_osil.h"
184 #include "scip/reader_pip.h"
185 #include "scip/reader_ppm.h"
186 #include "scip/reader_pbm.h"
187 #include "scip/reader_rlp.h"
188 #include "scip/reader_smps.h"
189 #include "scip/reader_sol.h"
190 #include "scip/reader_sto.h"
191 #include "scip/reader_tim.h"
192 #include "scip/reader_wbo.h"
193 #include "scip/reader_zpl.h"
194 #include "scip/sepa_eccuts.h"
195 #include "scip/sepa_cgmip.h"
196 #include "scip/sepa_clique.h"
197 #include "scip/sepa_closecuts.h"
198 #include "scip/sepa_aggregation.h"
199 #include "scip/sepa_convexproj.h"
200 #include "scip/sepa_disjunctive.h"
201 #include "scip/sepa_gauge.h"
202 #include "scip/sepa_gomory.h"
203 #include "scip/sepa_impliedbounds.h"
204 #include "scip/sepa_intobj.h"
205 #include "scip/sepa_mcf.h"
206 #include "scip/sepa_oddcycle.h"
207 #include "scip/sepa_rapidlearning.h"
208 #include "scip/sepa_strongcg.h"
209 #include "scip/sepa_zerohalf.h"
210 #include "scip/scipshell.h"
211 #include "scip/table_default.h"
212 #include "scip/concsolver_scip.h"
213 #include "scip/benders_default.h"
214 
215 #include "nlpi/nlpi_ipopt.h"
216 #include "nlpi/nlpi_filtersqp.h"
217 #include "nlpi/nlpi_worhp.h"
218 #include "nlpi/nlpi_all.h"
219 
220 #ifdef __cplusplus
221 extern "C" {
222 #endif
223 
224 /** includes default SCIP plugins into SCIP */
225 SCIP_EXPORT
226 SCIP_RETCODE SCIPincludeDefaultPlugins(
227  SCIP* scip /**< SCIP data structure */
228  );
229 
230 #ifdef __cplusplus
231 }
232 #endif
233 
234 #endif
presol_convertinttobin.h
presolver that converts integer variables with domain [a,a+1] to binaries
cons_disjunction.h
constraint handler for disjunction constraints
branch_relpscost.h
reliable pseudo costs branching rule
heur_twoopt.h
Primal heuristic to improve incumbent solution by flipping pairs of variables.
cons_benders.h
constraint handler for Benders&#39; decomposition
heur_mpec.h
mpec primal heuristic
heur_clique.h
LNS heuristic using a clique partition to restrict the search neighborhood.
sepa_convexproj.h
convexproj separator
reader_rlp.h
RLP file reader (LP format with generic variables and row names)
heur_nlpdiving.h
NLP diving heuristic that chooses fixings w.r.t. the fractionalities.
heur_trysol.h
primal heuristic that tries a given solution
branch_distribution.h
probability based branching rule based on an article by J. Pryor and J.W. Chinneck ...
heur_trivialnegation.h
trivialnegation primal heuristic
reader_tim.h
TIM file reader - the stage information for a stochastic programming instance in SMPS format...
heur_oneopt.h
Improvement heuristic that alters single variable values.
nodesel_hybridestim.h
node selector for hybrid best estimate / best bound search
cons_cumulative.h
constraint handler for cumulative constraints
heur_shiftandpropagate.h
preroot heuristic that alternatingly fixes variables and propagates domains
cons_varbound.h
Constraint handler for variable bound constraints .
heur_shifting.h
LP rounding heuristic that tries to recover from intermediate infeasibilities and shifts continuous v...
reader_cnf.h
CNF file reader.
prop_pseudoobj.h
Pseudo objective propagator.
heur_completesol.h
primal heuristic trying to complete given partial solutions
presol_dualcomp.h
dual compensation presolver
heur_rounding.h
LP rounding heuristic that tries to recover from intermediate infeasibilities.
reader_cor.h
COR file reader (MPS format of the core problem for stochastic programs)
prop_rootredcost.h
reduced cost strengthening using root node reduced costs and the cutoff bound
SCIP_EXPORT
#define SCIP_EXPORT
Definition: def.h:98
branch_random.h
random variable branching rule
reader_diff.h
diff file reader
cons_indicator.h
constraint handler for indicator constraints
presol_stuffing.h
fix singleton continuous variables
heur_trivial.h
trivial primal heuristic
heur_undercover.h
Undercover primal heuristic for MINLPs.
presol_domcol.h
dominated column presolver
sepa_gauge.h
gauge separator
reader_cip.h
CIP file reader.
presol_dualagg.h
aggregate variables by dual arguments
nodesel_restartdfs.h
node selector for depth first search with periodical selection of the best node
cons_orbisack.h
constraint handler for orbisack constraints
SCIP_RETCODE
enum SCIP_Retcode SCIP_RETCODE
Definition: type_retcode.h:53
table_default.h
default statistics tables
heur_guideddiving.h
LP diving heuristic that chooses fixings in direction of incumbent solutions.
reader_sto.h
STO file reader - the stochastic information of an instance in SMPS format.
disp_default.h
default display columns
sepa_eccuts.h
edge concave cut separator
heur_fracdiving.h
LP diving heuristic that chooses fixings w.r.t. the fractionalities.
reader_osil.h
OS instance language (OSiL) format file reader.
sepa_disjunctive.h
disjunctive cut separator
cons_superindicator.h
constraint handler for indicator constraints over arbitrary constraint types
branch_leastinf.h
least infeasible LP branching rule
cons_and.h
Constraint handler for AND constraints, .
presol_symbreak.h
presolver for adding symmetry breaking constraints
reader_ppm.h
file writer for portable pixmap file format (PPM), open with common graphic viewer programs (e...
branch_nodereopt.h
nodereopt branching rule
cons_soc.h
constraint handler for second order cone constraints
heur_pscostdiving.h
LP diving heuristic that chooses fixings w.r.t. the pseudo cost values.
cons_countsols.h
Constraint handler for counting feasible solutions.
cons_setppc.h
Constraint handler for the set partitioning / packing / covering constraints .
cons_components.h
constraint handler for handling independent components
sepa_aggregation.h
flow cover and complemented mixed integer rounding cuts separator (Marchand&#39;s version) ...
presol_trivial.h
trivial presolver: round fractional bounds on integer variables, fix variables with equal bounds ...
nlpi_filtersqp.h
filterSQP NLP interface
reader_bnd.h
file reader for variable bounds
heur_coefdiving.h
LP diving heuristic that chooses fixings w.r.t. the matrix coefficients.
presol_sparsify.h
cancel non-zeros of the constraint matrix
cons_orbitope.h
constraint handler for (partitioning/packing/full) orbitope constraints w.r.t. the full symmetric gro...
cons_symresack.h
constraint handler for symresack constraints
cons_or.h
Constraint handler for "or" constraints, .
prop_vbounds.h
variable upper and lower bound propagator
cons_knapsack.h
Constraint handler for knapsack constraints of the form , x binary and .
heur_intdiving.h
LP diving heuristic that fixes variables with integral LP value.
heur_dualval.h
primal heuristic that uses dualvalues for successive switching variable values
branch_cloud.h
cloud branching rule
compr_weakcompr.h
weakcompr tree compression
concsolver_scip.h
implementation of concurrent solver interface for SCIP
heur_crossover.h
LNS heuristic that tries to combine several feasible solutions.
cons_conjunction.h
constraint handler for conjunction constraints
heur_farkasdiving.h
LP diving heuristic that tries to construct a Farkas-proof.
scipshell.h
SCIP command line interface.
prop_redcost.h
propagator using the LP reduced cost and the cutoff bound
sepa_closecuts.h
closecuts meta separator
cons_logicor.h
Constraint handler for logicor constraints (equivalent to set covering, but algorithms are suited fo...
reader_zpl.h
ZIMPL model file reader.
heur_localbranching.h
Local branching heuristic according to Fischetti and Lodi.
heur_actconsdiving.h
LP diving heuristic that chooses fixings w.r.t. the active constraints the variable appear in...
cons_quadratic.h
constraint handler for quadratic constraints
SCIPincludeDefaultPlugins
SCIP_EXPORT SCIP_RETCODE SCIPincludeDefaultPlugins(SCIP *scip)
Definition: scipdefplugins.c:27
heur_gins.h
LNS heuristic that tries to delimit the search region to a neighborhood in the constraint graph...
heur_mutation.h
LNS heuristic that tries to randomly mutate the incumbent solution.
reader_pip.h
file reader for polynomial mixed-integer programs in PIP format
heur_alns.h
Adaptive large neighborhood search heuristic that orchestrates popular LNS heuristics.
heur_indicator.h
handle partial solutions for linear problems with indicators and otherwise continuous variables ...
nodesel_estimate.h
node selector for best estimate search
nlpi_worhp.h
Worhp NLP interface.
reader_pbm.h
file writer for portable bitmap file format (PBM), open with common graphic viewer programs (e...
heur_rens.h
LNS heuristic that finds the optimal rounding to a given point.
heur_repair.h
repair primal heuristic
cons_linking.h
constraint handler for linking binary variables to an integer variable
nlpi_ipopt.h
Ipopt NLP interface.
branch_fullstrong.h
full strong LP branching rule
heur_rootsoldiving.h
LP diving heuristic that changes variables&#39; objective values using root LP solution as guide...
branch_pscost.h
pseudo costs branching rule
branch_multaggr.h
fullstrong branching on fractional and multi-aggregated variables
sepa_mcf.h
multi-commodity-flow network cut separator
reader_wbo.h
WBO file reader (LP format with generic variables and row names)
reader_fix.h
file reader for variable fixings
reader_ccg.h
Column connectivity graph file reader (actually, only a writer)
heur_fixandinfer.h
fix-and-infer primal heuristic
cons_nonlinear.h
constraint handler for nonlinear constraints
prop_nlobbt.h
nonlinear OBBT propagator
heur_rins.h
LNS heuristic that combines the incumbent with the LP optimum.
prop_obbt.h
optimization-based bound tightening propagator
presol_implics.h
implication graph presolver which checks for aggregations
heur_feaspump.h
Objective Feasibility Pump 2.0.
prop_orbitalfixing.h
propagator for orbital fixing
event_softtimelimit.h
eventhdlr for soft time limit
heur_vbounds.h
LNS heuristic uses the variable lower and upper bounds to determine the search neighborhood.
event_solvingphase.h
eventhdlr for solving phase dependent parameter adjustment
sepa_gomory.h
Gomory MIR Cuts.
heur_reoptsols.h
reoptsols primal heuristic
cons_bivariate.h
constraint handler for bivariate nonlinear constraints
cons_linear.h
Constraint handler for linear constraints in their most general form, .
heur_locks.h
locks primal heuristic
nlpi_all.h
ALL NLP interface.
cons_abspower.h
Constraint handler for absolute power constraints .
sepa_intobj.h
integer objective value separator
heur_zirounding.h
ZI Round primal heuristic.
sepa_zerohalf.h
{0,1/2}-cuts separator
presol_tworowbnd.h
do bound tightening by using two rows
heur_linesearchdiving.h
LP diving heuristic that fixes variables with a large difference to their root solution.
reader_gms.h
GAMS file reader and writer.
branch_mostinf.h
most infeasible LP branching rule
sepa_impliedbounds.h
implied bounds separator
branch_allfullstrong.h
all variables full strong LP branching rule
cons_xor.h
Constraint handler for XOR constraints, .
heur_dins.h
DINS primal heuristic.
heur_distributiondiving.h
Diving heuristic that chooses fixings w.r.t. changes in the solution density after Pryor and Chinneck...
presol_redvub.h
remove redundant variable upper bound constraints
presol_dualinfer.h
dual inference presolver
reader_lp.h
LP file reader.
reader_opb.h
pseudo-Boolean file reader (opb format)
nodesel_bfs.h
node selector for best first search
heur_zeroobj.h
heuristic that tries to solve the problem without objective. In Gurobi, this heuristic is known as "H...
cons_cardinality.h
constraint handler for cardinality constraints
prop_probing.h
probing propagator
reader_fzn.h
FlatZinc file reader.
presol_symmetry.h
presolver for storing symmetry information about current problem
reader_sol.h
file reader for primal solutions
heur_subnlp.h
NLP local search primal heuristic using sub-SCIPs.
sepa_cgmip.h
Chvatal-Gomory cuts computed via a sub-MIP.
cons_benderslp.h
constraint handler for benderslp decomposition
heur_veclendiving.h
LP diving heuristic that rounds variables with long column vectors.
cons_integral.h
constraint handler for the integrality constraint
branch_inference.h
inference history branching rule
reader_smps.h
SMPS file reader - SMPS files lists the cor, tim and sto files for a single instance to be read...
presol_gateextraction.h
gateextraction presolver
cons_sos1.h
constraint handler for SOS type 1 constraints
benders_default.h
default Benders&#39; decomposition plugin
heur_conflictdiving.h
LP diving heuristic that chooses fixings w.r.t. conflict locks.
sepa_rapidlearning.h
rapidlearning separator
heur_simplerounding.h
Simple and fast LP rounding heuristic.
compr_largestrepr.h
largestrepr tree compression
presol_inttobinary.h
presolver that converts integer variables with domain [a,a+1] to binaries
reader_mst.h
file reader for partial primal solutions
sepa_strongcg.h
Strong CG Cuts (Letchford & Lodi)
heur_octane.h
octane primal heuristic based on Balas, Ceria, Dawande, Margot, and Pataki
heur_randrounding.h
randomized LP rounding heuristic which also generates conflicts via an auxiliary probing tree ...
cons_pseudoboolean.h
constraint handler for pseudoboolean constraints
cons_sos2.h
constraint handler for SOS type 2 constraints
nodesel_uct.h
uct node selector which balances exploration and exploitation by considering node visits ...
sepa_clique.h
clique separator
heur_intshifting.h
LP rounding heuristic that tries to recover from intermediate infeasibilities, shifts integer variabl...
cons_bounddisjunction.h
constraint handler for bound disjunction constraints
heur_objpscostdiving.h
LP diving heuristic that changes variable&#39;s objective value instead of bounds, using pseudo cost valu...
prop_dualfix.h
fixing roundable variables to best bound
branch_lookahead.h
lookahead LP branching rule
sepa_oddcycle.h
oddcycle separator
nodesel_dfs.h
node selector for depth first search
heur_proximity.h
improvement heuristic which uses an auxiliary objective instead of the original objective function wh...
nodesel_breadthfirst.h
node selector for breadth-first search
scip.h
SCIP callable library.
heur_lpface.h
LNS heuristic that tries to compute integral solution on optimal LP face.
heur_multistart.h
multistart heuristic for convex and nonconvex MINLPs
reader_mps.h
(extended) MPS file reader
heur_bound.h
heuristic which fixes all integer variables to a bound (lower/upper) and solves the remaining LP ...
prop_genvbounds.h
generalized variable bounds propagator
presol_boundshift.h
presolver that converts integer variables with domain [a,b] to integer variables with domain [0...
presol_qpkktref.h
qpkktref presolver
heur_ofins.h
OFINS - Objective Function Induced Neighborhood Search - a primal heuristic for reoptimization.