80#define SCIP_DEFAULT_BRANCH_SCOREFUNC 'p'
81#define SCIP_DEFAULT_BRANCH_SCOREFAC 0.167
83#define SCIP_DEFAULT_BRANCH_PREFERBINARY FALSE
84#define SCIP_DEFAULT_BRANCH_CLAMP 0.2
86#define SCIP_DEFAULT_BRANCH_MIDPULL 0.75
87#define SCIP_DEFAULT_BRANCH_MIDPULLRELDOMTRIG 0.5
88#define SCIP_DEFAULT_BRANCH_LPGAINNORMALIZE 's'
89#define SCIP_DEFAULT_BRANCH_DELAYPSCOST TRUE
90#define SCIP_DEFAULT_BRANCH_DIVINGPSCOST TRUE
91#define SCIP_DEFAULT_BRANCH_FORCEALL FALSE
93#define SCIP_DEFAULT_BRANCH_FIRSTSBCHILD 'a'
94#define SCIP_DEFAULT_BRANCH_CHECKSBSOL TRUE
95#define SCIP_DEFAULT_BRANCH_ROUNDSBSOL TRUE
96#define SCIP_DEFAULT_BRANCH_SUMADJUSTSCORE FALSE
100#define SCIP_DEFAULT_COMPR_ENABLE FALSE
105#define SCIP_DEFAULT_CONF_ENABLE TRUE
106#define SCIP_DEFAULT_CONF_MAXVARSFAC 0.15
107#define SCIP_DEFAULT_CONF_MINMAXVARS 0
108#define SCIP_DEFAULT_CONF_MAXLPLOOPS 2
110#define SCIP_DEFAULT_CONF_LPITERATIONS 10
112#define SCIP_DEFAULT_CONF_USEPROP TRUE
113#define SCIP_DEFAULT_CONF_USEINFLP 'b'
116#define SCIP_DEFAULT_CONF_USEBOUNDLP 'b'
119#define SCIP_DEFAULT_CONF_USESB TRUE
121#define SCIP_DEFAULT_CONF_USEPSEUDO TRUE
122#define SCIP_DEFAULT_CONF_PREFINFPROOF TRUE
123#define SCIP_DEFAULT_CONF_SEPARATE TRUE
124#define SCIP_DEFAULT_CONF_DYNAMIC TRUE
129#define SCIP_DEFAULT_CONF_MAXSTORESIZE 10000
130#define SCIP_DEFAULT_CONF_RECONVLEVELS -1
132#define SCIP_DEFAULT_CONF_CLEANBNDDEPEND TRUE
133#define SCIP_DEFAULT_CONF_FUIPLEVELS -1
135#define SCIP_DEFAULT_CONF_INTERCONSS -1
137#define SCIP_DEFAULT_CONF_MAXCONSS 10
139#define SCIP_DEFAULT_CONF_PREFERBINARY FALSE
140#define SCIP_DEFAULT_CONF_ALLOWLOCAL TRUE
141#define SCIP_DEFAULT_CONF_SETTLELOCAL FALSE
143#define SCIP_DEFAULT_CONF_REPROPAGATE TRUE
145#define SCIP_DEFAULT_CONF_KEEPREPROP TRUE
146#define SCIP_DEFAULT_CONF_REMOVEABLE TRUE
147#define SCIP_DEFAULT_CONF_DEPTHSCOREFAC 1.0
148#define SCIP_DEFAULT_CONF_PROOFSCOREFAC 1.0
149#define SCIP_DEFAULT_CONF_UPLOCKSCOREFAC 0.0
150#define SCIP_DEFAULT_CONF_DOWNLOCKSCOREFAC 0.0
151#define SCIP_DEFAULT_CONF_SCOREFAC 0.98
152#define SCIP_DEFAULT_CONF_RESTARTNUM 0
154#define SCIP_DEFAULT_CONF_RESTARTFAC 1.5
155#define SCIP_DEFAULT_CONF_IGNORERELAXEDBD FALSE
156#define SCIP_DEFAULT_CONF_MAXVARSDETECTIMPLIEDBOUNDS 250
157#define SCIP_DEFAULT_CONF_FULLSHORTENCONFLICT TRUE
158#define SCIP_DEFAULT_CONF_CONFLITWEIGHT 0.0
159#define SCIP_DEFAULT_CONF_CONFLITGRAPHWEIGHT 1.0
160#define SCIP_DEFAULT_CONF_WEIGHTSIZE 0.001
161#define SCIP_DEFAULT_CONF_WEIGHTREPROPDEPTH 0.1
162#define SCIP_DEFAULT_CONF_WEIGHTVALIDDEPTH 1.0
163#define SCIP_DEFAULT_CONF_MINIMPROVE 0.05
167#define SCIP_DEFAULT_CONF_SEPAALTPROOFS FALSE
168#define SCIP_DEFAULT_CONF_USELOCALROWS TRUE
172#define SCIP_DEFAULT_CONS_AGELIMIT 0
174#define SCIP_DEFAULT_CONS_OBSOLETEAGE -1
176#define SCIP_DEFAULT_CONS_DISABLEENFOPS FALSE
181#define SCIP_DEFAULT_DISP_VERBLEVEL SCIP_VERBLEVEL_HIGH
182#define SCIP_DEFAULT_DISP_WIDTH 143
183#define SCIP_DEFAULT_DISP_FREQ 100
184#define SCIP_DEFAULT_DISP_HEADERFREQ 15
185#define SCIP_DEFAULT_DISP_LPINFO FALSE
186#define SCIP_DEFAULT_DISP_ALLVIOLS FALSE
187#define SCIP_DEFAULT_DISP_RELEVANTSTATS TRUE
191#define SCIP_DEFAULT_HEUR_USEUCTSUBSCIP FALSE
195#define SCIP_DEFAULT_HISTORY_VALUEBASED FALSE
196#define SCIP_DEFAULT_HISTORY_ALLOWMERGE FALSE
197#define SCIP_DEFAULT_HISTORY_ALLOWTRANSFER FALSE
201#define SCIP_DEFAULT_LIMIT_TIME 1e+20
202#define SCIP_DEFAULT_LIMIT_MEMORY SCIP_MEM_NOLIMIT
203#define SCIP_DEFAULT_LIMIT_GAP 0.0
204#define SCIP_DEFAULT_LIMIT_ABSGAP 0.0
206#define SCIP_DEFAULT_LIMIT_NODES -1LL
207#define SCIP_DEFAULT_LIMIT_STALLNODES -1LL
209#define SCIP_DEFAULT_LIMIT_SOLUTIONS -1
210#define SCIP_DEFAULT_LIMIT_BESTSOL -1
212#define SCIP_DEFAULT_LIMIT_MAXSOL 100
213#define SCIP_DEFAULT_LIMIT_MAXORIGSOL 10
214#define SCIP_DEFAULT_LIMIT_RESTARTS -1
215#define SCIP_DEFAULT_LIMIT_AUTORESTARTNODES -1
220#define SCIP_DEFAULT_LP_SOLVEFREQ 1
221#define SCIP_DEFAULT_LP_ITERLIM -1LL
222#define SCIP_DEFAULT_LP_ROOTITERLIM -1LL
223#define SCIP_DEFAULT_LP_SOLVEDEPTH -1
224#define SCIP_DEFAULT_LP_INITALGORITHM 's'
226#define SCIP_DEFAULT_LP_RESOLVEALGORITHM 's'
228#define SCIP_DEFAULT_LP_PRICING 'l'
231#define SCIP_DEFAULT_LP_CLEARINITIALPROBINGLP TRUE
233#define SCIP_DEFAULT_LP_RESOLVERESTORE FALSE
234#define SCIP_DEFAULT_LP_FREESOLVALBUFFERS FALSE
235#define SCIP_DEFAULT_LP_COLAGELIMIT 10
237#define SCIP_DEFAULT_LP_ROWAGELIMIT 10
239#define SCIP_DEFAULT_LP_CLEANUPCOLS FALSE
240#define SCIP_DEFAULT_LP_CLEANUPCOLSROOT FALSE
241#define SCIP_DEFAULT_LP_CLEANUPROWS TRUE
242#define SCIP_DEFAULT_LP_CLEANUPROWSROOT TRUE
243#define SCIP_DEFAULT_LP_CHECKSTABILITY TRUE
244#define SCIP_DEFAULT_LP_CONDITIONLIMIT -1.0
245#define SCIP_DEFAULT_LP_MARKOWITZ 0.01
246#define SCIP_DEFAULT_LP_CHECKPRIMFEAS TRUE
247#define SCIP_DEFAULT_LP_CHECKDUALFEAS TRUE
248#define SCIP_DEFAULT_LP_CHECKFARKAS TRUE
249#define SCIP_DEFAULT_LP_FASTMIP 1
250#define SCIP_DEFAULT_LP_SCALING 1
251#define SCIP_DEFAULT_LP_PRESOLVING TRUE
252#define SCIP_DEFAULT_LP_LEXDUALALGO FALSE
253#define SCIP_DEFAULT_LP_LEXDUALROOTONLY TRUE
254#define SCIP_DEFAULT_LP_LEXDUALMAXROUNDS 2
255#define SCIP_DEFAULT_LP_LEXDUALBASIC FALSE
256#define SCIP_DEFAULT_LP_LEXDUALSTALLING TRUE
257#define SCIP_DEFAULT_LP_DISABLECUTOFF 2
258#define SCIP_DEFAULT_LP_ROWREPSWITCH 1.2
260#define SCIP_DEFAULT_LP_THREADS 0
261#define SCIP_DEFAULT_LP_RESOLVEITERFAC -1.0
263#define SCIP_DEFAULT_LP_RESOLVEITERMIN 1000
264#define SCIP_DEFAULT_LP_SOLUTIONPOLISHING 3
265#define SCIP_DEFAULT_LP_REFACTORINTERVAL 0
266#define SCIP_DEFAULT_LP_ALWAYSGETDUALS FALSE
270#define SCIP_DEFAULT_NLP_SOLVER ""
271#define SCIP_DEFAULT_NLP_DISABLE FALSE
276#define SCIP_DEFAULT_MEM_SAVEFAC 0.8
277#define SCIP_DEFAULT_MEM_TREEGROWFAC 2.0
278#define SCIP_DEFAULT_MEM_PATHGROWFAC 2.0
279#define SCIP_DEFAULT_MEM_TREEGROWINIT 65536
280#define SCIP_DEFAULT_MEM_PATHGROWINIT 256
285#define SCIP_DEFAULT_MISC_CATCHCTRLC TRUE
286#define SCIP_DEFAULT_MISC_USEVARTABLE TRUE
287#define SCIP_DEFAULT_MISC_USECONSTABLE TRUE
288#define SCIP_DEFAULT_MISC_USESMALLTABLES FALSE
289#define SCIP_DEFAULT_MISC_EXACTSOLVE FALSE
290#define SCIP_DEFAULT_MISC_RESETSTAT TRUE
295#define SCIP_DEFAULT_MISC_IMPROVINGSOLS FALSE
296#define SCIP_DEFAULT_MISC_PRINTREASON TRUE
297#define SCIP_DEFAULT_MISC_ESTIMEXTERNMEM TRUE
298#define SCIP_DEFAULT_MISC_AVOIDMEMOUT TRUE
299#define SCIP_DEFAULT_MISC_TRANSORIGSOLS TRUE
300#define SCIP_DEFAULT_MISC_TRANSSOLSORIG TRUE
301#define SCIP_DEFAULT_MISC_CALCINTEGRAL TRUE
302#define SCIP_DEFAULT_MISC_FINITESOLSTORE FALSE
303#define SCIP_DEFAULT_MISC_OUTPUTORIGSOL TRUE
304#define SCIP_DEFAULT_MISC_ALLOWSTRONGDUALREDS TRUE
305#define SCIP_DEFAULT_MISC_ALLOWWEAKDUALREDS TRUE
306#define SCIP_DEFAULT_MISC_REFERENCEVALUE 1e99
307#define SCIP_DEFAULT_MISC_USESYMMETRY 7
311#define SCIP_DEFAULT_MISC_SCALEOBJ TRUE
312#define SCIP_DEFAULT_MISC_SHOWDIVINGSTATS FALSE
314#ifdef WITH_DEBUG_SOLUTION
315#define SCIP_DEFAULT_MISC_DEBUGSOLUTION "-"
319#define SCIP_DEFAULT_RANDOM_RANDSEEDSHIFT 0
320#define SCIP_DEFAULT_RANDOM_PERMUTATIONSEED 0
321#define SCIP_DEFAULT_RANDOM_LPSEED 0
322#define SCIP_DEFAULT_RANDOM_PERMUTECONSS TRUE
323#define SCIP_DEFAULT_RANDOM_PERMUTEVARS FALSE
328#define SCIP_DEFAULT_NODESEL_CHILDSEL 'h'
334#define SCIP_DEFAULT_PRESOL_ABORTFAC 8e-04
336#define SCIP_DEFAULT_PRESOL_MAXROUNDS -1
337#define SCIP_DEFAULT_PRESOL_MAXRESTARTS -1
338#define SCIP_DEFAULT_PRESOL_CLQTABLEFAC 2.0
339#define SCIP_DEFAULT_PRESOL_RESTARTFAC 0.025
341#define SCIP_DEFAULT_PRESOL_IMMRESTARTFAC 0.10
343#define SCIP_DEFAULT_PRESOL_SUBRESTARTFAC 1.00
345#define SCIP_DEFAULT_PRESOL_RESTARTMINRED 0.10
347#define SCIP_DEFAULT_PRESOL_DONOTMULTAGGR FALSE
348#define SCIP_DEFAULT_PRESOL_DONOTAGGR FALSE
353#define SCIP_DEFAULT_PRICE_ABORTFAC 2.0
355#define SCIP_DEFAULT_PRICE_MAXVARS 100
356#define SCIP_DEFAULT_PRICE_MAXVARSROOT 2000
357#define SCIP_DEFAULT_PRICE_DELVARS FALSE
359#define SCIP_DEFAULT_PRICE_DELVARSROOT FALSE
363#define SCIP_DEFAULT_DECOMP_BENDERSLABELS FALSE
364#define SCIP_DEFAULT_DECOMP_APPLYBENDERS FALSE
365#define SCIP_DEFAULT_DECOMP_MAXGRAPHEDGE 10000
366#define SCIP_DEFAULT_DECOMP_DISABLEMEASURES FALSE
369#define SCIP_DEFAULT_BENDERS_SOLTOL 1e-6
370#define SCIP_DEFAULT_BENDERS_CUTLPSOL TRUE
371#define SCIP_DEFAULT_BENDERS_COPYBENDERS TRUE
375#define SCIP_DEFAULT_REOPT_OBJSIMSOL -1.0
377#define SCIP_DEFAULT_REOPT_OBJSIMROOTLP 0.8
378#define SCIP_DEFAULT_REOPT_OBJSIMDELAY -1.0
380#define SCIP_DEFAULT_REOPT_VARORDERINTERDICTION 'd'
384#define SCIP_DEFAULT_REOPT_MAXSAVEDNODES INT_MAX
385#define SCIP_DEFAULT_REOPT_MAXDIFFOFNODES INT_MAX
387#define SCIP_DEFAULT_REOPT_FORCEHEURRESTART 3
390#define SCIP_DEFAULT_REOPT_SAVESOLS INT_MAX
391#define SCIP_DEFAULT_REOPT_SOLVELP 1
392#define SCIP_DEFAULT_REOPT_SOLVELPDIFF 1
393#define SCIP_DEFAULT_REOPT_ENABLE FALSE
394#define SCIP_DEFAULT_REOPT_SEPAGLBINFSUBTREES TRUE
395#define SCIP_DEFAULT_REOPT_SEPABESTSOL FALSE
398#define SCIP_DEFAULT_REOPT_STOREVARHISTOTY FALSE
401#define SCIP_DEFAULT_REOPT_USEPSCOST FALSE
402#define SCIP_DEFAULT_REOPT_COMMONTIMELIMIT FALSE
403#define SCIP_DEFAULT_REOPT_SHRINKINNER TRUE
406#define SCIP_DEFAULT_REOPT_STRONGBRANCHINIT TRUE
409#define SCIP_DEFAULT_REOPT_REDUCETOFRONTIER TRUE
410#define SCIP_DEFAULT_REOPT_SAVECONSPROP FALSE
411#define SCIP_DEFAULT_REOPT_USESPLITCONS TRUE
414#define SCIP_DEFAULT_REOPT_USECUTS FALSE
415#define SCIP_DEFAULT_REOPT_MAXCUTAGE 0
419#define SCIP_DEFAULT_PROP_MAXROUNDS 100
420#define SCIP_DEFAULT_PROP_MAXROUNDSROOT 1000
421#define SCIP_DEFAULT_PROP_ABORTONCUTOFF TRUE
427#define SCIP_DEFAULT_SEPA_MAXBOUNDDIST 1.0
430#define SCIP_DEFAULT_SEPA_MAXLOCALBOUNDDIST 0.0
433#define SCIP_DEFAULT_SEPA_MAXCOEFRATIO 1e+4
434#define SCIP_DEFAULT_SEPA_MAXCOEFRATIOFACROWPREP 10.0
435#define SCIP_DEFAULT_SEPA_MINEFFICACY 1e-4
436#define SCIP_DEFAULT_SEPA_MINEFFICACYROOT 1e-4
437#define SCIP_DEFAULT_SEPA_ORTHOFUNC 'e'
438#define SCIP_DEFAULT_SEPA_EFFICACYNORM 'e'
440#define SCIP_DEFAULT_SEPA_CUTSELRESTART 'a'
441#define SCIP_DEFAULT_SEPA_CUTSELSUBSCIP 'a'
442#define SCIP_DEFAULT_SEPA_FILTERCUTPOOLREL TRUE
443#define SCIP_DEFAULT_SEPA_MAXRUNS -1
444#define SCIP_DEFAULT_SEPA_MAXROUNDS -1
445#define SCIP_DEFAULT_SEPA_MAXROUNDSROOT -1
446#define SCIP_DEFAULT_SEPA_MAXROUNDSROOTSUBRUN -1
447#define SCIP_DEFAULT_SEPA_MAXADDROUNDS 1
449#define SCIP_DEFAULT_SEPA_MAXSTALLROUNDSROOT 10
451#define SCIP_DEFAULT_SEPA_MAXSTALLROUNDS 1
453#define SCIP_DEFAULT_SEPA_MAXCUTS 100
454#define SCIP_DEFAULT_SEPA_MAXCUTSROOT 2000
455#define SCIP_DEFAULT_SEPA_CUTAGELIMIT 80
457#define SCIP_DEFAULT_SEPA_POOLFREQ 10
458#define SCIP_DEFAULT_SEPA_MINACTIVITYQUOT 0.8
462#define SCIP_DEFAULT_PARALLEL_MODE 1
464#define SCIP_DEFAULT_PARALLEL_MINNTHREADS 1
465#define SCIP_DEFAULT_PARALLEL_MAXNTHREADS 8
468#define SCIP_DEFAULT_CONCURRENT_CHANGESEEDS TRUE
469#define SCIP_DEFAULT_CONCURRENT_CHANGECHILDSEL TRUE
470#define SCIP_DEFAULT_CONCURRENT_COMMVARBNDS TRUE
471#define SCIP_DEFAULT_CONCURRENT_PRESOLVEBEFORE TRUE
472#define SCIP_DEFAULT_CONCURRENT_INITSEED 5131912
473#define SCIP_DEFAULT_CONCURRENT_FREQINIT 10.0
475#define SCIP_DEFAULT_CONCURRENT_FREQMAX 10.0
477#define SCIP_DEFAULT_CONCURRENT_FREQFACTOR 1.5
478#define SCIP_DEFAULT_CONCURRENT_TARGETPROGRESS 0.001
480#define SCIP_DEFAULT_CONCURRENT_MAXNSOLS 3
481#define SCIP_DEFAULT_CONCURRENT_MAXNSYNCDELAY 7
482#define SCIP_DEFAULT_CONCURRENT_MINSYNCDELAY 10.0
483#define SCIP_DEFAULT_CONCURRENT_NBESTSOLS 10
484#define SCIP_DEFAULT_CONCURRENT_PARAMSETPREFIX ""
489#define SCIP_DEFAULT_TIME_CLOCKTYPE SCIP_CLOCKTYPE_WALL
490#define SCIP_DEFAULT_TIME_ENABLED TRUE
491#define SCIP_DEFAULT_TIME_READING FALSE
492#define SCIP_DEFAULT_TIME_RARECLOCKCHECK FALSE
493#define SCIP_DEFAULT_TIME_STATISTICTIMING TRUE
494#define SCIP_DEFAULT_TIME_NLPIEVAL FALSE
499#define SCIP_DEFAULT_VISUAL_VBCFILENAME "-"
500#define SCIP_DEFAULT_VISUAL_BAKFILENAME "-"
501#define SCIP_DEFAULT_VISUAL_REALTIME TRUE
502#define SCIP_DEFAULT_VISUAL_DISPSOLS FALSE
503#define SCIP_DEFAULT_VISUAL_DISPLB FALSE
504#define SCIP_DEFAULT_VISUAL_OBJEXTERN TRUE
509#define SCIP_DEFAULT_READ_INITIALCONSS TRUE
510#define SCIP_DEFAULT_READ_DYNAMICCONSS TRUE
511#define SCIP_DEFAULT_READ_DYNAMICCOLS FALSE
512#define SCIP_DEFAULT_READ_DYNAMICROWS FALSE
513#define SCIP_DEFAULT_WRITE_GENNAMES_OFFSET 0
520#define SCIP_DEFAULT_WRITE_ALLCONSS FALSE
521#define SCIP_DEFAULT_PRINTZEROS FALSE
642 SCIPerrorMessage(
"The infinity value of the LP solver has to be at least as large as the one of SCIP.\n");
727 SCIPerrorMessage(
"Cannot turn on symmetry handling during (pre)solving or change method.\n");
744 if(
set->reopt_enable )
804 for(
i =
set->nreaders - 1;
i >= 0; --
i )
807 for(
i =
set->npricers - 1;
i >= 0; --
i )
810 for(
i =
set->nconshdlrs - 1;
i >= 0; --
i )
813 for(
i =
set->nconflicthdlrs - 1;
i >= 0; --
i )
816 for(
i =
set->npresols - 1;
i >= 0; --
i )
819 for(
i =
set->nrelaxs - 1;
i >= 0; --
i )
822 for(
i =
set->nsepas - 1;
i >= 0; --
i )
825 for(
i =
set->nprops - 1;
i >= 0; --
i )
828 for(
i =
set->nheurs - 1;
i >= 0; --
i )
831 for(
i =
set->neventhdlrs - 1;
i >= 0; --
i )
834 for(
i =
set->nnodesels - 1;
i >= 0; --
i )
837 for (
i =
set->ncutsels - 1;
i >= 0; --
i )
840 for(
i =
set->nbranchrules - 1;
i >= 0; --
i )
1113 (*set)->scip =
scip;
1119 (*set)->readers =
NULL;
1120 (*set)->nreaders = 0;
1121 (*set)->readerssize = 0;
1122 (*set)->pricers =
NULL;
1123 (*set)->npricers = 0;
1124 (*set)->nactivepricers = 0;
1125 (*set)->pricerssize = 0;
1126 (*set)->pricerssorted =
FALSE;
1127 (*set)->pricersnamesorted =
FALSE;
1128 (*set)->conshdlrs =
NULL;
1129 (*set)->conshdlrs_sepa =
NULL;
1130 (*set)->conshdlrs_enfo =
NULL;
1131 (*set)->conshdlrs_include =
NULL;
1132 (*set)->nconshdlrs = 0;
1133 (*set)->conshdlrssize = 0;
1134 (*set)->conflicthdlrs =
NULL;
1135 (*set)->nconflicthdlrs = 0;
1136 (*set)->conflicthdlrssize = 0;
1137 (*set)->conflicthdlrssorted =
FALSE;
1138 (*set)->conflicthdlrsnamesorted =
FALSE;
1139 (*set)->benders =
NULL;
1140 (*set)->nbenders = 0;
1141 (*set)->nactivebenders = 0;
1142 (*set)->benderssize = 0;
1143 (*set)->benderssorted =
FALSE;
1144 (*set)->bendersnamesorted =
FALSE;
1146 (*set)->debugsoldata =
NULL;
1149 (*set)->presols =
NULL;
1150 (*set)->npresols = 0;
1151 (*set)->presolssize = 0;
1152 (*set)->presolssorted =
FALSE;
1153 (*set)->presolsnamesorted =
FALSE;
1154 (*set)->relaxs =
NULL;
1155 (*set)->nrelaxs = 0;
1156 (*set)->relaxssize = 0;
1157 (*set)->relaxssorted =
FALSE;
1158 (*set)->relaxsnamesorted =
FALSE;
1159 (*set)->sepas =
NULL;
1161 (*set)->sepassize = 0;
1162 (*set)->sepassorted =
FALSE;
1163 (*set)->sepasnamesorted =
FALSE;
1164 (*set)->props =
NULL;
1165 (*set)->props_presol =
NULL;
1167 (*set)->propssize = 0;
1168 (*set)->propssorted =
FALSE;
1169 (*set)->propspresolsorted =
FALSE;
1170 (*set)->propsnamesorted =
FALSE;
1171 (*set)->concsolvertypes =
NULL;
1172 (*set)->nconcsolvertypes = 0;
1173 (*set)->concsolvertypessize = 0;
1174 (*set)->concsolvers =
NULL;
1175 (*set)->nconcsolvers = 0;
1176 (*set)->concsolverssize = 0;
1177 (*set)->concurrent_paramsetprefix =
NULL;
1178 (*set)->cutsels =
NULL;
1179 (*set)->ncutsels = 0;
1180 (*set)->cutselssize = 0;
1181 (*set)->cutselssorted =
FALSE;
1182 (*set)->heurs =
NULL;
1184 (*set)->heurssize = 0;
1185 (*set)->heurssorted =
FALSE;
1186 (*set)->heursnamesorted =
FALSE;
1187 (*set)->comprs =
NULL;
1188 (*set)->ncomprs = 0;
1189 (*set)->comprssize = 0;
1190 (*set)->comprssorted =
FALSE;
1191 (*set)->comprsnamesorted =
FALSE;
1192 (*set)->eventhdlrs =
NULL;
1193 (*set)->neventhdlrs = 0;
1194 (*set)->eventhdlrssize = 0;
1195 (*set)->nodesels =
NULL;
1196 (*set)->nnodesels = 0;
1197 (*set)->nodeselssize = 0;
1198 (*set)->nodesel =
NULL;
1199 (*set)->branchrules =
NULL;
1200 (*set)->nbranchrules = 0;
1201 (*set)->branchrulessize = 0;
1202 (*set)->branchrulessorted =
FALSE;
1203 (*set)->branchrulesnamesorted =
FALSE;
1204 (*set)->banditvtables =
NULL;
1205 (*set)->banditvtablessize = 0;
1206 (*set)->nbanditvtables = 0;
1207 (*set)->disps =
NULL;
1209 (*set)->dispssize = 0;
1210 (*set)->tables =
NULL;
1211 (*set)->ntables = 0;
1212 (*set)->tablessize = 0;
1213 (*set)->tablessorted =
FALSE;
1214 (*set)->dialogs =
NULL;
1215 (*set)->ndialogs = 0;
1216 (*set)->dialogssize = 0;
1217 (*set)->exprhdlrs =
NULL;
1218 (*set)->exprhdlrvar =
NULL;
1219 (*set)->exprhdlrval =
NULL;
1220 (*set)->exprhdlrsum =
NULL;
1221 (*set)->exprhdlrproduct =
NULL;
1222 (*set)->exprhdlrpow =
NULL;
1223 (*set)->nexprhdlrs = 0;
1224 (*set)->exprhdlrssize = 0;
1225 (*set)->exprhdlrssorted =
FALSE;
1226 (*set)->nlpis =
NULL;
1228 (*set)->nlpissize = 0;
1229 (*set)->nlpissorted =
FALSE;
1230 (*set)->limitchanged =
FALSE;
1231 (*set)->subscipsoff =
FALSE;
1232 (*set)->extcodenames =
NULL;
1233 (*set)->extcodedescs =
NULL;
1234 (*set)->nextcodes = 0;
1235 (*set)->extcodessize = 0;
1236 (*set)->visual_vbcfilename =
NULL;
1237 (*set)->visual_bakfilename =
NULL;
1238 (*set)->nlp_solver =
NULL;
1239 (*set)->nlp_disable =
FALSE;
1241 (*set)->misc_debugsol =
NULL;
1244 (*set)->istimelimitfinite =
FALSE;
1248 "branching/scorefunc",
1249 "branching score function ('s'um, 'p'roduct, 'q'uotient)",
1253 "branching/scorefac",
1254 "branching score factor to weigh downward and upward gain prediction in sum score function",
1258 "branching/preferbinary",
1259 "should branching on binary variables be preferred?",
1264 "minimal relative distance of branching point to bounds when branching on a continuous variable",
1268 "branching/midpull",
1269 "fraction by which to move branching point of a continuous variable towards the middle of the domain; a value of 1.0 leads to branching always in the middle of the domain",
1273 "branching/midpullreldomtrig",
1274 "multiply midpull by relative domain width if the latter is below this value",
1278 "branching/lpgainnormalize",
1279 "strategy for normalization of LP gain when updating pseudocosts of continuous variables (divide by movement of 'l'p value, reduction in 'd'omain width, or reduction in domain width of 's'ibling)",
1283 "branching/delaypscostupdate",
1284 "should updating pseudo costs for continuous variables be delayed to the time after separation?",
1288 "branching/divingpscost",
1289 "should pseudo costs be updated also in diving and probing mode?",
1293 "branching/forceallchildren",
1294 "should all strong branching children be regarded even if one is detected to be infeasible? (only with propagation)",
1298 "branching/firstsbchild",
1299 "child node to be regarded first during strong branching (only with propagation): 'u'p child, 'd'own child, 'h'istory-based, or 'a'utomatic",
1303 "branching/checksol",
1304 "should LP solutions during strong branching with propagation be checked for feasibility?",
1308 "branching/roundsbsol",
1309 "should LP solutions during strong branching with propagation be rounded? (only when checksbsol=TRUE)",
1313 "branching/sumadjustscore",
1314 "score adjustment near zero by adding epsilon (TRUE) or using maximum (FALSE)",
1320 "compression/enable",
1321 "should automatic tree compression after the presolving be enabled?",
1328 "should conflict analysis be enabled?",
1332 "conflict/cleanboundexceedings",
1333 "should conflicts based on an old cutoff bound be removed from the conflict pool after improving the primal bound?",
1337 "conflict/uselocalrows",
1338 "use local rows to construct infeasibility proofs",
1343 "should propagation conflict analysis be used?",
1347 "conflict/useinflp",
1348 "should infeasible LP conflict analysis be used? ('o'ff, 'c'onflict graph, 'd'ual ray, 'b'oth conflict graph and dual ray)",
1352 "conflict/useboundlp",
1353 "should bound exceeding LP conflict analysis be used? ('o'ff, 'c'onflict graph, 'd'ual ray, 'b'oth conflict graph and dual ray)",
1358 "should infeasible/bound exceeding strong branching conflict analysis be used?",
1362 "conflict/usepseudo",
1363 "should pseudo solution conflict analysis be used?",
1367 "conflict/maxvarsfac",
1368 "maximal fraction of variables involved in a conflict constraint",
1372 "conflict/minmaxvars",
1373 "minimal absolute maximum of variables involved in a conflict constraint",
1377 "conflict/maxlploops",
1378 "maximal number of LP resolving loops during conflict analysis (-1: no limit)",
1382 "conflict/lpiterations",
1383 "maximal number of LP iterations in each LP resolving loop (-1: no limit)",
1387 "conflict/fuiplevels",
1388 "number of depth levels up to which first UIP's are used in conflict analysis (-1: use All-FirstUIP rule)",
1392 "conflict/interconss",
1393 "maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)",
1397 "conflict/reconvlevels",
1398 "number of depth levels up to which UIP reconvergence constraints are generated (-1: generate reconvergence constraints in all depth levels)",
1402 "conflict/maxconss",
1403 "maximal number of conflict constraints accepted at an infeasible node (-1: use all generated conflict constraints)",
1407 "conflict/maxstoresize",
1408 "maximal size of conflict store (-1: auto, 0: disable storage)",
1412 "conflict/preferbinary",
1413 "should binary conflicts be preferred?",
1417 "conflict/prefinfproof",
1418 "prefer infeasibility proof to boundexceeding proof",
1422 "conflict/allowlocal",
1423 "should conflict constraints be generated that are only valid locally?",
1427 "conflict/settlelocal",
1428 "should conflict constraints be attached only to the local subtree where they can be useful?",
1432 "conflict/repropagate",
1433 "should earlier nodes be repropagated in order to replace branching decisions by deductions?",
1437 "conflict/keepreprop",
1438 "should constraints be kept for repropagation even if they are too long?",
1442 "conflict/separate",
1443 "should the conflict constraints be separated?",
1448 "should the conflict constraints be subject to aging?",
1452 "conflict/removable",
1453 "should the conflict's relaxations be subject to LP aging and cleanup?",
1457 "conflict/graph/depthscorefac",
1458 "score factor for depth level in bound relaxation heuristic",
1462 "conflict/proofscorefac",
1463 "score factor for impact on acticity in bound relaxation heuristic",
1467 "conflict/uplockscorefac",
1468 "score factor for up locks in bound relaxation heuristic",
1472 "conflict/downlockscorefac",
1473 "score factor for down locks in bound relaxation heuristic",
1477 "conflict/scorefac",
1478 "factor to decrease importance of variables' earlier conflict scores",
1482 "conflict/restartnum",
1483 "number of successful conflict analysis calls that trigger a restart (0: disable conflict restarts)",
1487 "conflict/restartfac",
1488 "factor to increase restartnum with after each restart",
1492 "conflict/ignorerelaxedbd",
1493 "should relaxed bounds be ignored?",
1497 "conflict/maxvarsdetectimpliedbounds",
1498 "maximal number of variables to try to detect global bound implications and shorten the whole conflict set (0: disabled)",
1502 "conflict/fullshortenconflict",
1503 "try to shorten the whole conflict set or terminate early (depending on the 'maxvarsdetectimpliedbounds' parameter)",
1507 "conflict/conflictweight",
1508 "the weight the VSIDS score is weight by updating the VSIDS for a variable if it is part of a conflict",
1512 "conflict/conflictgraphweight",
1513 "the weight the VSIDS score is weight by updating the VSIDS for a variable if it is part of a conflict graph",
1517 "conflict/minimprove",
1518 "minimal improvement of primal bound to remove conflicts based on a previous incumbent",
1521 "conflict/weightsize",
1522 "weight of the size of a conflict used in score calculation",
1525 "conflict/weightrepropdepth",
1526 "weight of the repropagation depth of a conflict used in score calculation",
1529 "conflict/weightvaliddepth",
1530 "weight of the valid depth of a conflict used in score calculation",
1533 "conflict/sepaaltproofs",
1534 "apply cut generating functions to construct alternative proofs",
1540 "constraints/agelimit",
1541 "maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)",
1545 "constraints/obsoleteage",
1546 "age of a constraint after which it is marked obsolete (0: dynamic, -1 do not mark constraints obsolete)",
1550 "constraints/disableenfops",
1551 "should enforcement of pseudo solution be disabled?",
1558 "display/verblevel",
1559 "verbosity level of output",
1565 "maximal number of characters in a node information line",
1570 "frequency for displaying node information lines",
1574 "display/headerfreq",
1575 "frequency for displaying header lines (every n'th node information line)",
1580 "should the LP solver display status messages?",
1585 "display all violations for a given start solution / the best solution after the solving process?",
1589 "display/relevantstats",
1590 "should the relevant statistics be displayed at the end of solving?",
1596 "heuristics/useuctsubscip",
1597 "should setting of common subscip parameters include the activation of the UCT node selector?",
1602 "history/valuebased",
1603 "should statistics be collected for variable domain value pairs?",
1607 "history/allowmerge",
1608 "should variable histories be merged from sub-SCIPs whenever possible?",
1612 "history/allowtransfer",
1613 "should variable histories be transferred to initialize SCIP copies?",
1620 "maximal time in seconds to run",
1625 "maximal number of nodes to process (-1: no limit)",
1629 "limits/totalnodes",
1630 "maximal number of total nodes (incl. restarts) to process (-1: no limit)",
1634 "limits/stallnodes",
1635 "solving stops, if the given number of nodes was processed since the last improvement of the primal solution value (-1: no limit)",
1640 "maximal memory usage in MB; reported memory usage is lower than real memory usage!",
1645 "solving stops, if the relative gap = |primal - dual|/MIN(|dual|,|primal|) is below the given value, the gap is 'Infinity', if primal and dual bound have opposite signs",
1650 "solving stops, if the absolute gap = |primalbound - dualbound| is below the given value",
1655 "solving stops, if the given number of solutions were found; this limit is first checked in presolving (-1: no limit)",
1660 "solving stops, if the given number of solution improvements were found (-1: no limit)",
1665 "maximal number of solutions to store in the solution storage",
1669 "limits/maxorigsol",
1670 "maximal number of solutions candidates to store in the solution storage of the original problem",
1675 "solving stops, if the given number of restarts was triggered (-1: no limit)",
1680 "limits/autorestartnodes",
1681 "if solve exceeds this number of nodes for the first time, an automatic restart is triggered (-1: no automatic restart)",
1688 "frequency for solving LP at the nodes (-1: never; 0: only root LP)",
1693 "iteration limit for each single LP solve (-1: no limit)",
1698 "iteration limit for initial root LP solve (-1: no limit)",
1703 "maximal depth for solving LP at the nodes (-1: no depth limit)",
1708 "LP algorithm for solving initial LP relaxations (automatic 's'implex, 'p'rimal simplex, 'd'ual simplex, 'b'arrier, barrier with 'c'rossover)",
1712 "lp/resolvealgorithm",
1713 "LP algorithm for resolving LP relaxations if a starting basis exists (automatic 's'implex, 'p'rimal simplex, 'd'ual simplex, 'b'arrier, barrier with 'c'rossover)",
1718 "LP pricing strategy ('l'pi default, 'a'uto, 'f'ull pricing, 'p'artial, 's'teepest edge pricing, 'q'uickstart steepest edge pricing, 'd'evex pricing)",
1722 "lp/clearinitialprobinglp",
1723 "should lp state be cleared at the end of probing mode when lp was initially unsolved, e.g., when called right after presolving?",
1727 "lp/resolverestore",
1728 "should the LP be resolved to restore the state at start of diving (if FALSE we buffer the solution values)?",
1732 "lp/freesolvalbuffers",
1733 "should the buffers for storing LP solution values during diving be freed at end of diving?",
1738 "maximum age a dynamic column can reach before it is deleted from the LP (-1: don't delete columns due to aging)",
1743 "maximum age a dynamic row can reach before it is deleted from the LP (-1: don't delete rows due to aging)",
1748 "should new non-basic columns be removed after LP solving?",
1752 "lp/cleanupcolsroot",
1753 "should new non-basic columns be removed after root LP solving?",
1758 "should new basic rows be removed after LP solving?",
1762 "lp/cleanuprowsroot",
1763 "should new basic rows be removed after root LP solving?",
1767 "lp/checkstability",
1768 "should LP solver's return status be checked for stability?",
1772 "lp/conditionlimit",
1773 "maximum condition number of LP basis counted as stable (-1.0: no limit)",
1778 "minimal Markowitz threshold to control sparsity/stability in LU factorization",
1783 "should LP solutions be checked for primal feasibility, resolving LP when numerical troubles occur?",
1788 "should LP solutions be checked for dual feasibility, resolving LP when numerical troubles occur?",
1793 "should infeasibility proofs from the LP be checked?",
1798 "which FASTMIP setting of LP solver should be used? 0: off, 1: low",
1803 "LP scaling (0: none, 1: normal, 2: aggressive)",
1808 "should presolving of LP solver be used?",
1813 "should the lexicographic dual algorithm be used?",
1817 "lp/lexdualrootonly",
1818 "should the lexicographic dual algorithm be applied only at the root node",
1822 "lp/lexdualmaxrounds",
1823 "maximum number of rounds in the lexicographic dual algorithm (-1: unbounded)",
1828 "choose fractional basic variables in lexicographic dual algorithm?",
1832 "lp/lexdualstalling",
1833 "turn on the lex dual algorithm only when stalling?",
1838 "disable the cutoff bound in the LP solver? (0: enabled, 1: disabled, 2: auto)",
1843 "simplex algorithm shall use row representation of the basis if number of rows divided by number of columns exceeds this value (-1.0 to disable row representation)",
1848 "number of threads used for solving the LP (0: automatic)",
1852 "lp/resolveiterfac",
1853 "factor of average LP iterations that is used as LP iteration limit for LP resolve (-1: unlimited)",
1857 "lp/resolveitermin",
1858 "minimum number of iterations that are allowed for LP resolve",
1863 "lp/solutionpolishing",
1864 "LP solution polishing method (0: disabled, 1: only root, 2: always, 3: auto)",
1869 "lp/refactorinterval",
1870 "LP refactorization interval (0: auto)",
1874 "lp/alwaysgetduals",
1875 "should the Farkas duals always be collected when an LP is found to be infeasible?",
1882 "solver to use for solving NLPs; leave empty to select NLPI with highest priority",
1887 "should the NLP relaxation be always disabled (also for NLPs/MINLPs)?",
1894 "fraction of maximal memory usage resulting in switch to memory saving mode",
1898 "memory/arraygrowfac",
1899 "memory growing factor for dynamically allocated arrays",
1903 "memory/arraygrowinit",
1904 "initial size of dynamically allocated arrays",
1908 "memory/treegrowfac",
1909 "memory growing factor for tree array",
1913 "memory/treegrowinit",
1914 "initial size of tree array",
1918 "memory/pathgrowfac",
1919 "memory growing factor for path array",
1923 "memory/pathgrowinit",
1924 "initial size of path array",
1931 "should the CTRL-C interrupt be caught by SCIP?",
1936 "should a hashtable be used to map from variable names to variables?",
1940 "misc/useconstable",
1941 "should a hashtable be used to map from constraint names to constraints?",
1945 "misc/usesmalltables",
1946 "should smaller hashtables be used? yields better performance for small problems with about 100 variables",
1952 "should the problem be solved exactly (with proven dual bounds)?",
1961 "should the statistics be reset if the transformed problem is freed (in case of a Benders' decomposition this parameter should be set to FALSE)",
1966 "misc/improvingsols",
1967 "should only solutions be checked which improve the primal bound",
1972 "should the reason be printed if a given start solution is infeasible",
1976 "misc/estimexternmem",
1977 "should the usage of external memory be estimated?",
1982 "try to avoid running into memory limit by restricting plugins like heuristics?",
1986 "misc/transorigsols",
1987 "should SCIP try to transfer original solutions to the transformed space (after presolving)?",
1991 "misc/transsolsorig",
1992 "should SCIP try to transfer transformed solutions to the original space (after solving)?",
1996 "misc/calcintegral",
1997 "should SCIP calculate the primal dual integral value?",
2001 "misc/finitesolutionstore",
2002 "should SCIP try to remove infinite fixings from solutions copied to the solution store?",
2006 "misc/outputorigsol",
2007 "should the best solution be transformed to the orignal space and be output in command line run?",
2011 "misc/allowstrongdualreds",
2012 "should strong dual reductions be allowed in propagation and presolving?",
2016 "misc/allowweakdualreds",
2017 "should weak dual reductions be allowed in propagation and presolving?",
2022 "should the objective function be scaled so that it is always integer?",
2026 "misc/showdivingstats",
2027 "should detailed statistics for diving heuristics be shown?",
2032 "misc/referencevalue",
2033 "objective value for reference purposes",
2037#ifdef WITH_DEBUG_SOLUTION
2040 "path to a debug solution",
2047 "bitset describing used symmetry handling technique (0: off; 1: polyhedral (orbitopes and/or symresacks);" \
2048 " 2: orbital fixing; 3: orbitopes and orbital fixing; 4: Schreier Sims cuts; 5: Schreier Sims cuts and " \
2049 "orbitopes); 6: Schreier Sims cuts and orbital fixing; 7: Schreier Sims cuts, orbitopes, and orbital " \
2050 "fixing, see type_symmetry.h.",
2056 "randomization/randomseedshift",
2057 "global shift of all random seeds in the plugins and the LP random seed",
2062 "randomization/permutationseed",
2063 "seed value for permuting the problem after reading/transformation (0: no permutation)",
2068 "randomization/permuteconss",
2069 "should order of constraints be permuted (depends on permutationseed)?",
2074 "randomization/permutevars",
2075 "should order of variables be permuted (depends on permutationseed)?",
2080 "randomization/lpseed",
2081 "random seed for LP solver, e.g. for perturbations in the simplex (0: LP default)",
2087 "nodeselection/childsel",
2088 "child selection rule ('d'own, 'u'p, 'p'seudo costs, 'i'nference, 'l'p value, 'r'oot LP value difference, 'h'ybrid inference/root LP value difference)",
2094 "numerics/infinity",
2095 "values larger than this are considered infinity",
2100 "absolute values smaller than this are considered zero",
2104 "numerics/sumepsilon",
2105 "absolute values of sums smaller than this are considered zero",
2110 "feasibility tolerance for constraints",
2114 "numerics/checkfeastolfac",
2115 "feasibility tolerance factor; for checking the feasibility of the best solution",
2119 "numerics/lpfeastolfactor",
2120 "factor w.r.t. primal feasibility tolerance that determines default (and maximal) primal feasibility tolerance of LP solver",
2124 "numerics/dualfeastol",
2125 "feasibility tolerance for reduced costs in LP solution",
2129 "numerics/barrierconvtol",
2130 "LP convergence tolerance used in barrier algorithm",
2134 "numerics/boundstreps",
2135 "minimal relative improve for strengthening bounds",
2139 "numerics/pseudocosteps",
2140 "minimal variable distance value to use for branching pseudo cost updates",
2144 "numerics/pseudocostdelta",
2145 "minimal objective distance value to use for branching pseudo cost updates",
2149 "numerics/recomputefac",
2150 "minimal decrease factor that causes the recomputation of a value (e.g., pseudo objective) instead of an update",
2155 "values larger than this are considered huge and should be handled separately (e.g., in activity computation)",
2161 "presolving/maxrounds",
2162 "maximal number of presolving rounds (-1: unlimited, 0: off)",
2166 "presolving/abortfac",
2167 "abort presolve, if at most this fraction of the problem was changed in last presolve round",
2171 "presolving/maxrestarts",
2172 "maximal number of restarts (-1: unlimited)",
2176 "presolving/restartfac",
2177 "fraction of integer variables that were fixed in the root node triggering a restart with preprocessing after root node evaluation",
2181 "presolving/clqtablefac",
2182 "limit on number of entries in clique table relative to number of problem nonzeros",
2186 "presolving/immrestartfac",
2187 "fraction of integer variables that were fixed in the root node triggering an immediate restart with preprocessing",
2191 "presolving/subrestartfac",
2192 "fraction of integer variables that were globally fixed during the solving process triggering a restart with preprocessing",
2196 "presolving/restartminred",
2197 "minimal fraction of integer variables removed after restart to allow for an additional restart",
2201 "presolving/donotmultaggr",
2202 "should multi-aggregation of variables be forbidden?",
2206 "presolving/donotaggr",
2207 "should aggregation of variables be forbidden?",
2214 "maximal number of variables priced in per pricing round",
2218 "pricing/maxvarsroot",
2219 "maximal number of priced variables at the root node",
2224 "pricing is aborted, if fac * pricing/maxvars pricing candidates were found",
2229 "should variables created at the current node be deleted when the node is solved in case they are not present in the LP anymore?",
2233 "pricing/delvarsroot",
2234 "should variables created at the root node be deleted when the root is solved in case they are not present in the LP anymore?",
2240 "decomposition/benderslabels",
2241 "should the variables be labelled for the application of Benders' decomposition?",
2245 "decomposition/applybenders",
2246 "if a decomposition exists, should Benders' decomposition be applied?",
2250 "decomposition/maxgraphedge",
2251 "maximum number of edges in block graph computation (-1: no limit, 0: disable block graph computation)",
2255 "decomposition/disablemeasures",
2256 "disable expensive measures",
2262 "benders/solutiontol",
2263 "the tolerance used for checking optimality in Benders' decomposition. tol where optimality is given by LB + tol > UB.",
2268 "should Benders' cuts be generated from the solution to the LP relaxation?",
2272 "benders/copybenders",
2273 "should Benders' decomposition be copied for use in sub-SCIPs?",
2279 "propagating/maxrounds",
2280 "maximal number of propagation rounds per node (-1: unlimited)",
2284 "propagating/maxroundsroot",
2285 "maximal number of propagation rounds in the root node (-1: unlimited)",
2289 "propagating/abortoncutoff",
2290 "should propagation be aborted immediately? setting this to FALSE could help conflict analysis to produce more conflict constraints",
2296 "reoptimization/enable",
2297 "should reoptimization used?",
2301 "reoptimization/maxsavednodes",
2302 "maximal number of saved nodes",
2306 "reoptimization/maxdiffofnodes",
2307 "maximal number of bound changes between two stored nodes on one path",
2311 "reoptimization/globalcons/sepainfsubtrees",
2312 "save global constraints to separate infeasible subtrees.",
2316 "reoptimization/sepabestsol",
2317 "separate the optimal solution, i.e., for constrained shortest path",
2321 "reoptimization/storevarhistory",
2322 "use variable history of the previous solve if the objctive function has changed only slightly",
2326 "reoptimization/usepscost",
2327 "re-use pseudo costs if the objective function changed only slightly ",
2331 "reoptimization/solvelp",
2332 "at which reopttype should the LP be solved? (1: transit, 3: strong branched, 4: w/ added logicor, 5: only leafs).",
2336 "reoptimization/solvelpdiff",
2337 "maximal number of bound changes at node to skip solving the LP",
2341 "reoptimization/savesols",
2342 "number of best solutions which should be saved for the following runs. (-1: save all)",
2346 "reoptimization/objsimrootLP",
2347 "similarity of two sequential objective function to disable solving the root LP.",
2351 "reoptimization/objsimsol",
2352 "similarity of two objective functions to re-use stored solutions",
2356 "reoptimization/delay",
2357 "minimum similarity for using reoptimization of the search tree.",
2361 "reoptimization/commontimelimit",
2362 "time limit over all reoptimization rounds?.",
2366 "reoptimization/shrinkinner",
2367 "replace branched inner nodes by their child nodes, if the number of bound changes is not to large",
2371 "reoptimization/strongbranchinginit",
2372 "try to fix variables at the root node before reoptimizing by probing like strong branching",
2376 "reoptimization/reducetofrontier",
2377 "delete stored nodes which were not reoptimized",
2381 "reoptimization/forceheurrestart",
2382 "force a restart if the last n optimal solutions were found by heuristic reoptsols",
2386 "reoptimization/saveconsprop",
2387 "save constraint propagations",
2391 "reoptimization/usesplitcons",
"use constraints to reconstruct the subtree pruned be dual reduction when reactivating the node",
2395 "reoptimization/varorderinterdiction",
"use 'd'efault, 'r'andom or a variable ordering based on 'i'nference score for interdiction branching used during reoptimization",
2399 "reoptimization/usecuts",
2400 "reoptimize cuts found at the root node",
2404 "reoptimization/maxcutage",
2405 "maximal age of a cut to be use for reoptimization",
2411 "separating/maxbounddist",
2412 "maximal relative distance from current node's dual bound to primal bound compared to best node's dual bound for applying separation (0.0: only on current best node, 1.0: on all nodes)",
2416 "separating/maxlocalbounddist",
2417 "maximal relative distance from current node's dual bound to primal bound compared to best node's dual bound for applying local separation (0.0: only on current best node, 1.0: on all nodes)",
2421 "separating/maxcoefratio",
2422 "maximal ratio between coefficients in strongcg, cmir, and flowcover cuts",
2426 "separating/maxcoefratiofacrowprep",
2427 "maximal ratio between coefficients (as factor of 1/feastol) to ensure in rowprep cleanup",
2431 "separating/minefficacy",
2432 "minimal efficacy for a cut to enter the LP",
2436 "separating/minefficacyroot",
2437 "minimal efficacy for a cut to enter the LP in the root node",
2441 "separating/minactivityquot",
2442 "minimum cut activity quotient to convert cuts into constraints during a restart (0.0: all cuts are converted)",
2446 "separating/orthofunc",
2447 "function used for calc. scalar prod. in orthogonality test ('e'uclidean, 'd'iscrete)",
2451 "separating/efficacynorm",
2452 "row norm to use for efficacy calculation ('e'uclidean, 'm'aximum, 's'um, 'd'iscrete)",
2456 "separating/cutselrestart",
2457 "cut selection during restart ('a'ge, activity 'q'uotient)",
2461 "separating/cutselsubscip",
2462 "cut selection for sub SCIPs ('a'ge, activity 'q'uotient)",
2466 "separating/filtercutpoolrel",
2467 "should cutpool separate only cuts with high relative efficacy?",
2471 "separating/maxruns",
2472 "maximal number of runs for which separation is enabled (-1: unlimited)",
2476 "separating/maxrounds",
2477 "maximal number of separation rounds per node (-1: unlimited)",
2481 "separating/maxroundsroot",
2482 "maximal number of separation rounds in the root node (-1: unlimited)",
2486 "separating/maxroundsrootsubrun",
2487 "maximal number of separation rounds in the root node of a subsequent run (-1: unlimited)",
2491 "separating/maxaddrounds",
2492 "maximal additional number of separation rounds in subsequent price-and-cut loops (-1: no additional restriction)",
2496 "separating/maxstallrounds",
2497 "maximal number of consecutive separation rounds without objective or integrality improvement in local nodes (-1: no additional restriction)",
2501 "separating/maxstallroundsroot",
2502 "maximal number of consecutive separation rounds without objective or integrality improvement in the root node (-1: no additional restriction)",
2506 "separating/maxcuts",
2507 "maximal number of cuts separated per separation round (0: disable local separation)",
2511 "separating/maxcutsroot",
2512 "maximal number of separated cuts at the root node (0: disable root node separation)",
2516 "separating/cutagelimit",
2517 "maximum age a cut can reach before it is deleted from the global cut pool, or -1 to keep all cuts",
2521 "separating/poolfreq",
2522 "separation frequency for the global cut pool (-1: disable global cut pool, 0: only separate pool at the root)",
2529 "parallel optimisation mode, 0: opportunistic or 1: deterministic.",
2533 "parallel/minnthreads",
2534 "the minimum number of threads used during parallel solve",
2538 "parallel/maxnthreads",
2539 "the maximum number of threads used during parallel solve",
2545 "concurrent/changeseeds",
2546 "set different random seeds in each concurrent solver?",
2550 "concurrent/changechildsel",
2551 "use different child selection rules in each concurrent solver?",
2555 "concurrent/commvarbnds",
2556 "should the concurrent solvers communicate global variable bound changes?",
2560 "concurrent/presolvebefore",
2561 "should the problem be presolved before it is copied to the concurrent solvers?",
2565 "concurrent/initseed",
2566 "maximum number of solutions that will be shared in a one synchronization",
2570 "concurrent/sync/freqinit",
2571 "initial frequency of synchronization with other threads",
2575 "concurrent/sync/freqmax",
2576 "maximal frequency of synchronization with other threads",
2580 "concurrent/sync/freqfactor",
2581 "factor by which the frequency of synchronization is changed",
2585 "concurrent/sync/targetprogress",
2586 "when adapting the synchronization frequency this value is the targeted relative difference by which the absolute gap decreases per synchronization",
2590 "concurrent/sync/maxnsols",
2591 "maximum number of solutions that will be shared in a single synchronization",
2595 "concurrent/sync/maxnsyncdelay",
2596 "maximum number of synchronizations before reading is enforced regardless of delay",
2600 "concurrent/sync/minsyncdelay",
2601 "minimum delay before synchronization data is read",
2605 "concurrent/sync/nbestsols",
2606 "how many of the N best solutions should be considered for synchronization?",
2610 "concurrent/paramsetprefix",
2611 "path prefix for parameter setting files of concurrent solvers",
2619 "default clock type (1: CPU user seconds, 2: wall clock time)",
2624 "is timing enabled?",
2629 "belongs reading time to solving time?",
2633 "timing/rareclockcheck",
2634 "should clock checks of solving time be performed less frequently (note: time limit could be exceeded slightly)",
2638 "timing/statistictiming",
2639 "should timing for statistic output be performed?",
2644 "should time for evaluation in NLP solves be measured?",
2650 "visual/vbcfilename",
2651 "name of the VBC tool output file, or - if no VBC tool output should be created",
2655 "visual/bakfilename",
2656 "name of the BAK tool output file, or - if no BAK tool output should be created",
2661 "should the real solving time be used instead of a time step counter in visualization?",
2666 "should the node where solutions are found be visualized?",
2671 "should lower bound information be visualized?",
2676 "should be output the external value of the objective?",
2682 "reading/initialconss",
2683 "should model constraints be marked as initial?",
2687 "reading/dynamicconss",
2688 "should model constraints be subject to aging?",
2692 "reading/dynamiccols",
2693 "should columns be added and removed dynamically to the LP?",
2697 "reading/dynamicrows",
2698 "should rows be added and removed dynamically to the LP?",
2705 "should all constraints be written (including the redundant constraints)?",
2710 "should variables set to zero be printed?",
2714 "write/genericnamesoffset",
2715 "when writing a generic problem the index for the first variable should start with?",
2739 for(
i = 0;
i < (*set)->nreaders; ++
i )
2746 for(
i = 0;
i < (*set)->npricers; ++
i )
2753 for(
i = 0;
i < (*set)->nbenders; ++
i )
2760 for(
i = 0;
i < (*set)->nconshdlrs; ++
i )
2770 for(
i = 0;
i < (*set)->nconflicthdlrs; ++
i )
2777 for(
i = 0;
i < (*set)->npresols; ++
i )
2784 for(
i = 0;
i < (*set)->nrelaxs; ++
i )
2791 for(
i = 0;
i < (*set)->nsepas; ++
i )
2798 for(
i = 0;
i < (*set)->ncutsels; ++
i)
2805 for(
i = 0;
i < (*set)->nprops; ++
i )
2813 for(
i = 0;
i < (*set)->nheurs; ++
i )
2820 for(
i = 0;
i < (*set)->ncomprs; ++
i )
2827 for(
i = 0;
i < (*set)->neventhdlrs; ++
i )
2834 for(
i = 0;
i < (*set)->nnodesels; ++
i )
2841 for(
i = 0;
i < (*set)->nbranchrules; ++
i )
2848 for(
i = 0;
i < (*set)->ntables; ++
i )
2855 for(
i = 0;
i < (*set)->ndisps; ++
i )
2865 for(
i = 0;
i < (*set)->nexprhdlrs; ++
i )
2870 (*set)->exprhdlrvar =
NULL;
2871 (*set)->exprhdlrval =
NULL;
2872 (*set)->exprhdlrsum =
NULL;
2873 (*set)->exprhdlrproduct =
NULL;
2874 (*set)->exprhdlrpow =
NULL;
2877 for(
i = 0;
i < (*set)->nnlpis; ++
i )
2887 for(
i = 0;
i < (*set)->nconcsolvertypes; ++
i )
2894 for(
i = 0;
i < (*set)->nextcodes; ++
i )
2903 for(
i = 0;
i < (*set)->nbanditvtables; ++
i )
2934 SCIP_Bool* valueptr,
2935 SCIP_Bool isadvanced,
2936 SCIP_Bool defaultvalue,
2957 SCIP_Bool isadvanced,
2968 defaultvalue, minvalue, maxvalue,
paramchgd, paramdata) );
2980 SCIP_Longint* valueptr,
2981 SCIP_Bool isadvanced,
2982 SCIP_Longint defaultvalue,
2983 SCIP_Longint minvalue,
2984 SCIP_Longint maxvalue,
2992 defaultvalue, minvalue, maxvalue,
paramchgd, paramdata) );
3004 SCIP_Real* valueptr,
3005 SCIP_Bool isadvanced,
3006 SCIP_Real defaultvalue,
3016 defaultvalue, minvalue, maxvalue,
paramchgd, paramdata) );
3029 SCIP_Bool isadvanced,
3031 const char* allowedvalues,
3039 defaultvalue, allowedvalues,
paramchgd, paramdata) );
3052 SCIP_Bool isadvanced,
3053 const char* defaultvalue,
3227 SCIP_Bool defaultvalue
3446 const char* filename
3460 const char* filename,
3617 if(
set->nreaders >=
set->readerssize )
3641 for(
i = 0;
i <
set->nreaders; ++
i )
3644 return set->readers[
i];
3659 if(
set->npricers >=
set->pricerssize )
3684 for(
i = 0;
i <
set->npricers; ++
i )
3687 return set->pricers[
i];
3700 if( !
set->pricerssorted )
3715 if( !
set->pricersnamesorted )
3719 set->pricersnamesorted =
TRUE;
3732 if(
set->nbenders >=
set->benderssize )
3739 set->benders[
set->nbenders] = benders;
3757 for(
i = 0;
i <
set->nbenders; ++
i )
3760 return set->benders[
i];
3773 if( !
set->benderssorted )
3788 if( !
set->bendersnamesorted )
3792 set->bendersnamesorted =
TRUE;
3810 if(
set->nconshdlrs >=
set->conshdlrssize )
3824 set->conshdlrs[
i] =
set->conshdlrs[
i-1];
3826 set->conshdlrs[
i] = conshdlr;
3832 set->conshdlrs_sepa[
i] =
set->conshdlrs_sepa[
i-1];
3834 set->conshdlrs_sepa[
i] = conshdlr;
3840 set->conshdlrs_enfo[
i] =
set->conshdlrs_enfo[
i-1];
3842 set->conshdlrs_enfo[
i] = conshdlr;
3845 set->conshdlrs_include[
set->nconshdlrs] = conshdlr;
3894 set->conshdlrs_sepa[
i] =
set->conshdlrs_sepa[
i-1];
3901 i =
set->nconshdlrs - 1;
3923 set->conshdlrs_sepa[
i] =
set->conshdlrs_sepa[
i + 1];
3928 for(
i = 0;
i <
set->nconshdlrs - 1; ++
i )
3946 for(
i = 0;
i <
set->nconshdlrs; ++
i )
3949 return set->conshdlrs[
i];
3965 if(
set->nconflicthdlrs >=
set->conflicthdlrssize )
3973 set->nconflicthdlrs++;
3990 for(
i = 0;
i <
set->nconflicthdlrs; ++
i )
3993 return set->conflicthdlrs[
i];
4006 if( !
set->conflicthdlrssorted )
4009 set->conflicthdlrssorted =
TRUE;
4010 set->conflicthdlrsnamesorted =
FALSE;
4021 if( !
set->conflicthdlrsnamesorted )
4025 set->conflicthdlrsnamesorted =
TRUE;
4038 if(
set->npresols >=
set->presolssize )
4063 for(
i = 0;
i <
set->npresols; ++
i )
4066 return set->presols[
i];
4079 if( !
set->presolssorted )
4094 if( !
set->presolsnamesorted )
4098 set->presolsnamesorted =
TRUE;
4112 if(
set->nrelaxs >=
set->relaxssize )
4119 set->relaxs[
set->nrelaxs] = relax;
4137 for(
i = 0;
i <
set->nrelaxs; ++
i )
4140 return set->relaxs[
i];
4153 if( !
set->relaxssorted )
4168 if( !
set->relaxsnamesorted )
4186 if(
set->nsepas >=
set->sepassize )
4193 set->sepas[
set->nsepas] = sepa;
4211 for(
i = 0;
i <
set->nsepas; ++
i )
4214 return set->sepas[
i];
4227 if( !
set->sepassorted )
4242 if( !
set->sepasnamesorted )
4260 if(
set->ncutsels >=
set->cutselssize )
4285 for(
i = 0;
i <
set->ncutsels; ++
i )
4288 return set->cutsels[
i];
4301 if( !
set->cutselssorted )
4318 if(
set->nprops >=
set->propssize )
4326 set->props[
set->nprops] = prop;
4327 set->props_presol[
set->nprops] = prop;
4346 for(
i = 0;
i <
set->nprops; ++
i )
4349 return set->props[
i];
4362 if( !
set->propssorted )
4377 if( !
set->propspresolsorted )
4380 set->propspresolsorted =
TRUE;
4392 if( !
set->propsnamesorted )
4409 if(
set->nbanditvtables >=
set->banditvtablessize )
4434 for(
b = 0;
b <
set->nbanditvtables; ++
b )
4437 return set->banditvtables[
b];
4452 if(
set->nconcsolvertypes >=
set->concsolvertypessize )
4457 assert(
set->nconcsolvertypes <
set->concsolvertypessize);
4460 set->nconcsolvertypes++;
4476 for(
i = 0;
i <
set->nconcsolvertypes; ++
i )
4479 return set->concsolvertypes[
i];
4494 if(
set->nconcsolvers >=
set->concsolverssize )
4501 set->concsolvers[
set->nconcsolvers] = concsolver;
4504 set->nconcsolvers++;
4518 for(
i = 0;
i <
set->nconcsolvers; ++
i )
4524 set->nconcsolvers = 0;
4525 set->concsolverssize = 0;
4541 if(
set->nheurs >=
set->heurssize )
4548 set->heurs[
set->nheurs] = heur;
4566 for(
i = 0;
i <
set->nheurs; ++
i )
4569 return set->heurs[
i];
4582 if( !
set->heurssorted )
4597 if( !
set->heursnamesorted )
4615 if(
set->ncomprs >=
set->comprssize )
4640 for(
i = 0;
i <
set->ncomprs; ++
i )
4643 return set->comprs[
i];
4656 if( !
set->comprssorted )
4671 if( !
set->comprsnamesorted )
4689 if(
set->neventhdlrs >=
set->eventhdlrssize )
4696 set->eventhdlrs[
set->neventhdlrs] = eventhdlr;
4713 for(
i = 0;
i <
set->neventhdlrs; ++
i )
4716 return set->eventhdlrs[
i];
4735 if(
set->nnodesels >=
set->nodeselssize )
4745 set->nodesels[
i] =
set->nodesels[
i-1];
4747 set->nodesels[
i] = nodesel;
4764 for(
i = 0;
i <
set->nnodesels; ++
i )
4767 return set->nodesels[
i];
4783 if(
set->nodesel ==
NULL &&
set->nnodesels > 0 )
4787 set->nodesel =
set->nodesels[0];
4792 for(
i = 1;
i <
set->nnodesels; ++
i )
4795 set->nodesel =
set->nodesels[
i];
4800 for(
i = 1;
i <
set->nnodesels; ++
i )
4803 set->nodesel =
set->nodesels[
i];
4808 return set->nodesel;
4821 if(
set->nbranchrules >=
set->branchrulessize )
4829 set->nbranchrules++;
4846 for(
i = 0;
i <
set->nbranchrules; ++
i )
4849 return set->branchrules[
i];
4862 if( !
set->branchrulessorted )
4865 set->branchrulessorted =
TRUE;
4866 set->branchrulesnamesorted =
FALSE;
4877 if( !
set->branchrulesnamesorted )
4881 set->branchrulesnamesorted =
TRUE;
4898 if(
set->ndisps >=
set->dispssize )
4911 set->disps[
i] = disp;
4928 for(
i = 0;
i <
set->ndisps; ++
i )
4931 return set->disps[
i];
4947 if(
set->ntables >=
set->tablessize )
4973 for(
i = 0;
i <
set->ntables; ++
i )
4976 return set->tables[
i];
4991 if(
set->ndialogs >=
set->dialogssize )
5017 for(
i = 0;
i <
set->ndialogs; ++
i )
5035 if(
set->nexprhdlrs >=
set->exprhdlrssize )
5042 set->exprhdlrs[
set->nexprhdlrs] = exprhdlr;
5047 set->exprhdlrvar = exprhdlr;
5049 set->exprhdlrval = exprhdlr;
5051 set->exprhdlrsum = exprhdlr;
5053 set->exprhdlrproduct = exprhdlr;
5055 set->exprhdlrpow = exprhdlr;
5071 for(
i = 0;
i <
set->nexprhdlrs; ++
i )
5073 return set->exprhdlrs[
i];
5085 if( !
set->exprhdlrssorted )
5101 if(
set->nnlpis >=
set->nlpissize )
5108 set->nlpis[
set->nnlpis] = nlpi;
5126 for(
i = 0;
i <
set->nnlpis; ++
i )
5129 return set->nlpis[
i];
5142 if( !
set->nlpissorted )
5167 const char* description
5173 if(
set->nextcodes >=
set->extcodessize )
5182 if( description !=
NULL )
5208 for(
i = 0;
i <
set->nactivepricers; ++
i )
5215 for(
i = 0;
i <
set->nactivebenders; ++
i )
5221 for(
i = 0;
i <
set->nconshdlrs; ++
i )
5227 for(
i = 0;
i <
set->nconflicthdlrs; ++
i )
5233 for(
i = 0;
i <
set->npresols; ++
i )
5239 for(
i = 0;
i <
set->nrelaxs; ++
i )
5245 for(
i = 0;
i <
set->nsepas; ++
i )
5251 for(
i = 0;
i <
set->ncutsels; ++
i )
5257 for(
i = 0;
i <
set->nprops; ++
i )
5263 for(
i = 0;
i <
set->nheurs; ++
i )
5269 for(
i = 0;
i <
set->ncomprs; ++
i )
5275 for(
i = 0;
i <
set->neventhdlrs; ++
i )
5281 for(
i = 0;
i <
set->nnodesels; ++
i )
5287 for(
i = 0;
i <
set->nbranchrules; ++
i )
5293 for(
i = 0;
i <
set->ndisps; ++
i )
5300 for(
i = 0;
i <
set->ntables; ++
i )
5306 for(
i = 0;
i <
set->nexprhdlrs; ++
i )
5310 for(
i = 0;
i <
set->nnlpis; ++
i )
5329 for(
i = 0;
i <
set->nactivepricers; ++
i )
5336 for(
i = 0;
i <
set->nactivebenders; ++
i )
5342 for(
i = 0;
i <
set->nconshdlrs; ++
i )
5348 for(
i = 0;
i <
set->nconflicthdlrs; ++
i )
5354 for(
i = 0;
i <
set->npresols; ++
i )
5360 for(
i = 0;
i <
set->nrelaxs; ++
i )
5366 for(
i = 0;
i <
set->nsepas; ++
i )
5372 for(
i = 0;
i <
set->ncutsels; ++
i )
5378 for(
i = 0;
i <
set->nprops; ++
i )
5384 for(
i = 0;
i <
set->nheurs; ++
i )
5390 for(
i = 0;
i <
set->ncomprs; ++
i )
5396 for(
i = 0;
i <
set->neventhdlrs; ++
i )
5402 for(
i = 0;
i <
set->nnodesels; ++
i )
5408 for(
i = 0;
i <
set->nbranchrules; ++
i )
5414 for(
i = 0;
i <
set->ndisps; ++
i )
5420 for(
i = 0;
i <
set->ntables; ++
i )
5440 for(
i = 0;
i <
set->npresols; ++
i )
5446 for(
i = 0;
i <
set->nprops; ++
i )
5452 for(
i = 0;
i <
set->nconshdlrs; ++
i )
5458 for(
i = 0;
i <
set->nactivebenders; ++
i )
5478 for(
i = 0;
i <
set->npresols; ++
i )
5484 for(
i = 0;
i <
set->nprops; ++
i )
5490 for(
i = 0;
i <
set->nconshdlrs; ++
i )
5496 for(
i = 0;
i <
set->nactivebenders; ++
i )
5526 for(
i = 0;
i <
set->nactivepricers; ++
i )
5533 for(
i = 0;
i <
set->nactivebenders; ++
i )
5539 for(
i = 0;
i <
set->nconshdlrs; ++
i )
5545 for(
i = 0;
i <
set->nconflicthdlrs; ++
i )
5551 for(
i = 0;
i <
set->nrelaxs; ++
i )
5557 for(
i = 0;
i <
set->nsepas; ++
i )
5563 for(
i =0;
i <
set->ncutsels; ++
i )
5569 for(
i = 0;
i <
set->nprops; ++
i )
5575 for(
i = 0;
i <
set->nheurs; ++
i )
5581 for(
i = 0;
i <
set->neventhdlrs; ++
i )
5587 for(
i = 0;
i <
set->nnodesels; ++
i )
5593 for(
i = 0;
i <
set->nbranchrules; ++
i )
5599 for(
i = 0;
i <
set->ndisps; ++
i )
5605 for(
i = 0;
i <
set->ntables; ++
i )
5627 for(
i = 0;
i <
set->nactivepricers; ++
i )
5634 for(
i = 0;
i <
set->nactivebenders; ++
i )
5640 for(
i = 0;
i <
set->nconshdlrs; ++
i )
5646 for(
i = 0;
i <
set->nconflicthdlrs; ++
i )
5652 for(
i = 0;
i <
set->nrelaxs; ++
i )
5658 for(
i = 0;
i <
set->nsepas; ++
i )
5664 for(
i = 0;
i <
set->ncutsels; ++
i )
5670 for(
i = 0;
i <
set->nprops; ++
i )
5676 for(
i = 0;
i <
set->nheurs; ++
i )
5682 for(
i = 0;
i <
set->neventhdlrs; ++
i )
5688 for(
i = 0;
i <
set->nnodesels; ++
i )
5694 for(
i = 0;
i <
set->nbranchrules; ++
i )
5700 for(
i = 0;
i <
set->ndisps; ++
i )
5706 for(
i = 0;
i <
set->ntables; ++
i )
5755 set->disp_verblevel = verblevel;
5769 set->num_feastol = feastol;
5784 SCIP_Real dualfeastol
5789 set->num_dualfeastol = dualfeastol;
5823 oldval =
set->num_relaxfeastol;
5848 return set->price_maxvarsroot;
5850 return set->price_maxvars;
5862 return set->sepa_maxcutsroot;
5864 return set->sepa_maxcuts;
5888 return set->misc_referencevalue;
5899 return set->debugsoldata;
5913#undef SCIPsetInfinity
5914#undef SCIPsetEpsilon
5915#undef SCIPsetSumepsilon
5916#undef SCIPsetFeastol
5917#undef SCIPsetDualfeastol
5918#undef SCIPsetBarrierconvtol
5919#undef SCIPsetPseudocosteps
5920#undef SCIPsetPseudocostdelta
5921#undef SCIPsetCutoffbounddelta
5922#undef SCIPsetLPFeastolFactor
5923#undef SCIPsetRelaxfeastol
5924#undef SCIPsetRecompfac
5930#undef SCIPsetIsInfinity
5932#undef SCIPsetIsPositive
5933#undef SCIPsetIsNegative
5934#undef SCIPsetIsIntegral
5935#undef SCIPsetIsScalingIntegral
5936#undef SCIPsetIsFracIntegral
5941#undef SCIPsetIsSumEQ
5942#undef SCIPsetIsSumLT
5943#undef SCIPsetIsSumLE
5944#undef SCIPsetIsSumGT
5945#undef SCIPsetIsSumGE
5946#undef SCIPsetIsSumZero
5947#undef SCIPsetIsSumPositive
5948#undef SCIPsetIsSumNegative
5949#undef SCIPsetSumFloor
5950#undef SCIPsetSumCeil
5951#undef SCIPsetSumRound
5952#undef SCIPsetSumFrac
5953#undef SCIPsetIsFeasEQ
5954#undef SCIPsetIsFeasLT
5955#undef SCIPsetIsFeasLE
5956#undef SCIPsetIsFeasGT
5957#undef SCIPsetIsFeasGE
5958#undef SCIPsetIsFeasZero
5959#undef SCIPsetIsFeasPositive
5960#undef SCIPsetIsFeasNegative
5961#undef SCIPsetIsFeasIntegral
5962#undef SCIPsetIsFeasFracIntegral
5963#undef SCIPsetFeasFloor
5964#undef SCIPsetFeasCeil
5965#undef SCIPsetFeasRound
5966#undef SCIPsetFeasFrac
5967#undef SCIPsetIsDualfeasEQ
5968#undef SCIPsetIsDualfeasLT
5969#undef SCIPsetIsDualfeasLE
5970#undef SCIPsetIsDualfeasGT
5971#undef SCIPsetIsDualfeasGE
5972#undef SCIPsetIsDualfeasZero
5973#undef SCIPsetIsDualfeasPositive
5974#undef SCIPsetIsDualfeasNegative
5975#undef SCIPsetIsDualfeasIntegral
5976#undef SCIPsetIsDualfeasFracIntegral
5977#undef SCIPsetDualfeasFloor
5978#undef SCIPsetDualfeasCeil
5979#undef SCIPsetDualfeasRound
5980#undef SCIPsetDualfeasFrac
5981#undef SCIPsetIsLbBetter
5982#undef SCIPsetIsUbBetter
5983#undef SCIPsetIsEfficacious
5984#undef SCIPsetIsRelEQ
5985#undef SCIPsetIsRelLT
5986#undef SCIPsetIsRelLE
5987#undef SCIPsetIsRelGT
5988#undef SCIPsetIsRelGE
5989#undef SCIPsetIsSumRelEQ
5990#undef SCIPsetIsSumRelLT
5991#undef SCIPsetIsSumRelLE
5992#undef SCIPsetIsSumRelGT
5993#undef SCIPsetIsSumRelGE
5994#undef SCIPsetIsUpdateUnreliable
5995#undef SCIPsetInitializeRandomSeed
5996#undef SCIPsetIsHugeValue
5997#undef SCIPsetGetHugeValue
5998#undef SCIPsetGetSubscipsOff
6007 return set->num_infinity;
6019 return set->num_hugeval;
6029 return set->num_epsilon;
6039 return set->num_sumepsilon;
6049 return set->num_feastol;
6059 return set->num_dualfeastol;
6067 return set->num_lpfeastolfactor;
6077 return set->num_barrierconvtol;
6087 return set->num_pseudocosteps;
6097 return set->num_pseudocostdelta;
6111 return MIN(100.0 * feastol, 0.0001);
6121 return set->num_relaxfeastol;
6132 return set->num_recompfac;
6143 return (val >=
set->num_infinity);
6154 return (val >=
set->num_hugeval);
6255 return EPSZ(val,
set->num_epsilon);
6266 return EPSP(val,
set->num_epsilon);
6277 return EPSN(val,
set->num_epsilon);
6464 return EPSZ(val,
set->num_sumepsilon);
6475 return EPSP(val,
set->num_sumepsilon);
6486 return EPSN(val,
set->num_sumepsilon);
6651 return EPSZ(val,
set->num_feastol);
6662 return EPSP(val,
set->num_feastol);
6673 return EPSN(val,
set->num_feastol);
6862 return EPSZ(val,
set->num_dualfeastol);
6873 return EPSP(val,
set->num_dualfeastol);
6884 return EPSN(val,
set->num_dualfeastol);
7239 return set->subscipsoff;
7277 const char* filename;
7278 int subscipdepth = 0;
7289#if defined(_WIN32) || defined(_WIN64)
7294 if ( filename ==
NULL )
7300 subscipdepth =
scip->stat->subscipdepth;
7302 if ( subscipdepth > 0 )
void SCIPbanditvtableFree(SCIP_BANDITVTABLE **banditvtable)
internal methods for bandit algorithms
SCIP_RETCODE SCIPbranchruleExit(SCIP_BRANCHRULE *branchrule, SCIP_SET *set)
SCIP_RETCODE SCIPbranchruleFree(SCIP_BRANCHRULE **branchrule, SCIP_SET *set)
SCIP_RETCODE SCIPbranchruleInitsol(SCIP_BRANCHRULE *branchrule, SCIP_SET *set)
SCIP_RETCODE SCIPbranchruleExitsol(SCIP_BRANCHRULE *branchrule, SCIP_SET *set)
void SCIPbranchruleEnableOrDisableClocks(SCIP_BRANCHRULE *branchrule, SCIP_Bool enable)
SCIP_RETCODE SCIPbranchruleCopyInclude(SCIP_BRANCHRULE *branchrule, SCIP_SET *set)
SCIP_RETCODE SCIPbranchruleInit(SCIP_BRANCHRULE *branchrule, SCIP_SET *set)
internal methods for branching rules and branching candidate storage
internal methods for clocks and timing issues
SCIP_RETCODE SCIPcomprFree(SCIP_COMPR **compr, SCIP_SET *set)
SCIP_RETCODE SCIPcomprExit(SCIP_COMPR *compr, SCIP_SET *set)
SCIP_RETCODE SCIPcomprInit(SCIP_COMPR *compr, SCIP_SET *set)
internal methods for tree compressions
SCIP_RETCODE SCIPconcsolverDestroyInstance(SCIP_SET *set, SCIP_CONCSOLVER **concsolver)
int SCIPconcsolverGetIdx(SCIP_CONCSOLVER *concsolver)
char * SCIPconcsolverTypeGetName(SCIP_CONCSOLVERTYPE *concsolvertype)
void SCIPconcsolverTypeFree(SCIP_CONCSOLVERTYPE **concsolvertype)
datastructures for concurrent solvers
void SCIPconflicthdlrEnableOrDisableClocks(SCIP_CONFLICTHDLR *conflicthdlr, SCIP_Bool enable)
SCIP_RETCODE SCIPconflicthdlrExit(SCIP_CONFLICTHDLR *conflicthdlr, SCIP_SET *set)
SCIP_RETCODE SCIPconflicthdlrFree(SCIP_CONFLICTHDLR **conflicthdlr, SCIP_SET *set)
SCIP_RETCODE SCIPconflicthdlrExitsol(SCIP_CONFLICTHDLR *conflicthdlr, SCIP_SET *set)
SCIP_RETCODE SCIPconflicthdlrCopyInclude(SCIP_CONFLICTHDLR *conflicthdlr, SCIP_SET *set)
SCIP_RETCODE SCIPconflicthdlrInitsol(SCIP_CONFLICTHDLR *conflicthdlr, SCIP_SET *set)
SCIP_RETCODE SCIPconflicthdlrInit(SCIP_CONFLICTHDLR *conflicthdlr, SCIP_SET *set)
internal methods for conflict analysis
SCIP_RETCODE SCIPconshdlrInit(SCIP_CONSHDLR *conshdlr, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat)
SCIP_RETCODE SCIPconshdlrExitsol(SCIP_CONSHDLR *conshdlr, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_Bool restart)
void SCIPconshdlrEnableOrDisableClocks(SCIP_CONSHDLR *conshdlr, SCIP_Bool enable)
SCIP_RETCODE SCIPconshdlrInitpre(SCIP_CONSHDLR *conshdlr, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat)
SCIP_RETCODE SCIPconshdlrCopyInclude(SCIP_CONSHDLR *conshdlr, SCIP_SET *set, SCIP_Bool *valid)
SCIP_RETCODE SCIPconshdlrExitpre(SCIP_CONSHDLR *conshdlr, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat)
SCIP_RETCODE SCIPconshdlrInitsol(SCIP_CONSHDLR *conshdlr, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat)
SCIP_RETCODE SCIPconshdlrExit(SCIP_CONSHDLR *conshdlr, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat)
SCIP_RETCODE SCIPconshdlrFree(SCIP_CONSHDLR **conshdlr, SCIP_SET *set)
internal methods for constraints and constraint handlers
SCIP_RETCODE SCIPcutselInitsol(SCIP_CUTSEL *cutsel, SCIP_SET *set)
SCIP_RETCODE SCIPcutselExitsol(SCIP_CUTSEL *cutsel, SCIP_SET *set)
SCIP_RETCODE SCIPcutselExit(SCIP_CUTSEL *cutsel, SCIP_SET *set)
SCIP_RETCODE SCIPcutselCopyInclude(SCIP_CUTSEL *cutsel, SCIP_SET *set)
void SCIPcutselEnableOrDisableClocks(SCIP_CUTSEL *cutsel, SCIP_Bool enable)
SCIP_RETCODE SCIPcutselFree(SCIP_CUTSEL **cutsel, SCIP_SET *set)
SCIP_RETCODE SCIPcutselInit(SCIP_CUTSEL *cutsel, SCIP_SET *set)
internal methods for cut selectors
#define SCIPdebugFree(set)
struct SCIP_DebugSolData SCIP_DEBUGSOLDATA
#define SCIPdebugSolDataCreate(debugsoldata)
common defines and data types used in all packages of SCIP
#define SCIP_DEFAULT_INFINITY
#define SCIP_DEFAULT_HUGEVAL
#define SCIP_DEFAULT_MEM_ARRAYGROWINIT
#define SCIP_MAXTREEDEPTH
#define SCIP_DEFAULT_LPFEASTOLFACTOR
#define SCIP_DEFAULT_SUMEPSILON
#define SCIP_DEFAULT_PSEUDOCOSTEPS
#define SCIP_DEFAULT_RECOMPFAC
#define SCIP_DEFAULT_EPSILON
#define SCIP_DEFAULT_PSEUDOCOSTDELTA
#define SCIP_DEFAULT_CHECKFEASTOLFAC
#define SCIP_DEFAULT_DUALFEASTOL
#define SCIP_DEFAULT_BOUNDSTREPS
#define SCIP_DEFAULT_MEM_ARRAYGROWFAC
#define SCIP_DEFAULT_BARRIERCONVTOL
#define SCIP_DEFAULT_FEASTOL
SCIP_RETCODE SCIPdialogCopyInclude(SCIP_DIALOG *dialog, SCIP_SET *set)
internal methods for user interface dialog
SCIP_RETCODE SCIPdispInit(SCIP_DISP *disp, SCIP_SET *set)
SCIP_RETCODE SCIPdispCopyInclude(SCIP_DISP *disp, SCIP_SET *set)
SCIP_RETCODE SCIPdispInitsol(SCIP_DISP *disp, SCIP_SET *set)
SCIP_RETCODE SCIPdispAutoActivate(SCIP_SET *set)
SCIP_RETCODE SCIPdispFree(SCIP_DISP **disp, SCIP_SET *set)
SCIP_RETCODE SCIPdispExitsol(SCIP_DISP *disp, SCIP_SET *set)
SCIP_RETCODE SCIPdispExit(SCIP_DISP *disp, SCIP_SET *set)
internal methods for displaying runtime statistics
SCIP_RETCODE SCIPeventhdlrCopyInclude(SCIP_EVENTHDLR *eventhdlr, SCIP_SET *set)
SCIP_RETCODE SCIPeventhdlrInitsol(SCIP_EVENTHDLR *eventhdlr, SCIP_SET *set)
SCIP_RETCODE SCIPeventhdlrExitsol(SCIP_EVENTHDLR *eventhdlr, SCIP_SET *set)
void SCIPeventhdlrEnableOrDisableClocks(SCIP_EVENTHDLR *eventhdlr, SCIP_Bool enable)
SCIP_RETCODE SCIPeventhdlrExit(SCIP_EVENTHDLR *eventhdlr, SCIP_SET *set)
SCIP_RETCODE SCIPeventhdlrFree(SCIP_EVENTHDLR **eventhdlr, SCIP_SET *set)
SCIP_RETCODE SCIPeventhdlrInit(SCIP_EVENTHDLR *eventhdlr, SCIP_SET *set)
internal methods for managing events
SCIP_RETCODE SCIPexprhdlrFree(SCIP_EXPRHDLR **exprhdlr, SCIP_SET *set, BMS_BLKMEM *blkmem)
void SCIPexprhdlrInit(SCIP_EXPRHDLR *exprhdlr, SCIP_SET *set)
SCIP_RETCODE SCIPexprhdlrCopyInclude(SCIP_EXPRHDLR *exprhdlr, SCIP_SET *targetset)
private functions to work with algebraic expressions
SCIP_STAGE SCIPgetStage(SCIP *scip)
SCIP_Real SCIPlpiInfinity(SCIP_LPI *lpi)
SCIP_Real SCIPrelDiff(SCIP_Real val1, SCIP_Real val2)
const char * SCIPbanditvtableGetName(SCIP_BANDITVTABLE *banditvtable)
const char * SCIPbendersGetName(SCIP_BENDERS *benders)
SCIP_Bool SCIPbranchruleIsInitialized(SCIP_BRANCHRULE *branchrule)
const char * SCIPbranchruleGetName(SCIP_BRANCHRULE *branchrule)
SCIP_Bool SCIPcomprIsInitialized(SCIP_COMPR *compr)
const char * SCIPcomprGetName(SCIP_COMPR *compr)
const char * SCIPconflicthdlrGetName(SCIP_CONFLICTHDLR *conflicthdlr)
SCIP_Bool SCIPconflicthdlrIsInitialized(SCIP_CONFLICTHDLR *conflicthdlr)
int SCIPconshdlrGetSepaPriority(SCIP_CONSHDLR *conshdlr)
const char * SCIPconshdlrGetName(SCIP_CONSHDLR *conshdlr)
SCIP_Bool SCIPconshdlrNeedsCons(SCIP_CONSHDLR *conshdlr)
SCIP_Bool SCIPconshdlrIsInitialized(SCIP_CONSHDLR *conshdlr)
int SCIPconshdlrGetCheckPriority(SCIP_CONSHDLR *conshdlr)
int SCIPconshdlrGetEnfoPriority(SCIP_CONSHDLR *conshdlr)
SCIP_Bool SCIPconshdlrIsClonable(SCIP_CONSHDLR *conshdlr)
const char * SCIPcutselGetName(SCIP_CUTSEL *cutsel)
SCIP_Bool SCIPcutselIsInitialized(SCIP_CUTSEL *cutsel)
SCIP_Bool SCIPdispIsInitialized(SCIP_DISP *disp)
const char * SCIPdispGetName(SCIP_DISP *disp)
int SCIPdispGetPosition(SCIP_DISP *disp)
SCIP_RETCODE SCIPautoselectDisps(SCIP *scip)
SCIP_Bool SCIPeventhdlrIsInitialized(SCIP_EVENTHDLR *eventhdlr)
const char * SCIPeventhdlrGetName(SCIP_EVENTHDLR *eventhdlr)
const char * SCIPexprhdlrGetName(SCIP_EXPRHDLR *exprhdlr)
const char * SCIPheurGetName(SCIP_HEUR *heur)
SCIP_Bool SCIPheurIsInitialized(SCIP_HEUR *heur)
void SCIPresetLPFeastol(SCIP *scip)
SCIP_Real SCIPgetLPFeastol(SCIP *scip)
BMS_BUFMEM * SCIPcleanbuffer(SCIP *scip)
BMS_BUFMEM * SCIPbuffer(SCIP *scip)
const char * SCIPnlpiGetName(SCIP_NLPI *nlpi)
SCIP_Bool SCIPnodeselIsInitialized(SCIP_NODESEL *nodesel)
int SCIPnodeselGetMemsavePriority(SCIP_NODESEL *nodesel)
int SCIPnodeselGetStdPriority(SCIP_NODESEL *nodesel)
const char * SCIPnodeselGetName(SCIP_NODESEL *nodesel)
const char * SCIPpresolGetName(SCIP_PRESOL *presol)
SCIP_Bool SCIPpricerIsActive(SCIP_PRICER *pricer)
const char * SCIPpricerGetName(SCIP_PRICER *pricer)
const char * SCIPpropGetName(SCIP_PROP *prop)
SCIP_Bool SCIPpropIsInitialized(SCIP_PROP *prop)
const char * SCIPreaderGetName(SCIP_READER *reader)
SCIP_Bool SCIPrelaxIsInitialized(SCIP_RELAX *relax)
const char * SCIPrelaxGetName(SCIP_RELAX *relax)
SCIP_RETCODE SCIPenableReoptimization(SCIP *scip, SCIP_Bool enable)
const char * SCIPsepaGetName(SCIP_SEPA *sepa)
SCIP_Bool SCIPsepaIsInitialized(SCIP_SEPA *sepa)
SCIP_Bool SCIPtableIsInitialized(SCIP_TABLE *table)
const char * SCIPtableGetName(SCIP_TABLE *table)
SCIP_RETCODE SCIPenableOrDisableStatisticTiming(SCIP *scip)
SCIP_RETCODE SCIPchgFeastol(SCIP *scip, SCIP_Real feastol)
SCIP_Real SCIPfeastol(SCIP *scip)
SCIP_RETCODE SCIPchgBarrierconvtol(SCIP *scip, SCIP_Real barrierconvtol)
void SCIPmarkLimitChanged(SCIP *scip)
SCIP_RETCODE SCIPchgDualfeastol(SCIP *scip, SCIP_Real dualfeastol)
void SCIPsortPtr(void **ptrarray, SCIP_DECL_SORTPTRCOMP((*ptrcomp)), int len)
void SCIPheurEnableOrDisableClocks(SCIP_HEUR *heur, SCIP_Bool enable)
SCIP_RETCODE SCIPheurInit(SCIP_HEUR *heur, SCIP_SET *set)
SCIP_RETCODE SCIPheurCopyInclude(SCIP_HEUR *heur, SCIP_SET *set)
SCIP_RETCODE SCIPheurInitsol(SCIP_HEUR *heur, SCIP_SET *set)
SCIP_RETCODE SCIPheurExitsol(SCIP_HEUR *heur, SCIP_SET *set)
SCIP_RETCODE SCIPheurFree(SCIP_HEUR **heur, SCIP_SET *set, BMS_BLKMEM *blkmem)
SCIP_RETCODE SCIPheurExit(SCIP_HEUR *heur, SCIP_SET *set)
internal methods for primal heuristics
assert(minobj< SCIPgetCutoffbound(scip))
SCIP_Real SCIPlpGetFeastol(SCIP_LP *lp)
void SCIPlpResetFeastol(SCIP_LP *lp, SCIP_SET *set)
internal methods for LP management
void BMSsetBufferMemoryArraygrowinit(BMS_BUFMEM *buffer, int arraygrowinit)
void BMSsetBufferMemoryArraygrowfac(BMS_BUFMEM *buffer, double arraygrowfac)
#define BMSfreeMemory(ptr)
#define BMSreallocMemoryArray(ptr, num)
#define BMSduplicateMemoryArray(ptr, source, num)
struct BMS_BlkMem BMS_BLKMEM
#define BMSfreeMemoryArrayNull(ptr)
#define BMSallocMemory(ptr)
void SCIPmessageFPrintInfo(SCIP_MESSAGEHDLR *messagehdlr, FILE *file, const char *formatstr,...)
void SCIPmessageVFPrintInfo(SCIP_MESSAGEHDLR *messagehdlr, FILE *file, const char *formatstr, va_list ap)
SCIP_RETCODE SCIPnlpiFree(SCIP_NLPI **nlpi, SCIP_SET *set)
void SCIPnlpiSetPriority(SCIP_NLPI *nlpi, int priority)
SCIP_RETCODE SCIPnlpiCopyInclude(SCIP_NLPI *sourcenlpi, SCIP_SET *targetset)
void SCIPnlpiInit(SCIP_NLPI *nlpi)
internal methods for NLP solver interfaces
SCIP_RETCODE SCIPnodeselExit(SCIP_NODESEL *nodesel, SCIP_SET *set)
void SCIPnodeselEnableOrDisableClocks(SCIP_NODESEL *nodesel, SCIP_Bool enable)
SCIP_RETCODE SCIPnodeselFree(SCIP_NODESEL **nodesel, SCIP_SET *set)
SCIP_RETCODE SCIPnodeselCopyInclude(SCIP_NODESEL *nodesel, SCIP_SET *set)
SCIP_RETCODE SCIPnodeselExitsol(SCIP_NODESEL *nodesel, SCIP_SET *set)
SCIP_RETCODE SCIPnodeselInitsol(SCIP_NODESEL *nodesel, SCIP_SET *set)
SCIP_RETCODE SCIPnodeselInit(SCIP_NODESEL *nodesel, SCIP_SET *set)
internal methods for node selectors and node priority queues
SCIP_RETCODE SCIPparamsetGetBool(SCIP_PARAMSET *paramset, const char *name, SCIP_Bool *value)
SCIP_RETCODE SCIPparamsetCreate(SCIP_PARAMSET **paramset, BMS_BLKMEM *blkmem)
SCIP_RETCODE SCIPparamSetString(SCIP_PARAM *param, SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, const char *value, SCIP_Bool initialize, SCIP_Bool quiet)
SCIP_RETCODE SCIPparamsetSetReal(SCIP_PARAMSET *paramset, SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, const char *name, SCIP_Real value)
SCIP_RETCODE SCIPparamsetGetString(SCIP_PARAMSET *paramset, const char *name, char **value)
SCIP_RETCODE SCIPparamSetLongint(SCIP_PARAM *param, SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, SCIP_Longint value, SCIP_Bool initialize, SCIP_Bool quiet)
SCIP_RETCODE SCIPparamSetReal(SCIP_PARAM *param, SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, SCIP_Real value, SCIP_Bool initialize, SCIP_Bool quiet)
int SCIPparamsetGetNParams(SCIP_PARAMSET *paramset)
SCIP_RETCODE SCIPparamsetSetInt(SCIP_PARAMSET *paramset, SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, const char *name, int value)
SCIP_RETCODE SCIPparamsetAddString(SCIP_PARAMSET *paramset, SCIP_MESSAGEHDLR *messagehdlr, BMS_BLKMEM *blkmem, const char *name, const char *desc, char **valueptr, SCIP_Bool isadvanced, const char *defaultvalue, SCIP_DECL_PARAMCHGD((*paramchgd)), SCIP_PARAMDATA *paramdata)
SCIP_RETCODE SCIPparamsetGetInt(SCIP_PARAMSET *paramset, const char *name, int *value)
SCIP_RETCODE SCIPparamsetGetLongint(SCIP_PARAMSET *paramset, const char *name, SCIP_Longint *value)
SCIP_RETCODE SCIPparamsetAddChar(SCIP_PARAMSET *paramset, SCIP_MESSAGEHDLR *messagehdlr, BMS_BLKMEM *blkmem, const char *name, const char *desc, char *valueptr, SCIP_Bool isadvanced, char defaultvalue, const char *allowedvalues, SCIP_DECL_PARAMCHGD((*paramchgd)), SCIP_PARAMDATA *paramdata)
SCIP_RETCODE SCIPparamsetSetPresolving(SCIP_PARAMSET *paramset, SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, SCIP_PARAMSETTING paramsetting, SCIP_Bool quiet)
void SCIPparamsetFree(SCIP_PARAMSET **paramset, BMS_BLKMEM *blkmem)
SCIP_RETCODE SCIPparamsetAddInt(SCIP_PARAMSET *paramset, SCIP_MESSAGEHDLR *messagehdlr, BMS_BLKMEM *blkmem, const char *name, const char *desc, int *valueptr, SCIP_Bool isadvanced, int defaultvalue, int minvalue, int maxvalue, SCIP_DECL_PARAMCHGD((*paramchgd)), SCIP_PARAMDATA *paramdata)
SCIP_PARAM * SCIPparamsetGetParam(SCIP_PARAMSET *paramset, const char *name)
SCIP_RETCODE SCIPparamsetRead(SCIP_PARAMSET *paramset, SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, const char *filename)
SCIP_RETCODE SCIPparamsetSetChar(SCIP_PARAMSET *paramset, SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, const char *name, char value)
SCIP_Bool SCIPparamGetBool(SCIP_PARAM *param)
SCIP_RETCODE SCIPparamsetSetDefaultBool(SCIP_PARAMSET *paramset, const char *name, SCIP_Bool defaultvalue)
SCIP_RETCODE SCIPparamsetGetChar(SCIP_PARAMSET *paramset, const char *name, char *value)
int SCIPparamGetInt(SCIP_PARAM *param)
SCIP_RETCODE SCIPparamsetSetToSubscipsOff(SCIP_PARAMSET *paramset, SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, SCIP_Bool quiet)
SCIP_RETCODE SCIPparamsetSetToDefaults(SCIP_PARAMSET *paramset, SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr)
SCIP_Real SCIPparamGetReal(SCIP_PARAM *param)
SCIP_Bool SCIPparamsetIsFixed(SCIP_PARAMSET *paramset, const char *name)
SCIP_RETCODE SCIPparamsetAddBool(SCIP_PARAMSET *paramset, SCIP_MESSAGEHDLR *messagehdlr, BMS_BLKMEM *blkmem, const char *name, const char *desc, SCIP_Bool *valueptr, SCIP_Bool isadvanced, SCIP_Bool defaultvalue, SCIP_DECL_PARAMCHGD((*paramchgd)), SCIP_PARAMDATA *paramdata)
SCIP_RETCODE SCIPparamsetWrite(SCIP_PARAMSET *paramset, SCIP_MESSAGEHDLR *messagehdlr, const char *filename, SCIP_Bool comments, SCIP_Bool onlychanged)
SCIP_RETCODE SCIPparamsetSetString(SCIP_PARAMSET *paramset, SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, const char *name, const char *value)
SCIP_RETCODE SCIPparamsetSetToDefault(SCIP_PARAMSET *paramset, SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, const char *paramname)
SCIP_RETCODE SCIPparamsetSetDefaultInt(SCIP_PARAMSET *paramset, const char *name, int defaultvalue)
SCIP_RETCODE SCIPparamsetAddReal(SCIP_PARAMSET *paramset, SCIP_MESSAGEHDLR *messagehdlr, BMS_BLKMEM *blkmem, const char *name, const char *desc, SCIP_Real *valueptr, SCIP_Bool isadvanced, SCIP_Real defaultvalue, SCIP_Real minvalue, SCIP_Real maxvalue, SCIP_DECL_PARAMCHGD((*paramchgd)), SCIP_PARAMDATA *paramdata)
SCIP_RETCODE SCIPparamsetCopyParams(SCIP_PARAMSET *sourceparamset, SCIP_PARAMSET *targetparamset, SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr)
SCIP_RETCODE SCIPparamSetBool(SCIP_PARAM *param, SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, SCIP_Bool value, SCIP_Bool initialize, SCIP_Bool quiet)
SCIP_RETCODE SCIPparamsetSetHeuristics(SCIP_PARAMSET *paramset, SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, SCIP_PARAMSETTING paramsetting, SCIP_Bool quiet)
SCIP_RETCODE SCIPparamsetSetSeparating(SCIP_PARAMSET *paramset, SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, SCIP_PARAMSETTING paramsetting, SCIP_Bool quiet)
SCIP_RETCODE SCIPparamsetSetLongint(SCIP_PARAMSET *paramset, SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, const char *name, SCIP_Longint value)
SCIP_RETCODE SCIPparamsetSetEmphasis(SCIP_PARAMSET *paramset, SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, SCIP_PARAMEMPHASIS paramemphasis, SCIP_Bool quiet)
SCIP_RETCODE SCIPparamsetGetReal(SCIP_PARAMSET *paramset, const char *name, SCIP_Real *value)
SCIP_PARAM ** SCIPparamsetGetParams(SCIP_PARAMSET *paramset)
SCIP_RETCODE SCIPparamsetAddLongint(SCIP_PARAMSET *paramset, SCIP_MESSAGEHDLR *messagehdlr, BMS_BLKMEM *blkmem, const char *name, const char *desc, SCIP_Longint *valueptr, SCIP_Bool isadvanced, SCIP_Longint defaultvalue, SCIP_Longint minvalue, SCIP_Longint maxvalue, SCIP_DECL_PARAMCHGD((*paramchgd)), SCIP_PARAMDATA *paramdata)
SCIP_RETCODE SCIPparamsetFix(SCIP_PARAMSET *paramset, const char *name, SCIP_Bool fixed)
SCIP_RETCODE SCIPparamSetChar(SCIP_PARAM *param, SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, char value, SCIP_Bool initialize, SCIP_Bool quiet)
SCIP_RETCODE SCIPparamsetSetBool(SCIP_PARAMSET *paramset, SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, const char *name, SCIP_Bool value)
SCIP_RETCODE SCIPparamSetInt(SCIP_PARAM *param, SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, int value, SCIP_Bool initialize, SCIP_Bool quiet)
internal methods for handling parameter settings
SCIP_RETCODE SCIPpresolFree(SCIP_PRESOL **presol, SCIP_SET *set)
void SCIPpresolEnableOrDisableClocks(SCIP_PRESOL *presol, SCIP_Bool enable)
SCIP_RETCODE SCIPpresolExitpre(SCIP_PRESOL *presol, SCIP_SET *set)
SCIP_RETCODE SCIPpresolExit(SCIP_PRESOL *presol, SCIP_SET *set)
SCIP_RETCODE SCIPpresolInit(SCIP_PRESOL *presol, SCIP_SET *set)
SCIP_RETCODE SCIPpresolCopyInclude(SCIP_PRESOL *presol, SCIP_SET *set)
SCIP_RETCODE SCIPpresolInitpre(SCIP_PRESOL *presol, SCIP_SET *set)
internal methods for presolvers
SCIP_RETCODE SCIPpricerInitsol(SCIP_PRICER *pricer, SCIP_SET *set)
SCIP_RETCODE SCIPpricerActivate(SCIP_PRICER *pricer, SCIP_SET *set)
SCIP_RETCODE SCIPpricerCopyInclude(SCIP_PRICER *pricer, SCIP_SET *set, SCIP_Bool *valid)
SCIP_RETCODE SCIPpricerExit(SCIP_PRICER *pricer, SCIP_SET *set)
void SCIPpricerEnableOrDisableClocks(SCIP_PRICER *pricer, SCIP_Bool enable)
SCIP_RETCODE SCIPpricerExitsol(SCIP_PRICER *pricer, SCIP_SET *set)
SCIP_RETCODE SCIPpricerInit(SCIP_PRICER *pricer, SCIP_SET *set)
SCIP_RETCODE SCIPpricerFree(SCIP_PRICER **pricer, SCIP_SET *set)
internal methods for variable pricers
SCIP_RETCODE SCIPpropInitsol(SCIP_PROP *prop, SCIP_SET *set)
SCIP_RETCODE SCIPpropInit(SCIP_PROP *prop, SCIP_SET *set)
SCIP_RETCODE SCIPpropCopyInclude(SCIP_PROP *prop, SCIP_SET *set)
SCIP_RETCODE SCIPpropExitpre(SCIP_PROP *prop, SCIP_SET *set)
SCIP_RETCODE SCIPpropExit(SCIP_PROP *prop, SCIP_SET *set)
void SCIPpropEnableOrDisableClocks(SCIP_PROP *prop, SCIP_Bool enable)
SCIP_RETCODE SCIPpropExitsol(SCIP_PROP *prop, SCIP_SET *set, SCIP_Bool restart)
SCIP_RETCODE SCIPpropInitpre(SCIP_PROP *prop, SCIP_SET *set)
SCIP_RETCODE SCIPpropFree(SCIP_PROP **prop, SCIP_SET *set)
internal methods for propagators
public methods for NLP solver interfaces
SCIP_RETCODE SCIPreaderFree(SCIP_READER **reader, SCIP_SET *set)
SCIP_RETCODE SCIPreaderCopyInclude(SCIP_READER *reader, SCIP_SET *set)
void SCIPreaderEnableOrDisableClocks(SCIP_READER *reader, SCIP_Bool enable)
internal methods for input file readers
SCIP_RETCODE SCIPrelaxInit(SCIP_RELAX *relax, SCIP_SET *set)
SCIP_RETCODE SCIPrelaxExit(SCIP_RELAX *relax, SCIP_SET *set)
SCIP_RETCODE SCIPrelaxFree(SCIP_RELAX **relax, SCIP_SET *set)
SCIP_RETCODE SCIPrelaxCopyInclude(SCIP_RELAX *relax, SCIP_SET *set)
void SCIPrelaxEnableOrDisableClocks(SCIP_RELAX *relax, SCIP_Bool enable)
SCIP_RETCODE SCIPrelaxInitsol(SCIP_RELAX *relax, SCIP_SET *set)
SCIP_RETCODE SCIPrelaxExitsol(SCIP_RELAX *relax, SCIP_SET *set)
internal methods for relaxators
SCIP_RETCODE SCIPsepaExitsol(SCIP_SEPA *sepa, SCIP_SET *set)
SCIP_RETCODE SCIPsepaCopyInclude(SCIP_SEPA *sepa, SCIP_SET *set)
SCIP_RETCODE SCIPsepaInitsol(SCIP_SEPA *sepa, SCIP_SET *set)
SCIP_RETCODE SCIPsepaExit(SCIP_SEPA *sepa, SCIP_SET *set)
SCIP_RETCODE SCIPsepaInit(SCIP_SEPA *sepa, SCIP_SET *set)
SCIP_RETCODE SCIPsepaFree(SCIP_SEPA **sepa, SCIP_SET *set)
void SCIPsepaEnableOrDisableClocks(SCIP_SEPA *sepa, SCIP_Bool enable)
internal methods for separators
#define SCIP_DEFAULT_CONCURRENT_FREQFACTOR
#define SCIP_DEFAULT_BRANCH_MIDPULL
#define SCIP_DEFAULT_SEPA_CUTAGELIMIT
void SCIPsetSortCutsels(SCIP_SET *set)
SCIP_Bool SCIPsetIsDualfeasZero(SCIP_SET *set, SCIP_Real val)
SCIP_DISP * SCIPsetFindDisp(SCIP_SET *set, const char *name)
SCIP_Real SCIPsetFloor(SCIP_SET *set, SCIP_Real val)
#define SCIP_DEFAULT_LP_CLEANUPCOLSROOT
#define SCIP_DEFAULT_WRITE_GENNAMES_OFFSET
SCIP_RETCODE SCIPsetIncludeReader(SCIP_SET *set, SCIP_READER *reader)
#define SCIP_DEFAULT_LIMIT_SOLUTIONS
void SCIPsetSortBranchrules(SCIP_SET *set)
#define SCIP_DEFAULT_SEPA_MAXROUNDSROOT
SCIP_Bool SCIPsetIsDualfeasLE(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)
#define SCIP_DEFAULT_PRICE_MAXVARSROOT
#define SCIP_DEFAULT_CONF_PREFERBINARY
#define SCIP_DEFAULT_REOPT_OBJSIMSOL
#define SCIP_DEFAULT_MEM_TREEGROWFAC
#define SCIP_DEFAULT_LP_THREADS
SCIP_RETCODE SCIPsetSetSeparating(SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, SCIP_PARAMSETTING paramsetting, SCIP_Bool quiet)
#define SCIP_DEFAULT_CONF_MAXVARSFAC
#define SCIP_DEFAULT_SEPA_POOLFREQ
void SCIPsetSortBranchrulesName(SCIP_SET *set)
SCIP_RETCODE SCIPsetSetBarrierconvtol(SCIP_SET *set, SCIP_Real barrierconvtol)
#define SCIP_DEFAULT_SEPA_MAXBOUNDDIST
#define SCIP_DEFAULT_MISC_USESYMMETRY
#define SCIP_DEFAULT_VISUAL_OBJEXTERN
#define SCIP_DEFAULT_LIMIT_ABSGAP
#define SCIP_DEFAULT_LP_DISABLECUTOFF
SCIP_RETCODE SCIPsetAddIntParam(SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, BMS_BLKMEM *blkmem, const char *name, const char *desc, int *valueptr, SCIP_Bool isadvanced, int defaultvalue, int minvalue, int maxvalue, SCIP_DECL_PARAMCHGD((*paramchgd)), SCIP_PARAMDATA *paramdata)
#define SCIP_DEFAULT_PARALLEL_MODE
int SCIPsetCalcTreeGrowSize(SCIP_SET *set, int num)
void SCIPsetSortConflicthdlrsName(SCIP_SET *set)
SCIP_Bool SCIPsetIsLbBetter(SCIP_SET *set, SCIP_Real newlb, SCIP_Real oldlb, SCIP_Real oldub)
#define SCIP_DEFAULT_PARALLEL_MINNTHREADS
#define SCIP_DEFAULT_MISC_ESTIMEXTERNMEM
#define SCIP_DEFAULT_DECOMP_MAXGRAPHEDGE
#define SCIP_DEFAULT_CONCURRENT_PRESOLVEBEFORE
#define SCIP_DEFAULT_CONS_DISABLEENFOPS
#define SCIP_DEFAULT_LIMIT_MEMORY
void SCIPsetSortPresolsName(SCIP_SET *set)
#define SCIP_DEFAULT_COMPR_ENABLE
SCIP_RETCODE SCIPsetResetParam(SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, const char *name)
SCIP_EXPRHDLR * SCIPsetFindExprhdlr(SCIP_SET *set, const char *name)
#define SCIP_DEFAULT_BENDERS_SOLTOL
SCIP_Bool SCIPsetIsRelLT(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)
#define SCIP_DEFAULT_DISP_FREQ
SCIP_Bool SCIPsetIsEfficacious(SCIP_SET *set, SCIP_Bool root, SCIP_Real efficacy)
SCIP_NODESEL * SCIPsetFindNodesel(SCIP_SET *set, const char *name)
#define SCIP_DEFAULT_LP_ITERLIM
#define SCIP_DEFAULT_CONF_FULLSHORTENCONFLICT
#define SCIP_DEFAULT_MISC_CALCINTEGRAL
#define SCIP_DEFAULT_BRANCH_DELAYPSCOST
SCIP_Bool SCIPsetExistsDialog(SCIP_SET *set, SCIP_DIALOG *dialog)
#define SCIP_DEFAULT_HISTORY_ALLOWMERGE
SCIP_RETCODE SCIPsetSetFeastol(SCIP_SET *set, SCIP_LP *lp, SCIP_Real feastol)
#define SCIP_DEFAULT_PRICE_ABORTFAC
#define SCIP_DEFAULT_READ_INITIALCONSS
void SCIPsetSortPresols(SCIP_SET *set)
#define SCIP_DEFAULT_CONCURRENT_MAXNSOLS
SCIP_PRICER * SCIPsetFindPricer(SCIP_SET *set, const char *name)
#define SCIP_DEFAULT_PROP_MAXROUNDS
#define SCIP_DEFAULT_NODESEL_CHILDSEL
SCIP_RETCODE SCIPsetSetRealParam(SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, const char *name, SCIP_Real value)
#define SCIP_DEFAULT_READ_DYNAMICCOLS
#define SCIP_DEFAULT_MISC_SCALEOBJ
#define SCIP_DEFAULT_SEPA_FILTERCUTPOOLREL
#define SCIP_DEFAULT_BRANCH_SUMADJUSTSCORE
SCIP_RETCODE SCIPsetWriteParams(SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, const char *filename, SCIP_Bool comments, SCIP_Bool onlychanged)
#define SCIP_DEFAULT_REOPT_REDUCETOFRONTIER
#define SCIP_DEFAULT_CONF_MAXLPLOOPS
SCIP_Bool SCIPsetIsFeasPositive(SCIP_SET *set, SCIP_Real val)
SCIP_TABLE * SCIPsetFindTable(SCIP_SET *set, const char *name)
SCIP_RETCODE SCIPsetAddStringParam(SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, BMS_BLKMEM *blkmem, const char *name, const char *desc, char **valueptr, SCIP_Bool isadvanced, const char *defaultvalue, SCIP_DECL_PARAMCHGD((*paramchgd)), SCIP_PARAMDATA *paramdata)
SCIP_Bool SCIPsetIsHugeValue(SCIP_SET *set, SCIP_Real val)
#define SCIP_DEFAULT_REOPT_USESPLITCONS
#define SCIP_DEFAULT_CONCURRENT_INITSEED
#define SCIP_DEFAULT_CONF_DOWNLOCKSCOREFAC
#define SCIP_DEFAULT_CONF_SEPAALTPROOFS
SCIP_Bool SCIPsetIsDualfeasFracIntegral(SCIP_SET *set, SCIP_Real val)
SCIP_RETCODE SCIPsetIncludeBenders(SCIP_SET *set, SCIP_BENDERS *benders)
SCIP_Real SCIPsetDualfeasCeil(SCIP_SET *set, SCIP_Real val)
SCIP_Bool SCIPsetIsGE(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)
SCIP_RETCODE SCIPsetSetStringParam(SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, const char *name, const char *value)
#define SCIP_DEFAULT_DISP_VERBLEVEL
SCIP_Real SCIPsetSumRound(SCIP_SET *set, SCIP_Real val)
#define SCIP_DEFAULT_PRESOL_RESTARTFAC
#define SCIP_DEFAULT_VISUAL_BAKFILENAME
#define SCIP_DEFAULT_SEPA_MAXCOEFRATIO
SCIP_COMPR * SCIPsetFindCompr(SCIP_SET *set, const char *name)
#define SCIP_DEFAULT_LP_COLAGELIMIT
#define SCIP_DEFAULT_PRESOL_SUBRESTARTFAC
#define SCIP_DEFAULT_CONF_WEIGHTVALIDDEPTH
#define SCIP_DEFAULT_LP_CONDITIONLIMIT
#define SCIP_DEFAULT_LP_ROOTITERLIM
SCIP_Real SCIPsetFeasCeil(SCIP_SET *set, SCIP_Real val)
#define SCIP_DEFAULT_CONF_USEINFLP
SCIP_RETCODE SCIPsetGetCharParam(SCIP_SET *set, const char *name, char *value)
SCIP_Real SCIPsetSumFloor(SCIP_SET *set, SCIP_Real val)
SCIP_Bool SCIPsetIsFeasFracIntegral(SCIP_SET *set, SCIP_Real val)
#define SCIP_DEFAULT_MISC_PRINTREASON
#define SCIP_DEFAULT_LIMIT_TIME
#define SCIP_DEFAULT_CONF_USELOCALROWS
#define SCIP_DEFAULT_CONF_RESTARTNUM
SCIP_RETCODE SCIPsetIncludeBranchrule(SCIP_SET *set, SCIP_BRANCHRULE *branchrule)
SCIP_RETCODE SCIPsetSetDefaultIntParam(SCIP_SET *set, const char *name, int defaultvalue)
SCIP_Bool SCIPsetIsFeasNegative(SCIP_SET *set, SCIP_Real val)
#define SCIP_DEFAULT_NLP_DISABLE
SCIP_RETCODE SCIPsetAddLongintParam(SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, BMS_BLKMEM *blkmem, const char *name, const char *desc, SCIP_Longint *valueptr, SCIP_Bool isadvanced, SCIP_Longint defaultvalue, SCIP_Longint minvalue, SCIP_Longint maxvalue, SCIP_DECL_PARAMCHGD((*paramchgd)), SCIP_PARAMDATA *paramdata)
#define SCIP_DEFAULT_RANDOM_PERMUTECONSS
SCIP_Bool SCIPsetGetSubscipsOff(SCIP_SET *set)
#define SCIP_DEFAULT_SEPA_MINEFFICACYROOT
SCIP_RETCODE SCIPsetIncludeRelax(SCIP_SET *set, SCIP_RELAX *relax)
SCIP_Real SCIPsetSetRelaxfeastol(SCIP_SET *set, SCIP_Real relaxfeastol)
#define SCIP_DEFAULT_LP_CLEANUPROWS
SCIP_Bool SCIPsetIsSumRelGE(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)
SCIP_RETCODE SCIPsetIncludeBanditvtable(SCIP_SET *set, SCIP_BANDITVTABLE *banditvtable)
SCIP_RETCODE SCIPsetIncludeConcsolverType(SCIP_SET *set, SCIP_CONCSOLVERTYPE *concsolvertype)
SCIP_Real SCIPsetFeastol(SCIP_SET *set)
#define SCIP_DEFAULT_MISC_EXACTSOLVE
#define SCIP_DEFAULT_MISC_IMPROVINGSOLS
SCIP_RETCODE SCIPsetInitsolPlugins(SCIP_SET *set, BMS_BLKMEM *blkmem, SCIP_STAT *stat)
#define SCIP_DEFAULT_CONF_ALLOWLOCAL
#define SCIP_DEFAULT_CONF_UPLOCKSCOREFAC
SCIP_RETCODE SCIPsetGetLongintParam(SCIP_SET *set, const char *name, SCIP_Longint *value)
SCIP_RETCODE SCIPsetIncludeSepa(SCIP_SET *set, SCIP_SEPA *sepa)
#define SCIP_DEFAULT_SEPA_ORTHOFUNC
#define SCIP_DEFAULT_REOPT_MAXDIFFOFNODES
#define SCIP_DEFAULT_BENDERS_COPYBENDERS
#define SCIP_DEFAULT_CONF_FUIPLEVELS
#define SCIP_DEFAULT_CONF_CLEANBNDDEPEND
#define SCIP_DEFAULT_MISC_USECONSTABLE
#define SCIP_DEFAULT_LP_LEXDUALMAXROUNDS
SCIP_RETCODE SCIPsetIncludeTable(SCIP_SET *set, SCIP_TABLE *table)
SCIP_Real SCIPsetPseudocosteps(SCIP_SET *set)
#define SCIP_DEFAULT_VISUAL_DISPSOLS
#define SCIP_DEFAULT_TIME_NLPIEVAL
#define SCIP_DEFAULT_BRANCH_CHECKSBSOL
SCIP_RETCODE SCIPsetGetStringParam(SCIP_SET *set, const char *name, char **value)
SCIP_RETCODE SCIPsetSetHeuristics(SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, SCIP_PARAMSETTING paramsetting, SCIP_Bool quiet)
#define SCIP_DEFAULT_CONF_USEPROP
SCIP_Bool SCIPsetIsSumGT(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)
#define SCIP_DEFAULT_LP_PRICING
SCIP_RETCODE SCIPsetInitPlugins(SCIP_SET *set, BMS_BLKMEM *blkmem, SCIP_STAT *stat)
#define SCIP_DEFAULT_PRESOL_IMMRESTARTFAC
#define SCIP_DEFAULT_BRANCH_FORCEALL
#define SCIP_DEFAULT_LIMIT_BESTSOL
SCIP_RETCODE SCIPsetSetDualfeastol(SCIP_SET *set, SCIP_Real dualfeastol)
#define SCIP_DEFAULT_REOPT_MAXSAVEDNODES
SCIP_RETCODE SCIPsetSetReoptimizationParams(SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr)
#define SCIP_DEFAULT_MISC_OUTPUTORIGSOL
#define SCIP_DEFAULT_RANDOM_RANDSEEDSHIFT
SCIP_RETCODE SCIPsetSetIntParam(SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, const char *name, int value)
SCIP_PARAM ** SCIPsetGetParams(SCIP_SET *set)
SCIP_RETCODE SCIPsetAddCharParam(SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, BMS_BLKMEM *blkmem, const char *name, const char *desc, char *valueptr, SCIP_Bool isadvanced, char defaultvalue, const char *allowedvalues, SCIP_DECL_PARAMCHGD((*paramchgd)), SCIP_PARAMDATA *paramdata)
SCIP_Real SCIPsetCeil(SCIP_SET *set, SCIP_Real val)
#define SCIP_DEFAULT_LP_RESOLVEITERFAC
#define SCIP_DEFAULT_PRINTZEROS
SCIP_RETCODE SCIPsetIncludeConflicthdlr(SCIP_SET *set, SCIP_CONFLICTHDLR *conflicthdlr)
int SCIPsetGetSepaMaxcuts(SCIP_SET *set, SCIP_Bool root)
SCIP_RETCODE SCIPsetFreeConcsolvers(SCIP_SET *set)
SCIP_Bool SCIPsetIsRelEQ(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)
SCIP_RETCODE SCIPsetAddBoolParam(SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, BMS_BLKMEM *blkmem, const char *name, const char *desc, SCIP_Bool *valueptr, SCIP_Bool isadvanced, SCIP_Bool defaultvalue, SCIP_DECL_PARAMCHGD((*paramchgd)), SCIP_PARAMDATA *paramdata)
#define SCIP_DEFAULT_LP_CLEANUPCOLS
#define SCIP_DEFAULT_SEPA_MAXSTALLROUNDS
SCIP_RETCODE SCIPsetIncludePricer(SCIP_SET *set, SCIP_PRICER *pricer)
SCIP_Bool SCIPsetIsDualfeasLT(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)
SCIP_Bool SCIPsetIsFeasGT(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)
#define SCIP_DEFAULT_SEPA_MINACTIVITYQUOT
SCIP_Bool SCIPsetIsFeasLE(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)
#define SCIP_DEFAULT_BRANCH_ROUNDSBSOL
#define SCIP_DEFAULT_PRESOL_DONOTMULTAGGR
#define SCIP_DEFAULT_REOPT_SEPABESTSOL
#define SCIP_DEFAULT_SEPA_MAXRUNS
#define SCIP_DEFAULT_BRANCH_SCOREFUNC
SCIP_Real SCIPsetFeasRound(SCIP_SET *set, SCIP_Real val)
#define SCIP_DEFAULT_PRESOL_RESTARTMINRED
#define SCIP_DEFAULT_CONF_MAXVARSDETECTIMPLIEDBOUNDS
SCIP_Bool SCIPsetIsFeasEQ(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)
#define SCIP_DEFAULT_HISTORY_ALLOWTRANSFER
void SCIPsetSortPropsPresol(SCIP_SET *set)
SCIP_Bool SCIPsetIsPositive(SCIP_SET *set, SCIP_Real val)
SCIP_Bool SCIPsetIsSumRelGT(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)
#define SCIP_DEFAULT_CONF_REPROPAGATE
#define SCIP_DEFAULT_CONCURRENT_COMMVARBNDS
#define SCIP_DEFAULT_CONCURRENT_PARAMSETPREFIX
#define SCIP_DEFAULT_DISP_LPINFO
#define SCIP_DEFAULT_TIME_CLOCKTYPE
#define SCIP_DEFAULT_HISTORY_VALUEBASED
SCIP_RELAX * SCIPsetFindRelax(SCIP_SET *set, const char *name)
#define SCIP_DEFAULT_TIME_RARECLOCKCHECK
SCIP_RETCODE SCIPsetSetDefaultBoolParam(SCIP_SET *set, const char *name, SCIP_Bool defaultvalue)
SCIP_HEUR * SCIPsetFindHeur(SCIP_SET *set, const char *name)
#define SCIP_DEFAULT_CONF_MINMAXVARS
SCIP_Bool SCIPsetIsLE(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)
void SCIPsetSortRelaxsName(SCIP_SET *set)
void SCIPsetDebugMessagePrint(SCIP_SET *set, const char *formatstr,...)
#define SCIP_DEFAULT_CONF_SETTLELOCAL
void SCIPsetSortPropsName(SCIP_SET *set)
#define SCIP_DEFAULT_CONF_CONFLITWEIGHT
SCIP_Bool SCIPsetIsScalingIntegral(SCIP_SET *set, SCIP_Real val, SCIP_Real scalar)
SCIP_Real SCIPsetFeasFloor(SCIP_SET *set, SCIP_Real val)
#define SCIP_DEFAULT_CONF_KEEPREPROP
SCIP_Real SCIPsetRelaxfeastol(SCIP_SET *set)
SCIP_Bool SCIPsetIsParamFixed(SCIP_SET *set, const char *name)
#define SCIP_DEFAULT_LP_CHECKPRIMFEAS
SCIP_RETCODE SCIPsetCopyPlugins(SCIP_SET *sourceset, SCIP_SET *targetset, SCIP_Bool copyreaders, SCIP_Bool copypricers, SCIP_Bool copyconshdlrs, SCIP_Bool copyconflicthdlrs, SCIP_Bool copypresolvers, SCIP_Bool copyrelaxators, SCIP_Bool copyseparators, SCIP_Bool copycutselectors, SCIP_Bool copypropagators, SCIP_Bool copyheuristics, SCIP_Bool copyeventhdlrs, SCIP_Bool copynodeselectors, SCIP_Bool copybranchrules, SCIP_Bool copydisplays, SCIP_Bool copydialogs, SCIP_Bool copytables, SCIP_Bool copyexprhdlrs, SCIP_Bool copynlpis, SCIP_Bool *allvalid)
SCIP_RETCODE SCIPsetIncludeDisp(SCIP_SET *set, SCIP_DISP *disp)
#define SCIP_DEFAULT_LP_CLEARINITIALPROBINGLP
#define SCIP_DEFAULT_CONCURRENT_CHANGECHILDSEL
SCIP_RETCODE SCIPsetSetLongintParam(SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, const char *name, SCIP_Longint value)
#define SCIP_DEFAULT_CONF_WEIGHTSIZE
#define SCIP_DEFAULT_PRICE_DELVARS
#define SCIP_DEFAULT_MISC_FINITESOLSTORE
#define SCIP_DEFAULT_LP_SCALING
void SCIPsetSortRelaxs(SCIP_SET *set)
SCIP_RETCODE SCIPsetAddRealParam(SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, BMS_BLKMEM *blkmem, const char *name, const char *desc, SCIP_Real *valueptr, SCIP_Bool isadvanced, SCIP_Real defaultvalue, SCIP_Real minvalue, SCIP_Real maxvalue, SCIP_DECL_PARAMCHGD((*paramchgd)), SCIP_PARAMDATA *paramdata)
SCIP_Bool SCIPsetIsSumLE(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)
void SCIPsetPrintDebugMessage(SCIP_SET *set, const char *sourcefile, int sourceline, const char *formatstr,...)
#define SCIP_DEFAULT_CONF_ENABLE
#define SCIP_DEFAULT_SEPA_MINEFFICACY
#define SCIP_DEFAULT_CONF_DEPTHSCOREFAC
#define SCIP_DEFAULT_TIME_STATISTICTIMING
#define SCIP_DEFAULT_LIMIT_NODES
SCIP_Bool SCIPsetIsDualfeasNegative(SCIP_SET *set, SCIP_Real val)
SCIP_CONCSOLVERTYPE * SCIPsetFindConcsolverType(SCIP_SET *set, const char *name)
#define SCIP_DEFAULT_BRANCH_FIRSTSBCHILD
SCIP_RETCODE SCIPsetSetVerbLevel(SCIP_SET *set, SCIP_VERBLEVEL verblevel)
#define SCIP_DEFAULT_REOPT_SAVESOLS
SCIP_RETCODE SCIPsetGetBoolParam(SCIP_SET *set, const char *name, SCIP_Bool *value)
SCIP_CONSHDLR * SCIPsetFindConshdlr(SCIP_SET *set, const char *name)
#define SCIP_DEFAULT_LP_FASTMIP
#define SCIP_DEFAULT_PARALLEL_MAXNTHREADS
#define SCIP_DEFAULT_CONF_MINIMPROVE
#define SCIP_DEFAULT_REOPT_VARORDERINTERDICTION
SCIP_Real SCIPsetDualfeastol(SCIP_SET *set)
#define SCIP_DEFAULT_WRITE_ALLCONSS
void SCIPsetSortComprs(SCIP_SET *set)
#define SCIP_DEFAULT_PRESOL_MAXROUNDS
SCIP_RETCODE SCIPsetIncludeConcsolver(SCIP_SET *set, SCIP_CONCSOLVER *concsolver)
#define SCIP_DEFAULT_LP_REFACTORINTERVAL
SCIP_Real SCIPsetEpsilon(SCIP_SET *set)
SCIP_RETCODE SCIPsetChgParamFixed(SCIP_SET *set, const char *name, SCIP_Bool fixed)
SCIP_BENDERS * SCIPsetFindBenders(SCIP_SET *set, const char *name)
#define SCIP_DEFAULT_REOPT_SOLVELPDIFF
SCIP_Bool SCIPsetIsSumRelEQ(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)
#define SCIP_DEFAULT_CONS_OBSOLETEAGE
SCIP_CUTSEL * SCIPsetFindCutsel(SCIP_SET *set, const char *name)
SCIP_RETCODE SCIPsetIncludeExprhdlr(SCIP_SET *set, SCIP_EXPRHDLR *exprhdlr)
void SCIPsetSortComprsName(SCIP_SET *set)
#define SCIP_DEFAULT_LIMIT_GAP
#define SCIP_DEFAULT_CONF_PROOFSCOREFAC
SCIP_RETCODE SCIPsetExitprePlugins(SCIP_SET *set, BMS_BLKMEM *blkmem, SCIP_STAT *stat)
SCIP_Bool SCIPsetIsSumGE(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)
#define SCIP_DEFAULT_LP_RESOLVEALGORITHM
#define SCIP_DEFAULT_CONF_WEIGHTREPROPDEPTH
void SCIPsetSortPricersName(SCIP_SET *set)
#define SCIP_DEFAULT_MEM_PATHGROWFAC
#define SCIP_DEFAULT_REOPT_OBJSIMDELAY
#define SCIP_DEFAULT_SEPA_MAXSTALLROUNDSROOT
#define SCIP_DEFAULT_PROP_MAXROUNDSROOT
SCIP_RETCODE SCIPsetChgRealParam(SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, SCIP_PARAM *param, SCIP_Real value)
SCIP_Bool SCIPsetIsEQ(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)
SCIP_Bool SCIPsetIsFeasZero(SCIP_SET *set, SCIP_Real val)
#define SCIP_DEFAULT_DECOMP_BENDERSLABELS
#define SCIP_DEFAULT_MISC_TRANSSOLSORIG
#define SCIP_DEFAULT_LIMIT_RESTARTS
SCIP_RETCODE SCIPsetChgBoolParam(SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, SCIP_PARAM *param, SCIP_Bool value)
#define SCIP_DEFAULT_BRANCH_LPGAINNORMALIZE
#define SCIP_DEFAULT_LP_CLEANUPROWSROOT
SCIP_Bool SCIPsetIsSumNegative(SCIP_SET *set, SCIP_Real val)
#define SCIP_DEFAULT_CONF_USEPSEUDO
#define SCIP_DEFAULT_LP_LEXDUALALGO
#define SCIP_DEFAULT_RANDOM_PERMUTATIONSEED
#define SCIP_DEFAULT_REOPT_SAVECONSPROP
#define SCIP_DEFAULT_LP_RESOLVEITERMIN
#define SCIP_DEFAULT_REOPT_SEPAGLBINFSUBTREES
SCIP_STAGE SCIPsetGetStage(SCIP_SET *set)
SCIP_Bool SCIPsetIsSumLT(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)
#define SCIP_DEFAULT_PRESOL_CLQTABLEFAC
SCIP_RETCODE SCIPsetIncludeProp(SCIP_SET *set, SCIP_PROP *prop)
#define SCIP_DEFAULT_VISUAL_VBCFILENAME
SCIP_RETCODE SCIPsetIncludeCutsel(SCIP_SET *set, SCIP_CUTSEL *cutsel)
SCIP_Real SCIPsetGetSepaMaxCoefRatioRowprep(SCIP_SET *set)
SCIP_Bool SCIPsetIsFeasLT(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)
#define SCIP_DEFAULT_SEPA_CUTSELSUBSCIP
SCIP_RETCODE SCIPsetIncludeConshdlr(SCIP_SET *set, SCIP_CONSHDLR *conshdlr)
void SCIPsetSortPricers(SCIP_SET *set)
#define SCIP_DEFAULT_DISP_HEADERFREQ
SCIP_Real SCIPsetFrac(SCIP_SET *set, SCIP_Real val)
SCIP_RETCODE SCIPsetSetCharParam(SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, const char *name, char value)
#define SCIP_DEFAULT_CONS_AGELIMIT
SCIP_RETCODE SCIPsetSetSubscipsOff(SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, SCIP_Bool quiet)
SCIP_Bool SCIPsetIsUbBetter(SCIP_SET *set, SCIP_Real newub, SCIP_Real oldlb, SCIP_Real oldub)
#define SCIP_DEFAULT_MEM_PATHGROWINIT
#define SCIP_DEFAULT_LP_MARKOWITZ
#define SCIP_DEFAULT_PRICE_DELVARSROOT
void SCIPsetSortSepas(SCIP_SET *set)
void SCIPsetReinsertConshdlrSepaPrio(SCIP_SET *set, SCIP_CONSHDLR *conshdlr, int oldpriority)
#define SCIP_DEFAULT_CONF_PREFINFPROOF
#define SCIP_DEFAULT_CONF_CONFLITGRAPHWEIGHT
#define SCIP_DEFAULT_LP_SOLUTIONPOLISHING
#define SCIP_DEFAULT_LP_FREESOLVALBUFFERS
#define SCIP_DEFAULT_BRANCH_MIDPULLRELDOMTRIG
SCIP_RETCODE SCIPsetIncludeHeur(SCIP_SET *set, SCIP_HEUR *heur)
#define SCIP_DEFAULT_MISC_RESETSTAT
#define SCIP_DEFAULT_LP_ROWREPSWITCH
#define SCIP_DEFAULT_LIMIT_AUTORESTARTNODES
#define SCIP_DEFAULT_SEPA_MAXLOCALBOUNDDIST
#define SCIP_DEFAULT_TIME_READING
#define SCIP_DEFAULT_REOPT_STOREVARHISTOTY
#define SCIP_DEFAULT_SEPA_EFFICACYNORM
#define SCIP_DEFAULT_REOPT_STRONGBRANCHINIT
SCIP_Real SCIPsetLPFeastolFactor(SCIP_SET *set)
#define SCIP_DEFAULT_LP_RESOLVERESTORE
#define SCIP_DEFAULT_VISUAL_REALTIME
static int calcGrowSize(int initsize, SCIP_Real growfac, int num)
#define SCIP_DEFAULT_LP_CHECKSTABILITY
#define SCIP_DEFAULT_MEM_TREEGROWINIT
SCIP_Real SCIPsetInfinity(SCIP_SET *set)
SCIP_RETCODE SCIPsetGetIntParam(SCIP_SET *set, const char *name, int *value)
#define SCIP_DEFAULT_REOPT_OBJSIMROOTLP
SCIP_RETCODE SCIPsetIncludeEventhdlr(SCIP_SET *set, SCIP_EVENTHDLR *eventhdlr)
#define SCIP_DEFAULT_MISC_REFERENCEVALUE
void SCIPsetSortProps(SCIP_SET *set)
SCIP_RETCODE SCIPsetCreate(SCIP_SET **set, SCIP_MESSAGEHDLR *messagehdlr, BMS_BLKMEM *blkmem, SCIP *scip)
SCIP_Real SCIPsetSumepsilon(SCIP_SET *set)
#define SCIP_DEFAULT_REOPT_USEPSCOST
SCIP_RETCODE SCIPsetSetPresolving(SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, SCIP_PARAMSETTING paramsetting, SCIP_Bool quiet)
SCIP_Bool SCIPsetIsLT(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)
#define SCIP_DEFAULT_LP_ALWAYSGETDUALS
SCIP_Bool SCIPsetIsInfinity(SCIP_SET *set, SCIP_Real val)
SCIP_RETCODE SCIPsetGetRealParam(SCIP_SET *set, const char *name, SCIP_Real *value)
void SCIPsetSortHeurs(SCIP_SET *set)
#define SCIP_DEFAULT_REOPT_FORCEHEURRESTART
#define SCIP_DEFAULT_CONF_REMOVEABLE
#define SCIP_DEFAULT_SEPA_MAXADDROUNDS
SCIP_Bool SCIPsetIsSumZero(SCIP_SET *set, SCIP_Real val)
SCIP_RETCODE SCIPsetIncludePresol(SCIP_SET *set, SCIP_PRESOL *presol)
#define SCIP_DEFAULT_BRANCH_PREFERBINARY
SCIP_Real SCIPsetDualfeasRound(SCIP_SET *set, SCIP_Real val)
#define SCIP_DEFAULT_CONCURRENT_FREQINIT
SCIP_RETCODE SCIPsetChgStringParam(SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, SCIP_PARAM *param, const char *value)
SCIP_Bool SCIPsetIsDualfeasIntegral(SCIP_SET *set, SCIP_Real val)
#define SCIP_DEFAULT_CONF_DYNAMIC
SCIP_Bool SCIPsetIsRelGE(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)
SCIP_RETCODE SCIPsetIncludeNodesel(SCIP_SET *set, SCIP_NODESEL *nodesel)
SCIP_SEPA * SCIPsetFindSepa(SCIP_SET *set, const char *name)
SCIP_RETCODE SCIPsetIncludeCompr(SCIP_SET *set, SCIP_COMPR *compr)
int SCIPsetCalcPathGrowSize(SCIP_SET *set, int num)
SCIP_Bool SCIPsetIsDualfeasPositive(SCIP_SET *set, SCIP_Real val)
void SCIPsetSortHeursName(SCIP_SET *set)
SCIP_RETCODE SCIPsetChgCharParam(SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, SCIP_PARAM *param, char value)
#define SCIP_DEFAULT_CONF_MAXCONSS
void SCIPsetSortNlpis(SCIP_SET *set)
SCIP_NLPI * SCIPsetFindNlpi(SCIP_SET *set, const char *name)
SCIP_RETCODE SCIPsetResetParams(SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr)
#define SCIP_DEFAULT_DECOMP_DISABLEMEASURES
#define SCIP_DEFAULT_HEUR_USEUCTSUBSCIP
void SCIPsetSortBenders(SCIP_SET *set)
#define SCIP_DEFAULT_LP_SOLVEDEPTH
void SCIPsetSortExprhdlrs(SCIP_SET *set)
#define SCIP_DEFAULT_LP_LEXDUALROOTONLY
SCIP_Bool SCIPsetIsDualfeasEQ(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)
#define SCIP_DEFAULT_TIME_ENABLED
void SCIPsetEnableOrDisablePluginClocks(SCIP_SET *set, SCIP_Bool enabled)
int SCIPsetGetNParams(SCIP_SET *set)
#define SCIP_DEFAULT_MISC_USESMALLTABLES
#define SCIP_DEFAULT_MISC_SHOWDIVINGSTATS
#define SCIP_DEFAULT_CONF_RESTARTFAC
SCIP_Bool SCIPsetIsDualfeasGT(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)
SCIP_Bool SCIPsetIsSumRelLT(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)
#define SCIP_DEFAULT_LIMIT_MAXORIGSOL
#define SCIP_DEFAULT_MISC_TRANSORIGSOLS
SCIP_PARAM * SCIPsetGetParam(SCIP_SET *set, const char *name)
#define SCIP_DEFAULT_READ_DYNAMICROWS
#define SCIP_DEFAULT_SEPA_MAXROUNDS
SCIP_Bool SCIPsetIsRelGT(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)
#define SCIP_DEFAULT_MISC_USEVARTABLE
SCIP_RETCODE SCIPsetExitsolPlugins(SCIP_SET *set, BMS_BLKMEM *blkmem, SCIP_STAT *stat, SCIP_Bool restart)
#define SCIP_DEFAULT_BENDERS_CUTLPSOL
#define SCIP_DEFAULT_CONF_MAXSTORESIZE
#define SCIP_DEFAULT_LP_CHECKFARKAS
#define SCIP_DEFAULT_MISC_ALLOWWEAKDUALREDS
#define SCIP_DEFAULT_PRESOL_MAXRESTARTS
SCIP_Bool SCIPsetIsGT(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)
#define SCIP_DEFAULT_CONF_LPITERATIONS
void SCIPsetSortSepasName(SCIP_SET *set)
SCIP_Bool SCIPsetIsSumEQ(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)
#define SCIP_DEFAULT_LP_LEXDUALBASIC
SCIP_RETCODE SCIPsetChgIntParam(SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, SCIP_PARAM *param, int value)
#define SCIP_DEFAULT_REOPT_SHRINKINNER
SCIP_PROP * SCIPsetFindProp(SCIP_SET *set, const char *name)
#define SCIP_DEFAULT_CONF_USEBOUNDLP
#define SCIP_DEFAULT_MISC_CATCHCTRLC
#define SCIP_DEFAULT_RANDOM_PERMUTEVARS
#define SCIP_DEFAULT_CONF_RECONVLEVELS
SCIP_CONFLICTHDLR * SCIPsetFindConflicthdlr(SCIP_SET *set, const char *name)
#define SCIP_DEFAULT_BRANCH_SCOREFAC
SCIP_Bool SCIPsetIsIntegral(SCIP_SET *set, SCIP_Real val)
SCIP_Real SCIPsetDualfeasFrac(SCIP_SET *set, SCIP_Real val)
#define SCIP_DEFAULT_MISC_AVOIDMEMOUT
SCIP_Bool SCIPsetIsZero(SCIP_SET *set, SCIP_Real val)
#define SCIP_DEFAULT_LP_LEXDUALSTALLING
#define SCIP_DEFAULT_REOPT_SOLVELP
SCIP_Bool SCIPsetIsUpdateUnreliable(SCIP_SET *set, SCIP_Real newvalue, SCIP_Real oldvalue)
#define SCIP_DEFAULT_DECOMP_APPLYBENDERS
#define SCIP_DEFAULT_CONCURRENT_FREQMAX
#define SCIP_DEFAULT_CONF_SCOREFAC
SCIP_Real SCIPsetDualfeasFloor(SCIP_SET *set, SCIP_Real val)
SCIP_RETCODE SCIPsetSetBoolParam(SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, const char *name, SCIP_Bool value)
#define SCIP_DEFAULT_DISP_ALLVIOLS
SCIP_Bool SCIPsetIsFracIntegral(SCIP_SET *set, SCIP_Real val)
SCIP_RETCODE SCIPsetIncludeNlpi(SCIP_SET *set, SCIP_NLPI *nlpi)
int SCIPsetGetPriceMaxvars(SCIP_SET *set, SCIP_Bool root)
SCIP_Real SCIPsetPseudocostdelta(SCIP_SET *set)
SCIP_Real SCIPsetSumCeil(SCIP_SET *set, SCIP_Real val)
SCIP_Real SCIPsetSumFrac(SCIP_SET *set, SCIP_Real val)
#define SCIP_DEFAULT_LIMIT_STALLNODES
SCIP_Real SCIPsetFeasFrac(SCIP_SET *set, SCIP_Real val)
#define SCIP_DEFAULT_RANDOM_LPSEED
#define SCIP_DEFAULT_REOPT_USECUTS
#define SCIP_DEFAULT_LIMIT_MAXSOL
#define SCIP_DEFAULT_CONCURRENT_CHANGESEEDS
SCIP_Real SCIPsetCutoffbounddelta(SCIP_SET *set)
SCIP_DEBUGSOLDATA * SCIPsetGetDebugSolData(SCIP_SET *set)
#define SCIP_DEFAULT_CONF_USESB
#define SCIP_DEFAULT_CONF_IGNORERELAXEDBD
SCIP_RETCODE SCIPsetExitPlugins(SCIP_SET *set, BMS_BLKMEM *blkmem, SCIP_STAT *stat)
SCIP_Bool SCIPsetIsSumRelLE(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)
SCIP_BRANCHRULE * SCIPsetFindBranchrule(SCIP_SET *set, const char *name)
SCIP_Bool SCIPsetIsDualfeasGE(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)
#define SCIP_DEFAULT_LP_ROWAGELIMIT
SCIP_Real SCIPsetGetReferencevalue(SCIP_SET *set)
#define SCIP_DEFAULT_PRICE_MAXVARS
#define SCIP_DEFAULT_DISP_RELEVANTSTATS
SCIP_READER * SCIPsetFindReader(SCIP_SET *set, const char *name)
#define SCIP_DEFAULT_SEPA_MAXCUTS
SCIP_Real SCIPsetRecompfac(SCIP_SET *set)
SCIP_Bool SCIPsetIsFeasGE(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)
SCIP_RETCODE SCIPsetIncludeDialog(SCIP_SET *set, SCIP_DIALOG *dialog)
#define SCIP_DEFAULT_LP_CHECKDUALFEAS
void SCIPsetSortBendersName(SCIP_SET *set)
#define SCIP_DEFAULT_READ_DYNAMICCONSS
#define SCIP_DEFAULT_MISC_ALLOWSTRONGDUALREDS
#define SCIP_DEFAULT_NLP_SOLVER
#define SCIP_DEFAULT_LP_SOLVEFREQ
SCIP_EVENTHDLR * SCIPsetFindEventhdlr(SCIP_SET *set, const char *name)
#define SCIP_DEFAULT_CONF_SEPARATE
#define SCIP_DEFAULT_CONF_INTERCONSS
SCIP_RETCODE SCIPsetInitprePlugins(SCIP_SET *set, BMS_BLKMEM *blkmem, SCIP_STAT *stat)
SCIP_Real SCIPsetGetHugeValue(SCIP_SET *set)
#define SCIP_DEFAULT_CONCURRENT_NBESTSOLS
SCIP_Bool SCIPsetIsRelLE(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)
#define SCIP_DEFAULT_REOPT_COMMONTIMELIMIT
SCIP_RETCODE SCIPsetReadParams(SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, const char *filename)
#define SCIP_DEFAULT_SEPA_MAXCOEFRATIOFACROWPREP
void SCIPsetSortConflicthdlrs(SCIP_SET *set)
void SCIPsetSetLimitChanged(SCIP_SET *set)
SCIP_Real SCIPsetBarrierconvtol(SCIP_SET *set)
SCIP_RETCODE SCIPsetFree(SCIP_SET **set, BMS_BLKMEM *blkmem)
SCIP_PRESOL * SCIPsetFindPresol(SCIP_SET *set, const char *name)
#define SCIP_DEFAULT_LP_PRESOLVING
#define SCIP_DEFAULT_SEPA_MAXCUTSROOT
#define SCIP_DEFAULT_REOPT_MAXCUTAGE
SCIP_RETCODE SCIPsetSetEmphasis(SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, SCIP_PARAMEMPHASIS paramemphasis, SCIP_Bool quiet)
#define SCIP_DEFAULT_CONCURRENT_TARGETPROGRESS
SCIP_Real SCIPsetRound(SCIP_SET *set, SCIP_Real val)
#define SCIP_DEFAULT_PRESOL_DONOTAGGR
#define SCIP_DEFAULT_REOPT_ENABLE
SCIP_RETCODE SCIPsetCopyParams(SCIP_SET *sourceset, SCIP_SET *targetset, SCIP_MESSAGEHDLR *messagehdlr)
#define SCIP_DEFAULT_PRESOL_ABORTFAC
SCIP_Bool SCIPsetIsSumPositive(SCIP_SET *set, SCIP_Real val)
#define SCIP_DEFAULT_PROP_ABORTONCUTOFF
int SCIPsetCalcMemGrowSize(SCIP_SET *set, int num)
#define SCIP_DEFAULT_CONCURRENT_MINSYNCDELAY
SCIP_RETCODE SCIPsetIncludeExternalCode(SCIP_SET *set, const char *name, const char *description)
#define SCIP_DEFAULT_SEPA_MAXROUNDSROOTSUBRUN
#define SCIP_DEFAULT_CONCURRENT_MAXNSYNCDELAY
SCIP_RETCODE SCIPsetChgLongintParam(SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, SCIP_PARAM *param, SCIP_Longint value)
#define SCIP_DEFAULT_VISUAL_DISPLB
#define SCIP_DEFAULT_LP_INITALGORITHM
#define SCIP_DEFAULT_DISP_WIDTH
SCIP_NODESEL * SCIPsetGetNodesel(SCIP_SET *set, SCIP_STAT *stat)
#define SCIP_DEFAULT_BRANCH_DIVINGPSCOST
#define SCIP_DEFAULT_BRANCH_CLAMP
SCIP_Bool SCIPsetIsFeasIntegral(SCIP_SET *set, SCIP_Real val)
SCIP_Bool SCIPsetIsNegative(SCIP_SET *set, SCIP_Real val)
#define SCIP_DEFAULT_MEM_SAVEFAC
unsigned int SCIPsetInitializeRandomSeed(SCIP_SET *set, unsigned int initialseedvalue)
void SCIPsetSetPriorityNlpi(SCIP_SET *set, SCIP_NLPI *nlpi, int priority)
#define SCIP_DEFAULT_SEPA_CUTSELRESTART
SCIP_BANDITVTABLE * SCIPsetFindBanditvtable(SCIP_SET *set, const char *name)
internal methods for global SCIP settings
SCIP_RETCODE SCIPbendersExit(SCIP_BENDERS *benders, SCIP_SET *set)
SCIP_RETCODE SCIPbendersFree(SCIP_BENDERS **benders, SCIP_SET *set)
SCIP_RETCODE SCIPbendersInitsol(SCIP_BENDERS *benders, SCIP_SET *set)
SCIP_RETCODE SCIPbendersInitpre(SCIP_BENDERS *benders, SCIP_SET *set, SCIP_STAT *stat)
SCIP_RETCODE SCIPbendersExitpre(SCIP_BENDERS *benders, SCIP_SET *set, SCIP_STAT *stat)
SCIP_RETCODE SCIPbendersExitsol(SCIP_BENDERS *benders, SCIP_SET *set)
SCIP_RETCODE SCIPbendersInit(SCIP_BENDERS *benders, SCIP_SET *set)
internal methods for Benders' decomposition
internal methods for problem statistics
SCIP main data structure.
SCIP_RETCODE SCIPtableCopyInclude(SCIP_TABLE *table, SCIP_SET *set)
SCIP_RETCODE SCIPtableFree(SCIP_TABLE **table, SCIP_SET *set)
SCIP_RETCODE SCIPtableExitsol(SCIP_TABLE *table, SCIP_SET *set)
SCIP_RETCODE SCIPtableInitsol(SCIP_TABLE *table, SCIP_SET *set)
SCIP_RETCODE SCIPtableInit(SCIP_TABLE *table, SCIP_SET *set)
SCIP_RETCODE SCIPtableExit(SCIP_TABLE *table, SCIP_SET *set)
internal methods for displaying statistics tables
enum SCIP_ClockType SCIP_CLOCKTYPE
enum SCIP_VerbLevel SCIP_VERBLEVEL
enum SCIP_ParamSetting SCIP_PARAMSETTING
struct SCIP_ParamData SCIP_PARAMDATA
enum SCIP_ParamEmphasis SCIP_PARAMEMPHASIS
#define SCIP_DECL_PARAMCHGD(x)
enum SCIP_Retcode SCIP_RETCODE
@ SCIP_STAGE_INITPRESOLVE
enum SCIP_Stage SCIP_STAGE