66 #define SCIP_DEFAULT_BRANCH_SCOREFUNC 'p' 67 #define SCIP_DEFAULT_BRANCH_SCOREFAC 0.167 69 #define SCIP_DEFAULT_BRANCH_PREFERBINARY FALSE 70 #define SCIP_DEFAULT_BRANCH_CLAMP 0.2 72 #define SCIP_DEFAULT_BRANCH_LPGAINNORMALIZE 's' 73 #define SCIP_DEFAULT_BRANCH_DELAYPSCOST TRUE 74 #define SCIP_DEFAULT_BRANCH_DIVINGPSCOST TRUE 75 #define SCIP_DEFAULT_BRANCH_FORCEALL FALSE 77 #define SCIP_DEFAULT_BRANCH_FIRSTSBCHILD 'a' 78 #define SCIP_DEFAULT_BRANCH_CHECKSBSOL TRUE 79 #define SCIP_DEFAULT_BRANCH_ROUNDSBSOL TRUE 80 #define SCIP_DEFAULT_BRANCH_SUMADJUSTSCORE FALSE 84 #define SCIP_DEFAULT_COMPR_ENABLE FALSE 89 #define SCIP_DEFAULT_CONF_ENABLE TRUE 90 #define SCIP_DEFAULT_CONF_MAXVARSFAC 0.15 91 #define SCIP_DEFAULT_CONF_MINMAXVARS 0 92 #define SCIP_DEFAULT_CONF_MAXLPLOOPS 2 94 #define SCIP_DEFAULT_CONF_LPITERATIONS 10 96 #define SCIP_DEFAULT_CONF_USEPROP TRUE 97 #define SCIP_DEFAULT_CONF_USEINFLP 'b' 100 #define SCIP_DEFAULT_CONF_USEBOUNDLP 'b' 103 #define SCIP_DEFAULT_CONF_USESB TRUE 105 #define SCIP_DEFAULT_CONF_USEPSEUDO TRUE 106 #define SCIP_DEFAULT_CONF_PREFINFPROOF TRUE 107 #define SCIP_DEFAULT_CONF_SEPARATE TRUE 108 #define SCIP_DEFAULT_CONF_DYNAMIC TRUE 113 #define SCIP_DEFAULT_CONF_MAXSTORESIZE 10000 114 #define SCIP_DEFAULT_CONF_RECONVLEVELS -1 116 #define SCIP_DEFAULT_CONF_CLEANBNDDEPEND TRUE 117 #define SCIP_DEFAULT_CONF_FUIPLEVELS -1 119 #define SCIP_DEFAULT_CONF_INTERCONSS -1 121 #define SCIP_DEFAULT_CONF_MAXCONSS 10 123 #define SCIP_DEFAULT_CONF_PREFERBINARY FALSE 124 #define SCIP_DEFAULT_CONF_ALLOWLOCAL TRUE 125 #define SCIP_DEFAULT_CONF_SETTLELOCAL FALSE 127 #define SCIP_DEFAULT_CONF_REPROPAGATE TRUE 129 #define SCIP_DEFAULT_CONF_KEEPREPROP TRUE 130 #define SCIP_DEFAULT_CONF_REMOVEABLE TRUE 131 #define SCIP_DEFAULT_CONF_DEPTHSCOREFAC 1.0 132 #define SCIP_DEFAULT_CONF_PROOFSCOREFAC 1.0 133 #define SCIP_DEFAULT_CONF_UPLOCKSCOREFAC 0.0 134 #define SCIP_DEFAULT_CONF_DOWNLOCKSCOREFAC 0.0 135 #define SCIP_DEFAULT_CONF_SCOREFAC 0.98 136 #define SCIP_DEFAULT_CONF_RESTARTNUM 0 138 #define SCIP_DEFAULT_CONF_RESTARTFAC 1.5 139 #define SCIP_DEFAULT_CONF_IGNORERELAXEDBD FALSE 140 #define SCIP_DEFAULT_CONF_MAXVARSDETECTIMPLIEDBOUNDS 250 141 #define SCIP_DEFAULT_CONF_FULLSHORTENCONFLICT TRUE 142 #define SCIP_DEFAULT_CONF_CONFLITWEIGHT 0.0 143 #define SCIP_DEFAULT_CONF_CONFLITGRAPHWEIGHT 1.0 144 #define SCIP_DEFAULT_CONF_WEIGHTSIZE 0.001 145 #define SCIP_DEFAULT_CONF_WEIGHTREPROPDEPTH 0.1 146 #define SCIP_DEFAULT_CONF_WEIGHTVALIDDEPTH 1.0 147 #define SCIP_DEFAULT_CONF_MINIMPROVE 0.05 151 #define SCIP_DEFAULT_CONF_SEPAALTPROOFS FALSE 155 #define SCIP_DEFAULT_CONS_AGELIMIT 0 157 #define SCIP_DEFAULT_CONS_OBSOLETEAGE -1 159 #define SCIP_DEFAULT_CONS_DISABLEENFOPS FALSE 164 #define SCIP_DEFAULT_DISP_VERBLEVEL SCIP_VERBLEVEL_HIGH 165 #define SCIP_DEFAULT_DISP_WIDTH 139 166 #define SCIP_DEFAULT_DISP_FREQ 100 167 #define SCIP_DEFAULT_DISP_HEADERFREQ 15 168 #define SCIP_DEFAULT_DISP_LPINFO FALSE 169 #define SCIP_DEFAULT_DISP_ALLVIOLS FALSE 173 #define SCIP_DEFAULT_HISTORY_VALUEBASED FALSE 174 #define SCIP_DEFAULT_HISTORY_ALLOWMERGE FALSE 175 #define SCIP_DEFAULT_HISTORY_ALLOWTRANSFER FALSE 179 #define SCIP_DEFAULT_LIMIT_TIME 1e+20 180 #define SCIP_DEFAULT_LIMIT_MEMORY SCIP_MEM_NOLIMIT 181 #define SCIP_DEFAULT_LIMIT_GAP 0.0 182 #define SCIP_DEFAULT_LIMIT_ABSGAP 0.0 184 #define SCIP_DEFAULT_LIMIT_NODES -1LL 185 #define SCIP_DEFAULT_LIMIT_STALLNODES -1LL 187 #define SCIP_DEFAULT_LIMIT_SOLUTIONS -1 188 #define SCIP_DEFAULT_LIMIT_BESTSOL -1 190 #define SCIP_DEFAULT_LIMIT_MAXSOL 100 191 #define SCIP_DEFAULT_LIMIT_MAXORIGSOL 10 192 #define SCIP_DEFAULT_LIMIT_RESTARTS -1 193 #define SCIP_DEFAULT_LIMIT_AUTORESTARTNODES -1 198 #define SCIP_DEFAULT_LP_SOLVEFREQ 1 199 #define SCIP_DEFAULT_LP_ITERLIM -1LL 200 #define SCIP_DEFAULT_LP_ROOTITERLIM -1LL 201 #define SCIP_DEFAULT_LP_SOLVEDEPTH -1 202 #define SCIP_DEFAULT_LP_INITALGORITHM 's' 204 #define SCIP_DEFAULT_LP_RESOLVEALGORITHM 's' 206 #define SCIP_DEFAULT_LP_PRICING 'l' 209 #define SCIP_DEFAULT_LP_CLEARINITIALPROBINGLP TRUE 211 #define SCIP_DEFAULT_LP_RESOLVERESTORE FALSE 212 #define SCIP_DEFAULT_LP_FREESOLVALBUFFERS FALSE 213 #define SCIP_DEFAULT_LP_COLAGELIMIT 10 215 #define SCIP_DEFAULT_LP_ROWAGELIMIT 10 217 #define SCIP_DEFAULT_LP_CLEANUPCOLS FALSE 218 #define SCIP_DEFAULT_LP_CLEANUPCOLSROOT FALSE 219 #define SCIP_DEFAULT_LP_CLEANUPROWS TRUE 220 #define SCIP_DEFAULT_LP_CLEANUPROWSROOT TRUE 221 #define SCIP_DEFAULT_LP_CHECKSTABILITY TRUE 222 #define SCIP_DEFAULT_LP_CONDITIONLIMIT -1.0 223 #define SCIP_DEFAULT_LP_CHECKPRIMFEAS TRUE 224 #define SCIP_DEFAULT_LP_CHECKDUALFEAS TRUE 225 #define SCIP_DEFAULT_LP_FASTMIP 1 226 #define SCIP_DEFAULT_LP_SCALING 1 227 #define SCIP_DEFAULT_LP_PRESOLVING TRUE 228 #define SCIP_DEFAULT_LP_LEXDUALALGO FALSE 229 #define SCIP_DEFAULT_LP_LEXDUALROOTONLY TRUE 230 #define SCIP_DEFAULT_LP_LEXDUALMAXROUNDS 2 231 #define SCIP_DEFAULT_LP_LEXDUALBASIC FALSE 232 #define SCIP_DEFAULT_LP_LEXDUALSTALLING TRUE 233 #define SCIP_DEFAULT_LP_DISABLECUTOFF 2 234 #define SCIP_DEFAULT_LP_ROWREPSWITCH 1.2 236 #define SCIP_DEFAULT_LP_THREADS 0 237 #define SCIP_DEFAULT_LP_RESOLVEITERFAC -1.0 239 #define SCIP_DEFAULT_LP_RESOLVEITERMIN 1000 240 #define SCIP_DEFAULT_LP_SOLUTIONPOLISHING 3 241 #define SCIP_DEFAULT_LP_REFACTORINTERVAL 0 245 #define SCIP_DEFAULT_NLP_SOLVER "" 246 #define SCIP_DEFAULT_NLP_DISABLE FALSE 251 #define SCIP_DEFAULT_MEM_SAVEFAC 0.8 252 #define SCIP_DEFAULT_MEM_TREEGROWFAC 2.0 253 #define SCIP_DEFAULT_MEM_PATHGROWFAC 2.0 254 #define SCIP_DEFAULT_MEM_TREEGROWINIT 65536 255 #define SCIP_DEFAULT_MEM_PATHGROWINIT 256 260 #define SCIP_DEFAULT_MISC_CATCHCTRLC TRUE 261 #define SCIP_DEFAULT_MISC_USEVARTABLE TRUE 262 #define SCIP_DEFAULT_MISC_USECONSTABLE TRUE 263 #define SCIP_DEFAULT_MISC_USESMALLTABLES FALSE 264 #define SCIP_DEFAULT_MISC_EXACTSOLVE FALSE 265 #define SCIP_DEFAULT_MISC_RESETSTAT TRUE 270 #define SCIP_DEFAULT_MISC_IMPROVINGSOLS FALSE 271 #define SCIP_DEFAULT_MISC_PRINTREASON TRUE 272 #define SCIP_DEFAULT_MISC_ESTIMEXTERNMEM TRUE 273 #define SCIP_DEFAULT_MISC_TRANSORIGSOLS TRUE 274 #define SCIP_DEFAULT_MISC_TRANSSOLSORIG TRUE 275 #define SCIP_DEFAULT_MISC_CALCINTEGRAL TRUE 276 #define SCIP_DEFAULT_MISC_FINITESOLSTORE FALSE 277 #define SCIP_DEFAULT_MISC_OUTPUTORIGSOL TRUE 278 #define SCIP_DEFAULT_MISC_ALLOWDUALREDS TRUE 279 #define SCIP_DEFAULT_MISC_ALLOWOBJPROP TRUE 280 #define SCIP_DEFAULT_MISC_REFERENCEVALUE 1e99 281 #define SCIP_DEFAULT_MISC_USESYMMETRY 2 284 #ifdef WITH_DEBUG_SOLUTION 285 #define SCIP_DEFAULT_MISC_DEBUGSOLUTION "-" 289 #define SCIP_DEFAULT_RANDOM_RANDSEEDSHIFT 0 290 #define SCIP_DEFAULT_RANDOM_PERMUTATIONSEED 0 291 #define SCIP_DEFAULT_RANDOM_LPSEED 0 292 #define SCIP_DEFAULT_RANDOM_PERMUTECONSS TRUE 293 #define SCIP_DEFAULT_RANDOM_PERMUTEVARS FALSE 298 #define SCIP_DEFAULT_NODESEL_CHILDSEL 'h' 304 #define SCIP_DEFAULT_PRESOL_ABORTFAC 8e-04 306 #define SCIP_DEFAULT_PRESOL_MAXROUNDS -1 307 #define SCIP_DEFAULT_PRESOL_MAXRESTARTS -1 308 #define SCIP_DEFAULT_PRESOL_RESTARTFAC 0.025 310 #define SCIP_DEFAULT_PRESOL_IMMRESTARTFAC 0.10 312 #define SCIP_DEFAULT_PRESOL_SUBRESTARTFAC 1.00 314 #define SCIP_DEFAULT_PRESOL_RESTARTMINRED 0.10 316 #define SCIP_DEFAULT_PRESOL_DONOTMULTAGGR FALSE 317 #define SCIP_DEFAULT_PRESOL_DONOTAGGR FALSE 322 #define SCIP_DEFAULT_PRICE_ABORTFAC 2.0 324 #define SCIP_DEFAULT_PRICE_MAXVARS 100 325 #define SCIP_DEFAULT_PRICE_MAXVARSROOT 2000 326 #define SCIP_DEFAULT_PRICE_DELVARS FALSE 328 #define SCIP_DEFAULT_PRICE_DELVARSROOT FALSE 333 #define SCIP_DEFAULT_REOPT_OBJSIMSOL -1.0 335 #define SCIP_DEFAULT_REOPT_OBJSIMROOTLP 0.8 336 #define SCIP_DEFAULT_REOPT_OBJSIMDELAY -1.0 338 #define SCIP_DEFAULT_REOPT_VARORDERINTERDICTION 'd' 342 #define SCIP_DEFAULT_REOPT_MAXSAVEDNODES INT_MAX 343 #define SCIP_DEFAULT_REOPT_MAXDIFFOFNODES INT_MAX 345 #define SCIP_DEFAULT_REOPT_FORCEHEURRESTART 3 348 #define SCIP_DEFAULT_REOPT_SAVESOLS INT_MAX 349 #define SCIP_DEFAULT_REOPT_SOLVELP 1 350 #define SCIP_DEFAULT_REOPT_SOLVELPDIFF 1 351 #define SCIP_DEFAULT_REOPT_ENABLE FALSE 352 #define SCIP_DEFAULT_REOPT_SEPAGLBINFSUBTREES TRUE 353 #define SCIP_DEFAULT_REOPT_SEPABESTSOL FALSE 356 #define SCIP_DEFAULT_REOPT_STOREVARHISTOTY FALSE 359 #define SCIP_DEFAULT_REOPT_USEPSCOST FALSE 360 #define SCIP_DEFAULT_REOPT_COMMONTIMELIMIT FALSE 361 #define SCIP_DEFAULT_REOPT_SHRINKINNER TRUE 364 #define SCIP_DEFAULT_REOPT_STRONGBRANCHINIT TRUE 367 #define SCIP_DEFAULT_REOPT_REDUCETOFRONTIER TRUE 368 #define SCIP_DEFAULT_REOPT_SAVECONSPROP FALSE 369 #define SCIP_DEFAULT_REOPT_USESPLITCONS TRUE 372 #define SCIP_DEFAULT_REOPT_USECUTS FALSE 373 #define SCIP_DEFAULT_REOPT_MAXCUTAGE 0 377 #define SCIP_DEFAULT_PROP_MAXROUNDS 100 378 #define SCIP_DEFAULT_PROP_MAXROUNDSROOT 1000 379 #define SCIP_DEFAULT_PROP_ABORTONCUTOFF TRUE 385 #define SCIP_DEFAULT_SEPA_MAXBOUNDDIST 1.0 388 #define SCIP_DEFAULT_SEPA_MAXLOCALBOUNDDIST 0.0 391 #define SCIP_DEFAULT_SEPA_MAXCOEFRATIO 1e+4 392 #define SCIP_DEFAULT_SEPA_MINEFFICACY 1e-4 393 #define SCIP_DEFAULT_SEPA_MINEFFICACYROOT 1e-4 394 #define SCIP_DEFAULT_SEPA_MINORTHO 0.90 395 #define SCIP_DEFAULT_SEPA_MINORTHOROOT 0.90 396 #define SCIP_DEFAULT_SEPA_OBJPARALFAC 0.1 397 #define SCIP_DEFAULT_SEPA_INTSUPPORTFAC 0.1 398 #define SCIP_DEFAULT_SEPA_ORTHOFUNC 'e' 399 #define SCIP_DEFAULT_SEPA_EFFICACYNORM 'e' 401 #define SCIP_DEFAULT_SEPA_CUTSELRESTART 'a' 402 #define SCIP_DEFAULT_SEPA_CUTSELSUBSCIP 'a' 403 #define SCIP_DEFAULT_SEPA_MAXRUNS -1 404 #define SCIP_DEFAULT_SEPA_MAXROUNDS -1 405 #define SCIP_DEFAULT_SEPA_MAXROUNDSROOT -1 406 #define SCIP_DEFAULT_SEPA_MAXROUNDSROOTSUBRUN -1 407 #define SCIP_DEFAULT_SEPA_MAXADDROUNDS 1 409 #define SCIP_DEFAULT_SEPA_MAXSTALLROUNDSROOT 10 411 #define SCIP_DEFAULT_SEPA_MAXSTALLROUNDS 1 413 #define SCIP_DEFAULT_SEPA_MAXINCROUNDS 20 414 #define SCIP_DEFAULT_SEPA_MAXCUTS 100 415 #define SCIP_DEFAULT_SEPA_MAXCUTSROOT 2000 416 #define SCIP_DEFAULT_SEPA_CUTAGELIMIT 80 418 #define SCIP_DEFAULT_SEPA_POOLFREQ 10 419 #define SCIP_DEFAULT_SEPA_MINACTIVITYQUOT 0.8 423 #define SCIP_DEFAULT_PARALLEL_MODE 1 425 #define SCIP_DEFAULT_PARALLEL_MINNTHREADS 1 426 #define SCIP_DEFAULT_PARALLEL_MAXNTHREADS 8 429 #define SCIP_DEFAULT_CONCURRENT_CHANGESEEDS TRUE 430 #define SCIP_DEFAULT_CONCURRENT_CHANGECHILDSEL TRUE 431 #define SCIP_DEFAULT_CONCURRENT_COMMVARBNDS TRUE 432 #define SCIP_DEFAULT_CONCURRENT_PRESOLVEBEFORE TRUE 433 #define SCIP_DEFAULT_CONCURRENT_INITSEED 5131912 434 #define SCIP_DEFAULT_CONCURRENT_FREQINIT 10.0 436 #define SCIP_DEFAULT_CONCURRENT_FREQMAX 10.0 438 #define SCIP_DEFAULT_CONCURRENT_FREQFACTOR 1.5 439 #define SCIP_DEFAULT_CONCURRENT_TARGETPROGRESS 0.001 441 #define SCIP_DEFAULT_CONCURRENT_MAXNSOLS 3 442 #define SCIP_DEFAULT_CONCURRENT_MAXNSYNCDELAY 7 443 #define SCIP_DEFAULT_CONCURRENT_MINSYNCDELAY 10.0 444 #define SCIP_DEFAULT_CONCURRENT_NBESTSOLS 10 445 #define SCIP_DEFAULT_CONCURRENT_PARAMSETPREFIX "" 450 #define SCIP_DEFAULT_TIME_CLOCKTYPE SCIP_CLOCKTYPE_CPU 451 #define SCIP_DEFAULT_TIME_ENABLED TRUE 452 #define SCIP_DEFAULT_TIME_READING FALSE 453 #define SCIP_DEFAULT_TIME_RARECLOCKCHECK FALSE 454 #define SCIP_DEFAULT_TIME_STATISTICTIMING TRUE 459 #define SCIP_DEFAULT_VISUAL_VBCFILENAME "-" 460 #define SCIP_DEFAULT_VISUAL_BAKFILENAME "-" 461 #define SCIP_DEFAULT_VISUAL_REALTIME TRUE 462 #define SCIP_DEFAULT_VISUAL_DISPSOLS FALSE 463 #define SCIP_DEFAULT_VISUAL_OBJEXTERN TRUE 468 #define SCIP_DEFAULT_READ_INITIALCONSS TRUE 469 #define SCIP_DEFAULT_READ_DYNAMICCONSS TRUE 470 #define SCIP_DEFAULT_READ_DYNAMICCOLS FALSE 471 #define SCIP_DEFAULT_READ_DYNAMICROWS FALSE 472 #define SCIP_DEFAULT_WRITE_GENNAMES_OFFSET 0 479 #define SCIP_DEFAULT_WRITE_ALLCONSS FALSE 480 #define SCIP_DEFAULT_PRINTZEROS FALSE 494 assert(initsize >= 0);
495 assert(growfac >= 1.0);
499 size =
MAX(initsize, num);
505 initsize =
MAX(initsize, 4);
510 while( size < num && size > oldsize )
513 size = (int)(growfac * size + initsize);
517 if( size <= oldsize )
521 assert(size >= initsize);
598 SCIPerrorMessage(
"The infinity value of the LP solver has to be at least as large as the one of SCIP.\n");
643 int newarraygrowinit;
675 SCIPerrorMessage(
"Cannot turn on symmetry handling during (pre)solving.\n");
689 assert(messagehdlr != NULL);
691 if( set->reopt_enable )
751 for( i = set->nreaders - 1; i >= 0; --i )
754 for( i = set->npricers - 1; i >= 0; --i )
757 for( i = set->nconshdlrs - 1; i >= 0; --i )
760 for( i = set->nconflicthdlrs - 1; i >= 0; --i )
763 for( i = set->npresols - 1; i >= 0; --i )
766 for( i = set->nrelaxs - 1; i >= 0; --i )
769 for( i = set->nsepas - 1; i >= 0; --i )
772 for( i = set->nprops - 1; i >= 0; --i )
775 for( i = set->nheurs - 1; i >= 0; --i )
778 for( i = set->neventhdlrs - 1; i >= 0; --i )
781 for( i = set->nnodesels - 1; i >= 0; --i )
784 for( i = set->nbranchrules - 1; i >= 0; --i )
826 assert(sourceset != NULL);
827 assert(targetset != NULL);
828 assert(sourceset != targetset);
829 assert(allvalid != NULL);
834 if( copyreaders && sourceset->
readers != NULL )
836 for( p = sourceset->
nreaders - 1; p >= 0; --p )
843 if( copypricers && sourceset->
pricers != NULL )
845 for( p = sourceset->
npricers - 1; p >= 0; --p )
849 *allvalid = *allvalid && valid;
872 *allvalid = *allvalid && valid;
893 if( copypresolvers && sourceset->
presols != NULL )
895 for( p = sourceset->
npresols - 1; p >= 0; --p )
903 if( copyrelaxators && sourceset->
relaxs != NULL )
905 for( p = sourceset->
nrelaxs - 1; p >= 0; --p )
913 if( copyseparators && sourceset->
sepas != NULL )
915 for( p = sourceset->
nsepas - 1; p >= 0; --p )
922 if( copypropagators && sourceset->
props != NULL )
924 for( p = sourceset->
nprops - 1; p >= 0; --p )
931 if( copyheuristics && sourceset->
heurs != NULL )
933 for( p = sourceset->
nheurs - 1; p >= 0; --p )
940 if( copyeventhdlrs && sourceset->
eventhdlrs != NULL )
951 if( copynodeselectors && sourceset->
nodesels != NULL )
953 for( p = sourceset->
nnodesels - 1; p >= 0; --p )
960 if( copybranchrules && sourceset->
branchrules != NULL )
970 if( copydisplays && sourceset->
disps != NULL )
972 for( p = sourceset->
ndisps - 1; p >= 0; --p )
980 if( copydialogs && sourceset->
dialogs != NULL )
982 for( p = sourceset->
ndialogs - 1; p >= 0; --p )
990 if( copytables && sourceset->
tables != NULL )
992 for( p = sourceset->
ntables - 1; p >= 0; --p )
999 if( copynlpis && sourceset->
nlpis != NULL )
1001 for( p = sourceset->
nnlpis - 1; p >= 0; --p )
1020 assert(sourceset != NULL);
1021 assert(targetset != NULL);
1022 assert(sourceset != targetset);
1023 assert(targetset->
scip != NULL);
1038 assert(
set != NULL);
1039 assert(scip != NULL);
1044 (*set)->scip = scip;
1050 (*set)->readers = NULL;
1051 (*set)->nreaders = 0;
1052 (*set)->readerssize = 0;
1053 (*set)->pricers = NULL;
1054 (*set)->npricers = 0;
1055 (*set)->nactivepricers = 0;
1056 (*set)->pricerssize = 0;
1057 (*set)->pricerssorted =
FALSE;
1058 (*set)->pricersnamesorted =
FALSE;
1059 (*set)->conshdlrs = NULL;
1060 (*set)->conshdlrs_sepa = NULL;
1061 (*set)->conshdlrs_enfo = NULL;
1062 (*set)->conshdlrs_include = NULL;
1063 (*set)->nconshdlrs = 0;
1064 (*set)->conshdlrssize = 0;
1065 (*set)->conflicthdlrs = NULL;
1066 (*set)->nconflicthdlrs = 0;
1067 (*set)->conflicthdlrssize = 0;
1068 (*set)->conflicthdlrssorted =
FALSE;
1069 (*set)->conflicthdlrsnamesorted =
FALSE;
1071 (*set)->debugsoldata = NULL;
1074 (*set)->presols = NULL;
1075 (*set)->npresols = 0;
1076 (*set)->presolssize = 0;
1077 (*set)->presolssorted =
FALSE;
1078 (*set)->presolsnamesorted =
FALSE;
1079 (*set)->relaxs = NULL;
1080 (*set)->nrelaxs = 0;
1081 (*set)->relaxssize = 0;
1082 (*set)->relaxssorted =
FALSE;
1083 (*set)->relaxsnamesorted =
FALSE;
1084 (*set)->sepas = NULL;
1086 (*set)->sepassize = 0;
1087 (*set)->sepassorted =
FALSE;
1088 (*set)->sepasnamesorted =
FALSE;
1089 (*set)->props = NULL;
1090 (*set)->props_presol = NULL;
1092 (*set)->propssize = 0;
1093 (*set)->propssorted =
FALSE;
1094 (*set)->propspresolsorted =
FALSE;
1095 (*set)->propsnamesorted =
FALSE;
1096 (*set)->concsolvertypes = NULL;
1097 (*set)->nconcsolvertypes = 0;
1098 (*set)->concsolvertypessize = 0;
1099 (*set)->concsolvers = NULL;
1100 (*set)->nconcsolvers = 0;
1101 (*set)->concsolverssize = 0;
1102 (*set)->concurrent_paramsetprefix = NULL;
1103 (*set)->heurs = NULL;
1105 (*set)->heurssize = 0;
1106 (*set)->heurssorted =
FALSE;
1108 (*set)->comprs = NULL;
1109 (*set)->ncomprs = 0;
1110 (*set)->comprssize = 0;
1111 (*set)->comprssorted =
FALSE;
1112 (*set)->comprsnamesorted =
FALSE;
1113 (*set)->eventhdlrs = NULL;
1114 (*set)->neventhdlrs = 0;
1115 (*set)->eventhdlrssize = 0;
1116 (*set)->nodesels = NULL;
1117 (*set)->nnodesels = 0;
1118 (*set)->nodeselssize = 0;
1119 (*set)->nodesel = NULL;
1120 (*set)->branchrules = NULL;
1121 (*set)->nbranchrules = 0;
1122 (*set)->branchrulessize = 0;
1123 (*set)->branchrulessorted =
FALSE;
1124 (*set)->branchrulesnamesorted =
FALSE;
1125 (*set)->banditvtables = NULL;
1126 (*set)->banditvtablessize = 0;
1127 (*set)->nbanditvtables = 0;
1128 (*set)->disps = NULL;
1130 (*set)->dispssize = 0;
1131 (*set)->tables = NULL;
1132 (*set)->ntables = 0;
1133 (*set)->tablessize = 0;
1134 (*set)->tablessorted =
FALSE;
1135 (*set)->dialogs = NULL;
1136 (*set)->ndialogs = 0;
1137 (*set)->dialogssize = 0;
1138 (*set)->nlpis = NULL;
1140 (*set)->nlpissize = 0;
1141 (*set)->nlpissorted =
FALSE;
1142 (*set)->limitchanged =
FALSE;
1143 (*set)->extcodenames = NULL;
1144 (*set)->extcodedescs = NULL;
1145 (*set)->nextcodes = 0;
1146 (*set)->extcodessize = 0;
1147 (*set)->visual_vbcfilename = NULL;
1148 (*set)->visual_bakfilename = NULL;
1149 (*set)->nlp_solver = NULL;
1150 (*set)->nlp_disable =
FALSE;
1152 (*set)->misc_debugsol = NULL;
1155 (*set)->istimelimitfinite =
FALSE;
1159 "branching/scorefunc",
1160 "branching score function ('s'um, 'p'roduct, 'q'uotient)",
1164 "branching/scorefac",
1165 "branching score factor to weigh downward and upward gain prediction in sum score function",
1169 "branching/preferbinary",
1170 "should branching on binary variables be preferred?",
1175 "minimal relative distance of branching point to bounds when branching on a continuous variable",
1179 "branching/lpgainnormalize",
1180 "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)",
1184 "branching/delaypscostupdate",
1185 "should updating pseudo costs for continuous variables be delayed to the time after separation?",
1189 "branching/divingpscost",
1190 "should pseudo costs be updated also in diving and probing mode?",
1194 "branching/forceallchildren",
1195 "should all strong branching children be regarded even if one is detected to be infeasible? (only with propagation)",
1199 "branching/firstsbchild",
1200 "child node to be regarded first during strong branching (only with propagation): 'u'p child, 'd'own child, 'h'istory-based, or 'a'utomatic",
1204 "branching/checksol",
1205 "should LP solutions during strong branching with propagation be checked for feasibility?",
1209 "branching/roundsbsol",
1210 "should LP solutions during strong branching with propagation be rounded? (only when checksbsol=TRUE)",
1214 "branching/sumadjustscore",
1215 "score adjustment near zero by adding epsilon (TRUE) or using maximum (FALSE)",
1221 "compression/enable",
1222 "should automatic tree compression after the presolving be enabled?",
1229 "should conflict analysis be enabled?",
1233 "conflict/cleanboundexceedings",
1234 "should conflicts based on an old cutoff bound be removed from the conflict pool after improving the primal bound?",
1239 "should propagation conflict analysis be used?",
1243 "conflict/useinflp",
1244 "should infeasible LP conflict analysis be used? ('o'ff, 'c'onflict graph, 'd'ual ray, 'b'oth conflict graph and dual ray)",
1248 "conflict/useboundlp",
1249 "should bound exceeding LP conflict analysis be used? ('o'ff, 'c'onflict graph, 'd'ual ray, 'b'oth conflict graph and dual ray)",
1254 "should infeasible/bound exceeding strong branching conflict analysis be used?",
1258 "conflict/usepseudo",
1259 "should pseudo solution conflict analysis be used?",
1263 "conflict/maxvarsfac",
1264 "maximal fraction of variables involved in a conflict constraint",
1268 "conflict/minmaxvars",
1269 "minimal absolute maximum of variables involved in a conflict constraint",
1273 "conflict/maxlploops",
1274 "maximal number of LP resolving loops during conflict analysis (-1: no limit)",
1278 "conflict/lpiterations",
1279 "maximal number of LP iterations in each LP resolving loop (-1: no limit)",
1283 "conflict/fuiplevels",
1284 "number of depth levels up to which first UIP's are used in conflict analysis (-1: use All-FirstUIP rule)",
1288 "conflict/interconss",
1289 "maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)",
1293 "conflict/reconvlevels",
1294 "number of depth levels up to which UIP reconvergence constraints are generated (-1: generate reconvergence constraints in all depth levels)",
1298 "conflict/maxconss",
1299 "maximal number of conflict constraints accepted at an infeasible node (-1: use all generated conflict constraints)",
1303 "conflict/maxstoresize",
1304 "maximal size of conflict store (-1: auto, 0: disable storage)",
1308 "conflict/preferbinary",
1309 "should binary conflicts be preferred?",
1313 "conflict/prefinfproof",
1314 "prefer infeasibility proof to boundexceeding proof",
1318 "conflict/allowlocal",
1319 "should conflict constraints be generated that are only valid locally?",
1323 "conflict/settlelocal",
1324 "should conflict constraints be attached only to the local subtree where they can be useful?",
1328 "conflict/repropagate",
1329 "should earlier nodes be repropagated in order to replace branching decisions by deductions?",
1333 "conflict/keepreprop",
1334 "should constraints be kept for repropagation even if they are too long?",
1338 "conflict/separate",
1339 "should the conflict constraints be separated?",
1344 "should the conflict constraints be subject to aging?",
1348 "conflict/removable",
1349 "should the conflict's relaxations be subject to LP aging and cleanup?",
1353 "conflict/graph/depthscorefac",
1354 "score factor for depth level in bound relaxation heuristic",
1358 "conflict/proofscorefac",
1359 "score factor for impact on acticity in bound relaxation heuristic",
1363 "conflict/uplockscorefac",
1364 "score factor for up locks in bound relaxation heuristic",
1368 "conflict/downlockscorefac",
1369 "score factor for down locks in bound relaxation heuristic",
1373 "conflict/scorefac",
1374 "factor to decrease importance of variables' earlier conflict scores",
1378 "conflict/restartnum",
1379 "number of successful conflict analysis calls that trigger a restart (0: disable conflict restarts)",
1383 "conflict/restartfac",
1384 "factor to increase restartnum with after each restart",
1388 "conflict/ignorerelaxedbd",
1389 "should relaxed bounds be ignored?",
1393 "conflict/maxvarsdetectimpliedbounds",
1394 "maximal number of variables to try to detect global bound implications and shorten the whole conflict set (0: disabled)",
1398 "conflict/fullshortenconflict",
1399 "try to shorten the whole conflict set or terminate early (depending on the 'maxvarsdetectimpliedbounds' parameter)",
1403 "conflict/conflictweight",
1404 "the weight the VSIDS score is weight by updating the VSIDS for a variable if it is part of a conflict",
1408 "conflict/conflictgraphweight",
1409 "the weight the VSIDS score is weight by updating the VSIDS for a variable if it is part of a conflict graph",
1413 "conflict/minimprove",
1414 "minimal improvement of primal bound to remove conflicts based on a previous incumbent",
1417 "conflict/weightsize",
1418 "weight of the size of a conflict used in score calculation",
1421 "conflict/weightrepropdepth",
1422 "weight of the repropagation depth of a conflict used in score calculation",
1425 "conflict/weightvaliddepth",
1426 "weight of the valid depth of a conflict used in score calculation",
1429 "conflict/sepaaltproofs",
1430 "apply cut generating functions to construct alternative proofs",
1436 "constraints/agelimit",
1437 "maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)",
1441 "constraints/obsoleteage",
1442 "age of a constraint after which it is marked obsolete (0: dynamic, -1 do not mark constraints obsolete)",
1446 "constraints/disableenfops",
1447 "should enforcement of pseudo solution be disabled?",
1454 "display/verblevel",
1455 "verbosity level of output",
1461 "maximal number of characters in a node information line",
1463 SCIPparamChgdDispWidth, NULL) );
1466 "frequency for displaying node information lines",
1470 "display/headerfreq",
1471 "frequency for displaying header lines (every n'th node information line)",
1476 "should the LP solver display status messages?",
1481 "display all violations for a given start solution / the best solution after the solving process?",
1487 "history/valuebased",
1488 "should statistics be collected for variable domain value pairs?",
1492 "history/allowmerge",
1493 "should variable histories be merged from sub-SCIPs whenever possible?",
1497 "history/allowtransfer",
1498 "should variable histories be transferred to initialize SCIP copies?",
1505 "maximal time in seconds to run",
1507 SCIPparamChgdLimit, NULL) );
1510 "maximal number of nodes to process (-1: no limit)",
1512 SCIPparamChgdLimit, NULL) );
1514 "limits/totalnodes",
1515 "maximal number of total nodes (incl. restarts) to process (-1: no limit)",
1517 SCIPparamChgdLimit, NULL) );
1519 "limits/stallnodes",
1520 "solving stops, if the given number of nodes was processed since the last improvement of the primal solution value (-1: no limit)",
1522 SCIPparamChgdLimit, NULL) );
1525 "maximal memory usage in MB; reported memory usage is lower than real memory usage!",
1527 SCIPparamChgdLimit, NULL) );
1530 "solving stops, if the relative gap = |primal - dual|/MIN(|dual|,|primal|) is below the given value",
1532 SCIPparamChgdLimit, NULL) );
1535 "solving stops, if the absolute gap = |primalbound - dualbound| is below the given value",
1537 SCIPparamChgdLimit, NULL) );
1540 "solving stops, if the given number of solutions were found (-1: no limit)",
1542 SCIPparamChgdLimit, NULL) );
1545 "solving stops, if the given number of solution improvements were found (-1: no limit)",
1547 SCIPparamChgdLimit, NULL) );
1550 "maximal number of solutions to store in the solution storage",
1552 SCIPparamChgdLimit, NULL) );
1554 "limits/maxorigsol",
1555 "maximal number of solutions candidates to store in the solution storage of the original problem",
1557 SCIPparamChgdLimit, NULL) );
1560 "solving stops, if the given number of restarts was triggered (-1: no limit)",
1562 SCIPparamChgdLimit, NULL) );
1565 "limits/autorestartnodes",
1566 "if solve exceeds this number of nodes for the first time, an automatic restart is triggered (-1: no automatic restart)",
1568 SCIPparamChgdLimit, NULL) );
1573 "frequency for solving LP at the nodes (-1: never; 0: only root LP)",
1578 "iteration limit for each single LP solve (-1: no limit)",
1583 "iteration limit for initial root LP solve (-1: no limit)",
1588 "maximal depth for solving LP at the nodes (-1: no depth limit)",
1593 "LP algorithm for solving initial LP relaxations (automatic 's'implex, 'p'rimal simplex, 'd'ual simplex, 'b'arrier, barrier with 'c'rossover)",
1597 "lp/resolvealgorithm",
1598 "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)",
1603 "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)",
1607 "lp/clearinitialprobinglp",
1608 "should lp state be cleared at the end of probing mode when lp was initially unsolved, e.g., when called right after presolving?",
1612 "lp/resolverestore",
1613 "should the LP be resolved to restore the state at start of diving (if FALSE we buffer the solution values)?",
1617 "lp/freesolvalbuffers",
1618 "should the buffers for storing LP solution values during diving be freed at end of diving?",
1623 "maximum age a dynamic column can reach before it is deleted from the LP (-1: don't delete columns due to aging)",
1628 "maximum age a dynamic row can reach before it is deleted from the LP (-1: don't delete rows due to aging)",
1633 "should new non-basic columns be removed after LP solving?",
1637 "lp/cleanupcolsroot",
1638 "should new non-basic columns be removed after root LP solving?",
1643 "should new basic rows be removed after LP solving?",
1647 "lp/cleanuprowsroot",
1648 "should new basic rows be removed after root LP solving?",
1652 "lp/checkstability",
1653 "should LP solver's return status be checked for stability?",
1657 "lp/conditionlimit",
1658 "maximum condition number of LP basis counted as stable (-1.0: no limit)",
1663 "should LP solutions be checked for primal feasibility, resolving LP when numerical troubles occur?",
1668 "should LP solutions be checked for dual feasibility, resolving LP when numerical troubles occur?",
1673 "which FASTMIP setting of LP solver should be used? 0: off, 1: low",
1678 "LP scaling (0: none, 1: normal, 2: aggressive)",
1683 "should presolving of LP solver be used?",
1688 "should the lexicographic dual algorithm be used?",
1692 "lp/lexdualrootonly",
1693 "should the lexicographic dual algorithm be applied only at the root node",
1697 "lp/lexdualmaxrounds",
1698 "maximum number of rounds in the lexicographic dual algorithm (-1: unbounded)",
1703 "choose fractional basic variables in lexicographic dual algorithm?",
1707 "lp/lexdualstalling",
1708 "turn on the lex dual algorithm only when stalling?",
1713 "disable the cutoff bound in the LP solver? (0: enabled, 1: disabled, 2: auto)",
1715 0, 2, NULL, NULL) );
1718 "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)",
1723 "number of threads used for solving the LP (0: automatic)",
1727 "lp/resolveiterfac",
1728 "factor of average LP iterations that is used as LP iteration limit for LP resolve (-1: unlimited)",
1732 "lp/resolveitermin",
1733 "minimum number of iterations that are allowed for LP resolve",
1738 "lp/solutionpolishing",
1739 "LP solution polishing method (0: disabled, 1: only root, 2: always, 3: auto)",
1744 "lp/refactorinterval",
1745 "LP refactorization interval (0: auto)",
1752 "solver to use for solving NLPs; leave empty to select NLPI with highest priority",
1757 "should the NLP relaxation be always disabled (also for NLPs/MINLPs)?",
1764 "fraction of maximal memory usage resulting in switch to memory saving mode",
1768 "memory/arraygrowfac",
1769 "memory growing factor for dynamically allocated arrays",
1771 paramChgdArraygrowfac, NULL) );
1773 "memory/arraygrowinit",
1774 "initial size of dynamically allocated arrays",
1776 paramChgdArraygrowinit, NULL) );
1778 "memory/treegrowfac",
1779 "memory growing factor for tree array",
1783 "memory/treegrowinit",
1784 "initial size of tree array",
1788 "memory/pathgrowfac",
1789 "memory growing factor for path array",
1793 "memory/pathgrowinit",
1794 "initial size of path array",
1801 "should the CTRL-C interrupt be caught by SCIP?",
1806 "should a hashtable be used to map from variable names to variables?",
1810 "misc/useconstable",
1811 "should a hashtable be used to map from constraint names to constraints?",
1815 "misc/usesmalltables",
1816 "should smaller hashtables be used? yields better performance for small problems with about 100 variables",
1822 "should the problem be solved exactly (with proven dual bounds)?",
1831 "should the statistics be reset if the transformed problem is freed (in case of a Benders decomposition this parameter should be set to FALSE)",
1836 "misc/improvingsols",
1837 "should only solutions be checked which improve the primal bound",
1842 "should the reason be printed if a given start solution is infeasible",
1846 "misc/estimexternmem",
1847 "should the usage of external memory be estimated?",
1851 "misc/transorigsols",
1852 "should SCIP try to transfer original solutions to the transformed space (after presolving)?",
1856 "misc/transsolsorig",
1857 "should SCIP try to transfer transformed solutions to the original space (after solving)?",
1861 "misc/calcintegral",
1862 "should SCIP calculate the primal dual integral value?",
1866 "misc/finitesolutionstore",
1867 "should SCIP try to remove infinite fixings from solutions copied to the solution store?",
1871 "misc/outputorigsol",
1872 "should the best solution be transformed to the orignal space and be output in command line run?",
1876 "misc/allowdualreds",
1877 "should dual reductions in propagation methods and presolver be allowed?",
1881 "misc/allowobjprop",
1882 "should propagation to the current objective be allowed in propagation methods?",
1887 "misc/referencevalue",
1888 "objective value for reference purposes",
1892 #ifdef WITH_DEBUG_SOLUTION 1895 "path to a debug solution",
1896 &(*set)->misc_debugsol,
FALSE, SCIP_DEFAULT_MISC_DEBUGSOLUTION,
1902 "used symmetry handling technique (0: off; 1: polyhedral; 2: orbital fixing)",
1904 paramChgdUsesymmetry, NULL) );
1908 "randomization/randomseedshift",
1909 "global shift of all random seeds in the plugins and the LP random seed",
1914 "randomization/permutationseed",
1915 "seed value for permuting the problem after reading/transformation (0: no permutation)",
1920 "randomization/permuteconss",
1921 "should order of constraints be permuted (depends on permutationseed)?",
1926 "randomization/permutevars",
1927 "should order of variables be permuted (depends on permutationseed)?",
1933 "randomization/lpseed",
1934 "random seed for LP solver, e.g. for perturbations in the simplex (0: LP default)",
1940 "nodeselection/childsel",
1941 "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)",
1947 "numerics/infinity",
1948 "values larger than this are considered infinity",
1950 paramChgInfinity, NULL) );
1953 "absolute values smaller than this are considered zero",
1957 "numerics/sumepsilon",
1958 "absolute values of sums smaller than this are considered zero",
1963 "feasibility tolerance for constraints",
1965 paramChgdFeastol, NULL) );
1967 "numerics/checkfeastolfac",
1968 "feasibility tolerance factor; for checking the feasibility of the best solution",
1972 "numerics/lpfeastol",
1973 "primal feasibility tolerance of LP solver",
1975 paramChgdLpfeastol, NULL) );
1977 "numerics/dualfeastol",
1978 "feasibility tolerance for reduced costs in LP solution",
1980 paramChgdDualfeastol, NULL) );
1982 "numerics/barrierconvtol",
1983 "LP convergence tolerance used in barrier algorithm",
1985 paramChgdBarrierconvtol, NULL) );
1987 "numerics/boundstreps",
1988 "minimal relative improve for strengthening bounds",
1992 "numerics/pseudocosteps",
1993 "minimal variable distance value to use for branching pseudo cost updates",
1997 "numerics/pseudocostdelta",
1998 "minimal objective distance value to use for branching pseudo cost updates",
2002 "numerics/recomputefac",
2003 "minimal decrease factor that causes the recomputation of a value (e.g., pseudo objective) instead of an update",
2008 "values larger than this are considered huge and should be handled separately (e.g., in activity computation)",
2014 "presolving/maxrounds",
2015 "maximal number of presolving rounds (-1: unlimited, 0: off)",
2019 "presolving/abortfac",
2020 "abort presolve, if at most this fraction of the problem was changed in last presolve round",
2024 "presolving/maxrestarts",
2025 "maximal number of restarts (-1: unlimited)",
2029 "presolving/restartfac",
2030 "fraction of integer variables that were fixed in the root node triggering a restart with preprocessing after root node evaluation",
2034 "presolving/immrestartfac",
2035 "fraction of integer variables that were fixed in the root node triggering an immediate restart with preprocessing",
2039 "presolving/subrestartfac",
2040 "fraction of integer variables that were globally fixed during the solving process triggering a restart with preprocessing",
2044 "presolving/restartminred",
2045 "minimal fraction of integer variables removed after restart to allow for an additional restart",
2049 "presolving/donotmultaggr",
2050 "should multi-aggregation of variables be forbidden?",
2054 "presolving/donotaggr",
2055 "should aggregation of variables be forbidden?",
2063 "maximal number of variables priced in per pricing round",
2067 "pricing/maxvarsroot",
2068 "maximal number of priced variables at the root node",
2073 "pricing is aborted, if fac * pricing/maxvars pricing candidates were found",
2078 "should variables created at the current node be deleted when the node is solved in case they are not present in the LP anymore?",
2082 "pricing/delvarsroot",
2083 "should variables created at the root node be deleted when the root is solved in case they are not present in the LP anymore?",
2089 "propagating/maxrounds",
2090 "maximal number of propagation rounds per node (-1: unlimited)",
2094 "propagating/maxroundsroot",
2095 "maximal number of propagation rounds in the root node (-1: unlimited)",
2099 "propagating/abortoncutoff",
2100 "should propagation be aborted immediately? setting this to FALSE could help conflict analysis to produce more conflict constraints",
2106 "reoptimization/enable",
2107 "should reoptimization used?",
2109 paramChgdEnableReopt, NULL) );
2111 "reoptimization/maxsavednodes",
2112 "maximal number of saved nodes",
2116 "reoptimization/maxdiffofnodes",
2117 "maximal number of bound changes between two stored nodes on one path",
2121 "reoptimization/globalcons/sepainfsubtrees",
2122 "save global constraints to separate infeasible subtrees.",
2126 "reoptimization/sepabestsol",
2127 "separate the optimal solution, i.e., for constrained shortest path",
2131 "reoptimization/storevarhistory",
2132 "use variable history of the previous solve if the objctive function has changed only slightly",
2136 "reoptimization/usepscost",
2137 "re-use pseudo costs if the objective function changed only slightly ",
2141 "reoptimization/solvelp",
2142 "at which reopttype should the LP be solved? (1: transit, 3: strong branched, 4: w/ added logicor, 5: only leafs).",
2146 "reoptimization/solvelpdiff",
2147 "maximal number of bound changes at node to skip solving the LP",
2151 "reoptimization/savesols",
2152 "number of best solutions which should be saved for the following runs. (-1: save all)",
2156 "reoptimization/objsimrootLP",
2157 "similarity of two sequential objective function to disable solving the root LP.",
2161 "reoptimization/objsimsol",
2162 "similarity of two objective functions to re-use stored solutions",
2166 "reoptimization/delay",
2167 "minimum similarity for using reoptimization of the search tree.",
2171 "reoptimization/commontimelimit",
2172 "time limit over all reoptimization rounds?.",
2176 "reoptimization/shrinkinner",
2177 "replace branched inner nodes by their child nodes, if the number of bound changes is not to large",
2181 "reoptimization/strongbranchinginit",
2182 "try to fix variables at the root node before reoptimizing by probing like strong branching",
2186 "reoptimization/reducetofrontier",
2187 "delete stored nodes which were not reoptimized",
2191 "reoptimization/forceheurrestart",
2192 "force a restart if the last n optimal solutions were found by heuristic reoptsols",
2196 "reoptimization/saveconsprop",
2197 "save constraint propagations",
2201 "reoptimization/usesplitcons",
"use constraints to reconstruct the subtree pruned be dual reduction when reactivating the node",
2205 "reoptimization/varorderinterdiction",
"use 'd'efault, 'r'andom or a variable ordering based on 'i'nference score for interdiction branching used during reoptimization",
2209 "reoptimization/usecuts",
2210 "reoptimize cuts found at the root node",
2214 "reoptimization/maxcutage",
2215 "maximal age of a cut to be use for reoptimization",
2221 "separating/maxbounddist",
2222 "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)",
2226 "separating/maxlocalbounddist",
2227 "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)",
2231 "separating/maxcoefratio",
2232 "maximal ratio between coefficients in strongcg, cmir, and flowcover cuts",
2236 "separating/minefficacy",
2237 "minimal efficacy for a cut to enter the LP",
2241 "separating/minefficacyroot",
2242 "minimal efficacy for a cut to enter the LP in the root node",
2246 "separating/minortho",
2247 "minimal orthogonality for a cut to enter the LP",
2251 "separating/minorthoroot",
2252 "minimal orthogonality for a cut to enter the LP in the root node",
2256 "separating/objparalfac",
2257 "factor to scale objective parallelism of cut in separation score calculation",
2261 "separating/intsupportfac",
2262 "factor to scale integral support of cut in separation score calculation",
2266 "separating/minactivityquot",
2267 "minimum cut activity quotient to convert cuts into constraints during a restart (0.0: all cuts are converted)",
2271 "separating/orthofunc",
2272 "function used for calc. scalar prod. in orthogonality test ('e'uclidean, 'd'iscrete)",
2276 "separating/efficacynorm",
2277 "row norm to use for efficacy calculation ('e'uclidean, 'm'aximum, 's'um, 'd'iscrete)",
2281 "separating/cutselrestart",
2282 "cut selection during restart ('a'ge, activity 'q'uotient)",
2286 "separating/cutselsubscip",
2287 "cut selection for sub SCIPs ('a'ge, activity 'q'uotient)",
2291 "separating/maxruns",
2292 "maximal number of runs for which separation is enabled (-1: unlimited)",
2296 "separating/maxrounds",
2297 "maximal number of separation rounds per node (-1: unlimited)",
2301 "separating/maxroundsroot",
2302 "maximal number of separation rounds in the root node (-1: unlimited)",
2306 "separating/maxroundsrootsubrun",
2307 "maximal number of separation rounds in the root node of a subsequent run (-1: unlimited)",
2311 "separating/maxaddrounds",
2312 "maximal additional number of separation rounds in subsequent price-and-cut loops (-1: no additional restriction)",
2316 "separating/maxstallrounds",
2317 "maximal number of consecutive separation rounds without objective or integrality improvement in local nodes (-1: no additional restriction)",
2321 "separating/maxstallroundsroot",
2322 "maximal number of consecutive separation rounds without objective or integrality improvement in the root node (-1: no additional restriction)",
2326 "separating/maxincrounds",
2327 "maximal number of consecutive separation rounds that increase the size of the LP relaxation per node (-1: unlimited)",
2331 "separating/maxcuts",
2332 "maximal number of cuts separated per separation round (0: disable local separation)",
2336 "separating/maxcutsroot",
2337 "maximal number of separated cuts at the root node (0: disable root node separation)",
2341 "separating/cutagelimit",
2342 "maximum age a cut can reach before it is deleted from the global cut pool, or -1 to keep all cuts",
2346 "separating/poolfreq",
2347 "separation frequency for the global cut pool (-1: disable global cut pool, 0: only separate pool at the root)",
2354 "parallel optimisation mode, 0: opportunistic or 1: deterministic.",
2358 "parallel/minnthreads",
2359 "the minimum number of threads used during parallel solve",
2363 "parallel/maxnthreads",
2364 "the maximum number of threads used during parallel solve",
2370 "concurrent/changeseeds",
2371 "set different random seeds in each concurrent solver?",
2375 "concurrent/changechildsel",
2376 "use different child selection rules in each concurrent solver?",
2380 "concurrent/commvarbnds",
2381 "should the concurrent solvers communicate global variable bound changes?",
2385 "concurrent/presolvebefore",
2386 "should the problem be presolved before it is copied to the concurrent solvers?",
2390 "concurrent/initseed",
2391 "maximum number of solutions that will be shared in a one synchronization",
2395 "concurrent/sync/freqinit",
2396 "initial frequency of synchronization with other threads",
2400 "concurrent/sync/freqmax",
2401 "maximal frequency of synchronization with other threads",
2405 "concurrent/sync/freqfactor",
2406 "factor by which the frequency of synchronization is changed",
2410 "concurrent/sync/targetprogress",
2411 "when adapting the synchronization frequency this value is the targeted relative difference by which the absolute gap decreases per synchronization",
2415 "concurrent/sync/maxnsols",
2416 "maximum number of solutions that will be shared in a single synchronization",
2420 "concurrent/sync/maxnsyncdelay",
2421 "maximum number of synchronizations before reading is enforced regardless of delay",
2425 "concurrent/sync/minsyncdelay",
2426 "minimum delay before synchronization data is read",
2430 "concurrent/sync/nbestsols",
2431 "how many of the N best solutions should be considered for synchronization?",
2435 "concurrent/paramsetprefix",
2436 "path prefix for parameter setting files of concurrent solvers",
2444 "default clock type (1: CPU user seconds, 2: wall clock time)",
2449 "is timing enabled?",
2454 "belongs reading time to solving time?",
2458 "timing/rareclockcheck",
2459 "should clock checks of solving time be performed less frequently (note: time limit could be exceeded slightly)",
2463 "timing/statistictiming",
2464 "should timing for statistic output be performed?",
2466 paramChgdStatistictiming, NULL) );
2470 "visual/vbcfilename",
2471 "name of the VBC tool output file, or - if no VBC tool output should be created",
2475 "visual/bakfilename",
2476 "name of the BAK tool output file, or - if no BAK tool output should be created",
2481 "should the real solving time be used instead of a time step counter in visualization?",
2486 "should the node where solutions are found be visualized?",
2491 "should be output the external value of the objective?",
2497 "reading/initialconss",
2498 "should model constraints be marked as initial?",
2502 "reading/dynamicconss",
2503 "should model constraints be subject to aging?",
2507 "reading/dynamiccols",
2508 "should columns be added and removed dynamically to the LP?",
2512 "reading/dynamicrows",
2513 "should rows be added and removed dynamically to the LP?",
2520 "should all constraints be written (including the redundant constraints)?",
2525 "should variables set to zero be printed?",
2529 "write/genericnamesoffset",
2530 "when writing a generic problem the index for the first variable should start with?",
2545 assert(
set != NULL);
2554 for( i = 0; i < (*set)->nreaders; ++i )
2561 for( i = 0; i < (*set)->npricers; ++i )
2568 for( i = 0; i < (*set)->nconshdlrs; ++i )
2578 for( i = 0; i < (*set)->nconflicthdlrs; ++i )
2585 for( i = 0; i < (*set)->npresols; ++i )
2592 for( i = 0; i < (*set)->nrelaxs; ++i )
2599 for( i = 0; i < (*set)->nsepas; ++i )
2606 for( i = 0; i < (*set)->nprops; ++i )
2614 for( i = 0; i < (*set)->nheurs; ++i )
2621 for( i = 0; i < (*set)->ncomprs; ++i )
2628 for( i = 0; i < (*set)->neventhdlrs; ++i )
2635 for( i = 0; i < (*set)->nnodesels; ++i )
2642 for( i = 0; i < (*set)->nbranchrules; ++i )
2649 for( i = 0; i < (*set)->ntables; ++i )
2656 for( i = 0; i < (*set)->ndisps; ++i )
2666 for( i = 0; i < (*set)->nnlpis; ++i )
2676 for( i = 0; i < (*set)->nconcsolvertypes; ++i )
2684 for( i = 0; i < (*set)->nextcodes; ++i )
2693 for( i = 0; i < (*set)->nbanditvtables; ++i )
2709 assert(
set != NULL);
2728 assert(
set != NULL);
2731 defaultvalue, paramchgd, paramdata) );
2752 assert(
set != NULL);
2755 defaultvalue, minvalue, maxvalue, paramchgd, paramdata) );
2776 assert(
set != NULL);
2779 defaultvalue, minvalue, maxvalue, paramchgd, paramdata) );
2800 assert(
set != NULL);
2803 defaultvalue, minvalue, maxvalue, paramchgd, paramdata) );
2818 const char* allowedvalues,
2823 assert(
set != NULL);
2826 defaultvalue, allowedvalues, paramchgd, paramdata) );
2840 const char* defaultvalue,
2845 assert(
set != NULL);
2848 defaultvalue, paramchgd, paramdata) );
2859 assert(
set != NULL);
2870 assert(
set != NULL);
2882 assert(
set != NULL);
2896 assert(
set != NULL);
2910 assert(
set != NULL);
2924 assert(
set != NULL);
2938 assert(
set != NULL);
2952 assert(
set != NULL);
2966 assert(
set != NULL);
2981 assert(
set != NULL);
2998 assert(
set != NULL);
3018 assert(
set != NULL);
3032 assert(
set != NULL);
3050 assert(
set != NULL);
3051 assert(param != NULL);
3071 assert(
set != NULL);
3085 assert(
set != NULL);
3102 assert(
set != NULL);
3103 assert(param != NULL);
3123 assert(
set != NULL);
3140 assert(
set != NULL);
3141 assert(param != NULL);
3161 assert(
set != NULL);
3178 assert(
set != NULL);
3179 assert(param != NULL);
3199 assert(
set != NULL);
3216 assert(
set != NULL);
3217 assert(param != NULL);
3237 assert(
set != NULL);
3248 const char* filename
3251 assert(
set != NULL);
3262 const char* filename,
3267 assert(
set != NULL);
3395 assert(
set != NULL);
3405 assert(
set != NULL);
3416 assert(
set != NULL);
3417 assert(reader != NULL);
3419 if( set->nreaders >= set->readerssize )
3424 assert(set->nreaders < set->readerssize);
3426 set->readers[
set->nreaders] = reader;
3440 assert(
set != NULL);
3441 assert(name != NULL);
3443 for( i = 0; i <
set->nreaders; ++i )
3446 return set->readers[i];
3458 assert(
set != NULL);
3459 assert(pricer != NULL);
3461 if( set->npricers >= set->pricerssize )
3466 assert(set->npricers < set->pricerssize);
3468 set->pricers[
set->npricers] = pricer;
3470 set->pricerssorted =
FALSE;
3483 assert(
set != NULL);
3484 assert(name != NULL);
3486 for( i = 0; i <
set->npricers; ++i )
3489 return set->pricers[i];
3500 assert(
set != NULL);
3502 if( !set->pricerssorted )
3504 SCIPsortPtr((
void**)set->pricers, SCIPpricerComp, set->npricers);
3505 set->pricerssorted =
TRUE;
3506 set->pricersnamesorted =
FALSE;
3515 assert(
set != NULL);
3517 if( !set->pricersnamesorted )
3519 SCIPsortPtr((
void**)set->pricers, SCIPpricerCompName, set->npricers);
3520 set->pricerssorted =
FALSE;
3521 set->pricersnamesorted =
TRUE;
3534 assert(
set != NULL);
3535 assert(conshdlr != NULL);
3539 if( set->nconshdlrs >= set->conshdlrssize )
3547 assert(set->nconshdlrs < set->conshdlrssize);
3553 set->conshdlrs[i] =
set->conshdlrs[i-1];
3555 set->conshdlrs[i] = conshdlr;
3561 set->conshdlrs_sepa[i] =
set->conshdlrs_sepa[i-1];
3563 set->conshdlrs_sepa[i] = conshdlr;
3569 set->conshdlrs_enfo[i] =
set->conshdlrs_enfo[i-1];
3571 set->conshdlrs_enfo[i] = conshdlr;
3574 set->conshdlrs_include[
set->nconshdlrs] = conshdlr;
3591 assert(
set != NULL);
3592 assert(conshdlr != NULL);
3598 if( newpriority > oldpriority )
3601 while( i < set->nconshdlrs &&
3607 assert(priorityatpos >= oldpriority);
3610 if( newpriority > priorityatpos && newpos == -1 )
3615 assert(i < set->nconshdlrs);
3621 for( ; i > newpos; --i )
3623 set->conshdlrs_sepa[i] =
set->conshdlrs_sepa[i-1];
3625 set->conshdlrs_sepa[newpos] = conshdlr;
3629 else if( newpriority < oldpriority )
3631 i =
set->nconshdlrs - 1;
3638 assert(priorityatpos <= oldpriority);
3641 if( newpriority < priorityatpos && newpos == -1 )
3652 for(; i < newpos; ++i )
3654 set->conshdlrs_sepa[i] =
set->conshdlrs_sepa[i + 1];
3656 set->conshdlrs_sepa[newpos] = conshdlr;
3659 for( i = 0; i <
set->nconshdlrs - 1; ++i )
3674 assert(
set != NULL);
3675 assert(name != NULL);
3677 for( i = 0; i <
set->nconshdlrs; ++i )
3680 return set->conshdlrs[i];
3692 assert(
set != NULL);
3693 assert(conflicthdlr != NULL);
3696 if( set->nconflicthdlrs >= set->conflicthdlrssize )
3701 assert(set->nconflicthdlrs < set->conflicthdlrssize);
3703 set->conflicthdlrs[
set->nconflicthdlrs] = conflicthdlr;
3704 set->nconflicthdlrs++;
3705 set->conflicthdlrssorted =
FALSE;
3718 assert(
set != NULL);
3719 assert(name != NULL);
3721 for( i = 0; i <
set->nconflicthdlrs; ++i )
3724 return set->conflicthdlrs[i];
3735 assert(
set != NULL);
3737 if( !set->conflicthdlrssorted )
3739 SCIPsortPtr((
void**)set->conflicthdlrs, SCIPconflicthdlrComp, set->nconflicthdlrs);
3740 set->conflicthdlrssorted =
TRUE;
3741 set->conflicthdlrsnamesorted =
FALSE;
3750 assert(
set != NULL);
3752 if( !set->conflicthdlrsnamesorted )
3754 SCIPsortPtr((
void**)set->conflicthdlrs, SCIPconflicthdlrCompName, set->nconflicthdlrs);
3755 set->conflicthdlrssorted =
FALSE;
3756 set->conflicthdlrsnamesorted =
TRUE;
3766 assert(
set != NULL);
3767 assert(presol != NULL);
3769 if( set->npresols >= set->presolssize )
3774 assert(set->npresols < set->presolssize);
3776 set->presols[
set->npresols] = presol;
3778 set->presolssorted =
FALSE;
3791 assert(
set != NULL);
3792 assert(name != NULL);
3794 for( i = 0; i <
set->npresols; ++i )
3797 return set->presols[i];
3808 assert(
set != NULL);
3810 if( !set->presolssorted )
3812 SCIPsortPtr((
void**)set->presols, SCIPpresolComp, set->npresols);
3813 set->presolssorted =
TRUE;
3814 set->presolsnamesorted =
FALSE;
3823 assert(
set != NULL);
3825 if( !set->presolsnamesorted )
3827 SCIPsortPtr((
void**)set->presols, SCIPpresolCompName, set->npresols);
3828 set->presolssorted =
FALSE;
3829 set->presolsnamesorted =
TRUE;
3839 assert(
set != NULL);
3840 assert(relax != NULL);
3843 if( set->nrelaxs >= set->relaxssize )
3848 assert(set->nrelaxs < set->relaxssize);
3850 set->relaxs[
set->nrelaxs] = relax;
3852 set->relaxssorted =
FALSE;
3865 assert(
set != NULL);
3866 assert(name != NULL);
3868 for( i = 0; i <
set->nrelaxs; ++i )
3871 return set->relaxs[i];
3882 assert(
set != NULL);
3884 if( !set->relaxssorted )
3886 SCIPsortPtr((
void**)set->relaxs, SCIPrelaxComp, set->nrelaxs);
3887 set->relaxssorted =
TRUE;
3888 set->relaxsnamesorted =
FALSE;
3897 assert(
set != NULL);
3899 if( !set->relaxsnamesorted )
3901 SCIPsortPtr((
void**)set->relaxs, SCIPrelaxCompName, set->nrelaxs);
3902 set->relaxssorted =
FALSE;
3903 set->relaxsnamesorted =
TRUE;
3913 assert(
set != NULL);
3914 assert(sepa != NULL);
3917 if( set->nsepas >= set->sepassize )
3922 assert(set->nsepas < set->sepassize);
3924 set->sepas[
set->nsepas] = sepa;
3926 set->sepassorted =
FALSE;
3939 assert(
set != NULL);
3940 assert(name != NULL);
3942 for( i = 0; i <
set->nsepas; ++i )
3945 return set->sepas[i];
3956 assert(
set != NULL);
3958 if( !set->sepassorted )
3960 SCIPsortPtr((
void**)set->sepas, SCIPsepaComp, set->nsepas);
3961 set->sepassorted =
TRUE;
3962 set->sepasnamesorted =
FALSE;
3971 assert(
set != NULL);
3973 if( !set->sepasnamesorted )
3975 SCIPsortPtr((
void**)set->sepas, SCIPsepaCompName, set->nsepas);
3976 set->sepassorted =
FALSE;
3977 set->sepasnamesorted =
TRUE;
3987 assert(
set != NULL);
3988 assert(prop != NULL);
3991 if( set->nprops >= set->propssize )
3997 assert(set->nprops < set->propssize);
3999 set->props[
set->nprops] = prop;
4000 set->props_presol[
set->nprops] = prop;
4002 set->propssorted =
FALSE;
4003 set->propspresolsorted =
FALSE;
4016 assert(
set != NULL);
4017 assert(name != NULL);
4019 for( i = 0; i <
set->nprops; ++i )
4022 return set->props[i];
4033 assert(
set != NULL);
4035 if( !set->propssorted )
4037 SCIPsortPtr((
void**)set->props, SCIPpropComp, set->nprops);
4038 set->propssorted =
TRUE;
4039 set->propsnamesorted =
FALSE;
4048 assert(
set != NULL);
4050 if( !set->propspresolsorted )
4052 SCIPsortPtr((
void**)set->props_presol, SCIPpropCompPresol, set->nprops);
4053 set->propspresolsorted =
TRUE;
4054 set->propsnamesorted =
FALSE;
4063 assert(
set != NULL);
4065 if( !set->propsnamesorted )
4067 SCIPsortPtr((
void**)set->props, SCIPpropCompName, set->nprops);
4068 set->propssorted =
FALSE;
4069 set->propsnamesorted =
TRUE;
4079 assert(
set != NULL);
4080 assert(banditvtable != NULL);
4082 if( set->nbanditvtables >= set->banditvtablessize )
4086 set->banditvtablessize = newsize;
4089 assert(set->nbanditvtables < set->banditvtablessize);
4090 set->banditvtables[
set->nbanditvtables++] = banditvtable;
4103 assert(
set != NULL);
4104 assert(name != NULL);
4107 for( b = 0; b <
set->nbanditvtables; ++b )
4110 return set->banditvtables[b];
4122 assert(
set != NULL);
4123 assert(concsolvertype != NULL);
4125 if( set->nconcsolvertypes >= set->concsolvertypessize )
4130 assert(set->nconcsolvertypes < set->concsolvertypessize);
4132 set->concsolvertypes[
set->nconcsolvertypes] = concsolvertype;
4133 set->nconcsolvertypes++;
4146 assert(
set != NULL);
4147 assert(name != NULL);
4149 for( i = 0; i <
set->nconcsolvertypes; ++i )
4152 return set->concsolvertypes[i];
4164 assert(
set != NULL);
4165 assert(concsolver != NULL);
4167 if( set->nconcsolvers >= set->concsolverssize )
4172 assert(set->nconcsolvers < set->concsolverssize);
4174 set->concsolvers[
set->nconcsolvers] = concsolver;
4177 set->nconcsolvers++;
4188 assert(
set != NULL);
4191 for( i = 0; i <
set->nconcsolvers; ++i )
4197 set->nconcsolvers = 0;
4198 set->concsolverssize = 0;
4210 assert(
set != NULL);
4211 assert(heur != NULL);
4214 if( set->nheurs >= set->heurssize )
4219 assert(set->nheurs < set->heurssize);
4221 set->heurs[
set->nheurs] = heur;
4223 set->heurssorted =
FALSE;
4236 assert(
set != NULL);
4237 assert(name != NULL);
4239 for( i = 0; i <
set->nheurs; ++i )
4242 return set->heurs[i];
4253 assert(
set != NULL);
4255 if( !set->heurssorted )
4257 SCIPsortPtr((
void**)set->heurs, SCIPheurComp, set->nheurs);
4258 set->heurssorted =
TRUE;
4268 assert(
set != NULL);
4270 if( !set->heursnamesorted )
4272 SCIPsortPtr((
void**)set->heurs, SCIPheurCompName, set->nheurs);
4273 set->heurssorted =
FALSE;
4274 set->heursnamesorted =
TRUE;
4284 assert(
set != NULL);
4285 assert(compr != NULL);
4288 if( set->ncomprs >= set->comprssize )
4293 assert(set->ncomprs < set->comprssize);
4295 set->comprs[
set->ncomprs] = compr;
4297 set->comprssorted =
FALSE;
4310 assert(
set != NULL);
4311 assert(name != NULL);
4313 for( i = 0; i <
set->ncomprs; ++i )
4316 return set->comprs[i];
4327 assert(
set != NULL);
4329 if( !set->comprssorted )
4331 SCIPsortPtr((
void**)set->comprs, SCIPcomprComp, set->ncomprs);
4332 set->comprssorted =
TRUE;
4333 set->comprsnamesorted =
FALSE;
4342 assert(
set != NULL);
4344 if( !set->comprsnamesorted )
4346 SCIPsortPtr((
void**)set->comprs, SCIPcomprCompName, set->ncomprs);
4347 set->comprssorted =
FALSE;
4348 set->comprsnamesorted =
TRUE;
4358 assert(
set != NULL);
4359 assert(eventhdlr != NULL);
4362 if( set->neventhdlrs >= set->eventhdlrssize )
4367 assert(set->neventhdlrs < set->eventhdlrssize);
4369 set->eventhdlrs[
set->neventhdlrs] = eventhdlr;
4383 assert(
set != NULL);
4384 assert(name != NULL);
4386 for( i = 0; i <
set->neventhdlrs; ++i )
4389 return set->eventhdlrs[i];
4404 assert(
set != NULL);
4405 assert(nodesel != NULL);
4408 if( set->nnodesels >= set->nodeselssize )
4413 assert(set->nnodesels < set->nodeselssize);
4418 set->nodesels[i] =
set->nodesels[i-1];
4420 set->nodesels[i] = nodesel;
4434 assert(
set != NULL);
4435 assert(name != NULL);
4437 for( i = 0; i <
set->nnodesels; ++i )
4440 return set->nodesels[i];
4452 assert(
set != NULL);
4453 assert(stat != NULL);
4456 if( set->nodesel == NULL && set->nnodesels > 0 )
4460 set->nodesel =
set->nodesels[0];
4465 for( i = 1; i <
set->nnodesels; ++i )
4468 set->nodesel =
set->nodesels[i];
4473 for( i = 1; i <
set->nnodesels; ++i )
4476 set->nodesel =
set->nodesels[i];
4481 return set->nodesel;
4490 assert(
set != NULL);
4491 assert(branchrule != NULL);
4494 if( set->nbranchrules >= set->branchrulessize )
4499 assert(set->nbranchrules < set->branchrulessize);
4501 set->branchrules[
set->nbranchrules] = branchrule;
4502 set->nbranchrules++;
4516 assert(
set != NULL);
4517 assert(name != NULL);
4519 for( i = 0; i <
set->nbranchrules; ++i )
4522 return set->branchrules[i];
4533 assert(
set != NULL);
4535 if( !set->branchrulessorted )
4537 SCIPsortPtr((
void**)set->branchrules, SCIPbranchruleComp, set->nbranchrules);
4538 set->branchrulessorted =
TRUE;
4539 set->branchrulesnamesorted =
FALSE;
4548 assert(
set != NULL);
4550 if( !set->branchrulesnamesorted )
4552 SCIPsortPtr((
void**)set->branchrules, SCIPbranchruleCompName, set->nbranchrules);
4553 set->branchrulessorted =
FALSE;
4554 set->branchrulesnamesorted =
TRUE;
4567 assert(
set != NULL);
4568 assert(disp != NULL);
4571 if( set->ndisps >= set->dispssize )
4576 assert(set->ndisps < set->dispssize);
4582 set->disps[i] =
set->disps[i-1];
4584 set->disps[i] = disp;
4598 assert(
set != NULL);
4599 assert(name != NULL);
4601 for( i = 0; i <
set->ndisps; ++i )
4604 return set->disps[i];
4616 assert(
set != NULL);
4617 assert(table != NULL);
4620 if( set->ntables >= set->tablessize )
4625 assert(set->ntables < set->tablessize);
4628 set->tables[
set->ntables] = table;
4630 set->tablessorted =
FALSE;
4643 assert(
set != NULL);
4644 assert(name != NULL);
4646 for( i = 0; i <
set->ntables; ++i )
4649 return set->tables[i];
4661 assert(
set != NULL);
4662 assert(dialog != NULL);
4664 if( set->ndialogs >= set->dialogssize )
4669 assert(set->ndialogs < set->dialogssize);
4671 set->dialogs[
set->ndialogs] = dialog;
4685 assert(
set != NULL);
4687 if( dialog == NULL )
4690 for( i = 0; i <
set->ndialogs; ++i )
4692 if( set->dialogs[i] == dialog )
4705 assert(
set != NULL);
4706 assert(nlpi != NULL);
4708 if( set->nnlpis >= set->nlpissize )
4713 assert(set->nnlpis < set->nlpissize);
4715 set->nlpis[
set->nnlpis] = nlpi;
4717 set->nlpissorted =
FALSE;
4730 assert(
set != NULL);
4731 assert(name != NULL);
4733 for( i = 0; i <
set->nnlpis; ++i )
4736 return set->nlpis[i];
4747 assert(
set != NULL);
4749 if( !set->nlpissorted )
4751 SCIPsortPtr((
void**)set->nlpis, SCIPnlpiComp, set->nnlpis);
4752 set->nlpissorted =
TRUE;
4763 assert(
set != NULL);
4764 assert(nlpi != NULL);
4767 set->nlpissorted =
FALSE;
4774 const char* description
4777 assert(
set != NULL);
4778 assert(name != NULL);
4780 if( set->nextcodes >= set->extcodessize )
4786 assert(set->nextcodes < set->extcodessize);
4789 if( description != NULL )
4795 set->extcodedescs[
set->nextcodes] = NULL;
4811 assert(
set != NULL);
4815 for( i = 0; i <
set->nactivepricers; ++i )
4821 for( i = 0; i <
set->nconshdlrs; ++i )
4827 for( i = 0; i <
set->nconflicthdlrs; ++i )
4833 for( i = 0; i <
set->npresols; ++i )
4839 for( i = 0; i <
set->nrelaxs; ++i )
4845 for( i = 0; i <
set->nsepas; ++i )
4851 for( i = 0; i <
set->nprops; ++i )
4857 for( i = 0; i <
set->nheurs; ++i )
4863 for( i = 0; i <
set->ncomprs; ++i )
4869 for( i = 0; i <
set->neventhdlrs; ++i )
4875 for( i = 0; i <
set->nnodesels; ++i )
4881 for( i = 0; i <
set->nbranchrules; ++i )
4887 for( i = 0; i <
set->ndisps; ++i )
4894 for( i = 0; i <
set->ntables; ++i )
4911 assert(
set != NULL);
4915 for( i = 0; i <
set->nactivepricers; ++i )
4921 for( i = 0; i <
set->nconshdlrs; ++i )
4927 for( i = 0; i <
set->nconflicthdlrs; ++i )
4933 for( i = 0; i <
set->npresols; ++i )
4939 for( i = 0; i <
set->nrelaxs; ++i )
4945 for( i = 0; i <
set->nsepas; ++i )
4951 for( i = 0; i <
set->nprops; ++i )
4957 for( i = 0; i <
set->nheurs; ++i )
4963 for( i = 0; i <
set->ncomprs; ++i )
4969 for( i = 0; i <
set->neventhdlrs; ++i )
4975 for( i = 0; i <
set->nnodesels; ++i )
4981 for( i = 0; i <
set->nbranchrules; ++i )
4987 for( i = 0; i <
set->ndisps; ++i )
4993 for( i = 0; i <
set->ntables; ++i )
5010 assert(
set != NULL);
5013 for( i = 0; i <
set->npresols; ++i )
5019 for( i = 0; i <
set->nprops; ++i )
5025 for( i = 0; i <
set->nconshdlrs; ++i )
5042 assert(
set != NULL);
5045 for( i = 0; i <
set->npresols; ++i )
5051 for( i = 0; i <
set->nprops; ++i )
5057 for( i = 0; i <
set->nconshdlrs; ++i )
5074 assert(
set != NULL);
5087 for( i = 0; i <
set->nactivepricers; ++i )
5093 for( i = 0; i <
set->nconshdlrs; ++i )
5099 for( i = 0; i <
set->nconflicthdlrs; ++i )
5105 for( i = 0; i <
set->nrelaxs; ++i )
5111 for( i = 0; i <
set->nsepas; ++i )
5117 for( i = 0; i <
set->nprops; ++i )
5123 for( i = 0; i <
set->nheurs; ++i )
5129 for( i = 0; i <
set->neventhdlrs; ++i )
5135 for( i = 0; i <
set->nnodesels; ++i )
5141 for( i = 0; i <
set->nbranchrules; ++i )
5147 for( i = 0; i <
set->ndisps; ++i )
5153 for( i = 0; i <
set->ntables; ++i )
5171 assert(
set != NULL);
5175 for( i = 0; i <
set->nactivepricers; ++i )
5181 for( i = 0; i <
set->nconshdlrs; ++i )
5187 for( i = 0; i <
set->nconflicthdlrs; ++i )
5193 for( i = 0; i <
set->nrelaxs; ++i )
5199 for( i = 0; i <
set->nsepas; ++i )
5205 for( i = 0; i <
set->nprops; ++i )
5211 for( i = 0; i <
set->nheurs; ++i )
5217 for( i = 0; i <
set->neventhdlrs; ++i )
5223 for( i = 0; i <
set->nnodesels; ++i )
5229 for( i = 0; i <
set->nbranchrules; ++i )
5235 for( i = 0; i <
set->ndisps; ++i )
5241 for( i = 0; i <
set->ntables; ++i )
5255 return calcGrowSize(set->mem_arraygrowinit, set->mem_arraygrowfac, num);
5264 return calcGrowSize(set->mem_treegrowinit, set->mem_treegrowfac, num);
5273 return calcGrowSize(set->mem_pathgrowinit, set->mem_pathgrowfac, num);
5282 assert(
set != NULL);
5290 set->disp_verblevel = verblevel;
5301 assert(
set != NULL);
5303 set->num_feastol = feastol;
5326 assert(
set != NULL);
5337 SCIPerrorMessage(
"LP feasibility tolerance must be at least as tight as SCIP's feasibility tolerance\n");
5340 printnewvalue =
TRUE;
5345 set->num_lpfeastol = lpfeastol;
5361 assert(
set != NULL);
5363 set->num_dualfeastol = dualfeastol;
5374 assert(
set != NULL);
5376 set->num_barrierconvtol = barrierconvtol;
5394 assert(
set != NULL);
5395 assert(relaxfeastol >= 0.0);
5397 oldval =
set->num_relaxfeastol;
5398 set->num_relaxfeastol = relaxfeastol;
5408 set->limitchanged =
TRUE;
5419 assert(
set != NULL);
5422 return set->price_maxvarsroot;
5424 return set->price_maxvars;
5433 assert(
set != NULL);
5436 return set->sepa_maxcutsroot;
5438 return set->sepa_maxcuts;
5446 assert(NULL !=
set);
5448 return set->misc_referencevalue;
5457 assert(
set != NULL);
5459 return set->debugsoldata;
5473 #undef SCIPsetInfinity 5474 #undef SCIPsetEpsilon 5475 #undef SCIPsetSumepsilon 5476 #undef SCIPsetFeastol 5477 #undef SCIPsetLpfeastol 5478 #undef SCIPsetDualfeastol 5479 #undef SCIPsetBarrierconvtol 5480 #undef SCIPsetPseudocosteps 5481 #undef SCIPsetPseudocostdelta 5482 #undef SCIPsetCutoffbounddelta 5483 #undef SCIPsetRelaxfeastol 5484 #undef SCIPsetRecompfac 5490 #undef SCIPsetIsInfinity 5491 #undef SCIPsetIsZero 5492 #undef SCIPsetIsPositive 5493 #undef SCIPsetIsNegative 5494 #undef SCIPsetIsIntegral 5495 #undef SCIPsetIsScalingIntegral 5496 #undef SCIPsetIsFracIntegral 5501 #undef SCIPsetIsSumEQ 5502 #undef SCIPsetIsSumLT 5503 #undef SCIPsetIsSumLE 5504 #undef SCIPsetIsSumGT 5505 #undef SCIPsetIsSumGE 5506 #undef SCIPsetIsSumZero 5507 #undef SCIPsetIsSumPositive 5508 #undef SCIPsetIsSumNegative 5509 #undef SCIPsetSumFloor 5510 #undef SCIPsetSumCeil 5511 #undef SCIPsetSumRound 5512 #undef SCIPsetSumFrac 5513 #undef SCIPsetIsFeasEQ 5514 #undef SCIPsetIsFeasLT 5515 #undef SCIPsetIsFeasLE 5516 #undef SCIPsetIsFeasGT 5517 #undef SCIPsetIsFeasGE 5518 #undef SCIPsetIsFeasZero 5519 #undef SCIPsetIsFeasPositive 5520 #undef SCIPsetIsFeasNegative 5521 #undef SCIPsetIsFeasIntegral 5522 #undef SCIPsetIsFeasFracIntegral 5523 #undef SCIPsetFeasFloor 5524 #undef SCIPsetFeasCeil 5525 #undef SCIPsetFeasRound 5526 #undef SCIPsetFeasFrac 5527 #undef SCIPsetIsDualfeasEQ 5528 #undef SCIPsetIsDualfeasLT 5529 #undef SCIPsetIsDualfeasLE 5530 #undef SCIPsetIsDualfeasGT 5531 #undef SCIPsetIsDualfeasGE 5532 #undef SCIPsetIsDualfeasZero 5533 #undef SCIPsetIsDualfeasPositive 5534 #undef SCIPsetIsDualfeasNegative 5535 #undef SCIPsetIsDualfeasIntegral 5536 #undef SCIPsetIsDualfeasFracIntegral 5537 #undef SCIPsetDualfeasFloor 5538 #undef SCIPsetDualfeasCeil 5539 #undef SCIPsetDualfeasRound 5540 #undef SCIPsetDualfeasFrac 5541 #undef SCIPsetIsLbBetter 5542 #undef SCIPsetIsUbBetter 5543 #undef SCIPsetIsEfficacious 5544 #undef SCIPsetIsRelEQ 5545 #undef SCIPsetIsRelLT 5546 #undef SCIPsetIsRelLE 5547 #undef SCIPsetIsRelGT 5548 #undef SCIPsetIsRelGE 5549 #undef SCIPsetIsSumRelEQ 5550 #undef SCIPsetIsSumRelLT 5551 #undef SCIPsetIsSumRelLE 5552 #undef SCIPsetIsSumRelGT 5553 #undef SCIPsetIsSumRelGE 5554 #undef SCIPsetIsUpdateUnreliable 5555 #undef SCIPsetInitializeRandomSeed 5556 #undef SCIPsetIsHugeValue 5557 #undef SCIPsetGetHugeValue 5564 assert(
set != NULL);
5566 return set->num_infinity;
5576 assert(
set != NULL);
5578 return set->num_hugeval;
5586 assert(
set != NULL);
5588 return set->num_epsilon;
5596 assert(
set != NULL);
5598 return set->num_sumepsilon;
5606 assert(
set != NULL);
5608 return set->num_feastol;
5616 assert(
set != NULL);
5618 return set->num_dualfeastol;
5626 assert(
set != NULL);
5629 return MIN(set->num_relaxfeastol, set->num_lpfeastol);
5631 return set->num_lpfeastol;
5639 assert(
set != NULL);
5641 return set->num_barrierconvtol;
5649 assert(
set != NULL);
5651 return set->num_pseudocosteps;
5659 assert(
set != NULL);
5661 return set->num_pseudocostdelta;
5671 assert(
set != NULL);
5675 return MIN(100.0 * feastol, 0.0001);
5683 assert(
set != NULL);
5685 return set->num_relaxfeastol;
5694 assert(
set != NULL);
5696 return set->num_recompfac;
5705 assert(
set != NULL);
5707 return (val >= set->num_infinity);
5716 assert(
set != NULL);
5718 return (val >= set->num_hugeval);
5728 assert(
set != NULL);
5736 return EPSEQ(val1, val2, set->num_epsilon);
5746 assert(
set != NULL);
5754 return EPSLT(val1, val2, set->num_epsilon);
5764 assert(
set != NULL);
5772 return EPSLE(val1, val2, set->num_epsilon);
5782 assert(
set != NULL);
5790 return EPSGT(val1, val2, set->num_epsilon);
5800 assert(
set != NULL);
5808 return EPSGE(val1, val2, set->num_epsilon);
5817 assert(
set != NULL);
5819 return EPSZ(val, set->num_epsilon);
5828 assert(
set != NULL);
5830 return EPSP(val, set->num_epsilon);
5839 assert(
set != NULL);
5841 return EPSN(val, set->num_epsilon);
5850 assert(
set != NULL);
5864 assert(
set != NULL);
5867 scaledeps =
MAX(scaledeps, 1.0);
5868 scaledeps *=
set->num_epsilon;
5879 assert(
set != NULL);
5881 assert(
SCIPsetIsLE(
set, val, 1.0+set->num_epsilon));
5883 return (val <= set->num_epsilon);
5892 assert(
set != NULL);
5894 return EPSFLOOR(val, set->num_epsilon);
5903 assert(
set != NULL);
5905 return EPSCEIL(val, set->num_epsilon);
5914 assert(
set != NULL);
5916 return EPSROUND(val, set->num_epsilon);
5925 assert(
set != NULL);
5927 return EPSFRAC(val, set->num_epsilon);
5937 assert(
set != NULL);
5945 return EPSEQ(val1, val2, set->num_sumepsilon);
5955 assert(
set != NULL);
5963 return EPSLT(val1, val2, set->num_sumepsilon);
5973 assert(
set != NULL);
5981 return EPSLE(val1, val2, set->num_sumepsilon);
5991 assert(
set != NULL);
5999 return EPSGT(val1, val2, set->num_sumepsilon);
6009 assert(
set != NULL);
6017 return EPSGE(val1, val2, set->num_sumepsilon);
6026 assert(
set != NULL);
6028 return EPSZ(val, set->num_sumepsilon);
6037 assert(
set != NULL);
6039 return EPSP(val, set->num_sumepsilon);
6048 assert(
set != NULL);
6050 return EPSN(val, set->num_sumepsilon);
6059 assert(
set != NULL);
6070 assert(
set != NULL);
6072 return EPSCEIL(val, set->num_sumepsilon);
6081 assert(
set != NULL);
6083 return EPSROUND(val, set->num_sumepsilon);
6092 assert(
set != NULL);
6094 return EPSFRAC(val, set->num_sumepsilon);
6106 assert(
set != NULL);
6116 return EPSZ(diff, set->num_feastol);
6128 assert(
set != NULL);
6138 return EPSN(diff, set->num_feastol);
6150 assert(
set != NULL);
6160 return !
EPSP(diff, set->num_feastol);
6172 assert(
set != NULL);
6182 return EPSP(diff, set->num_feastol);
6194 assert(
set != NULL);
6204 return !
EPSN(diff, set->num_feastol);
6213 assert(
set != NULL);
6215 return EPSZ(val, set->num_feastol);
6224 assert(
set != NULL);
6226 return EPSP(val, set->num_feastol);
6235 assert(
set != NULL);
6237 return EPSN(val, set->num_feastol);
6246 assert(
set != NULL);
6248 return EPSISINT(val, set->num_feastol);
6257 assert(
set != NULL);
6258 assert(
SCIPsetIsGE(
set, val, -2*set->num_feastol));
6259 assert(
SCIPsetIsLE(
set, val, 1.0+set->num_feastol));
6261 return (val <= set->num_feastol);
6270 assert(
set != NULL);
6272 return EPSFLOOR(val, set->num_feastol);
6281 assert(
set != NULL);
6283 return EPSCEIL(val, set->num_feastol);
6292 assert(
set != NULL);
6294 return EPSROUND(val, set->num_feastol);
6303 assert(
set != NULL);
6305 return EPSFRAC(val, set->num_feastol);
6317 assert(
set != NULL);
6327 return EPSZ(diff, set->num_dualfeastol);
6339 assert(
set != NULL);
6349 return EPSN(diff, set->num_dualfeastol);
6361 assert(
set != NULL);
6371 return !
EPSP(diff, set->num_dualfeastol);
6383 assert(
set != NULL);
6393 return EPSP(diff, set->num_dualfeastol);
6405 assert(
set != NULL);
6415 return !
EPSN(diff, set->num_dualfeastol);
6424 assert(
set != NULL);
6426 return EPSZ(val, set->num_dualfeastol);
6435 assert(
set != NULL);
6437 return EPSP(val, set->num_dualfeastol);
6446 assert(
set != NULL);
6448 return EPSN(val, set->num_dualfeastol);
6457 assert(
set != NULL);
6459 return EPSISINT(val, set->num_dualfeastol);
6468 assert(
set != NULL);
6469 assert(
SCIPsetIsGE(
set, val, -set->num_dualfeastol));
6470 assert(
SCIPsetIsLE(
set, val, 1.0+set->num_dualfeastol));
6472 return (val <= set->num_dualfeastol);
6481 assert(
set != NULL);
6483 return EPSFLOOR(val, set->num_dualfeastol);
6492 assert(
set != NULL);
6494 return EPSCEIL(val, set->num_dualfeastol);
6503 assert(
set != NULL);
6505 return EPSROUND(val, set->num_dualfeastol);
6514 assert(
set != NULL);
6516 return EPSFRAC(val, set->num_dualfeastol);
6532 assert(
set != NULL);
6536 if( oldlb < 0.0 && newlb >= 0.0 )
6540 eps = MIN(oldub - oldlb, eps);
6541 return EPSGT(newlb, oldlb, set->num_boundstreps *
MAX(eps, 1e-3));
6557 assert(
set != NULL);
6561 if( oldub > 0.0 && newub <= 0.0 )
6565 eps = MIN(oldub - oldlb, eps);
6566 return EPSLT(newub, oldub, set->num_boundstreps *
MAX(eps, 1e-3));
6576 assert(
set != NULL);
6579 return EPSP(efficacy, set->sepa_minefficacyroot);
6581 return EPSP(efficacy, set->sepa_minefficacy);
6593 assert(
set != NULL);
6603 return EPSZ(diff, set->num_epsilon);
6615 assert(
set != NULL);
6625 return EPSN(diff, set->num_epsilon);
6637 assert(
set != NULL);
6647 return !
EPSP(diff, set->num_epsilon);
6659 assert(
set != NULL);
6669 return EPSP(diff, set->num_epsilon);
6681 assert(
set != NULL);
6691 return !
EPSN(diff, set->num_epsilon);
6703 assert(
set != NULL);
6713 return EPSZ(diff, set->num_sumepsilon);
6725 assert(
set != NULL);
6735 return EPSN(diff, set->num_sumepsilon);
6747 assert(
set != NULL);
6757 return !
EPSP(diff, set->num_sumepsilon);
6769 assert(
set != NULL);
6779 return EPSP(diff, set->num_sumepsilon);
6791 assert(
set != NULL);
6801 return !
EPSN(diff, set->num_sumepsilon);
6823 assert(
set != NULL);
6825 quotient = ABS(oldvalue) /
MAX(ABS(newvalue), set->num_epsilon);
6827 return quotient >=
set->num_recompfac;
6833 const char* sourcefile,
6835 const char* formatstr,
6839 int subscipdepth = 0;
6843 assert( sourcefile != NULL );
6844 assert(
set != NULL );
6847 assert( scip != NULL );
6849 if ( scip->
stat != NULL )
6852 if ( subscipdepth > 0 )
6857 va_start(ap, formatstr);
6865 const char* formatstr,
6871 assert(
set != NULL );
6872 assert( set->scip != NULL );
6874 va_start(ap, formatstr);
6882 int initialseedvalue
6885 assert(
set != NULL);
6887 return (initialseedvalue + set->random_randomseedshift);
SCIP_RETCODE SCIPsetInitprePlugins(SCIP_SET *set, BMS_BLKMEM *blkmem, SCIP_STAT *stat)
SCIP_RETCODE SCIPsetIncludePresol(SCIP_SET *set, SCIP_PRESOL *presol)
void SCIPpricerEnableOrDisableClocks(SCIP_PRICER *pricer, SCIP_Bool enable)
SCIP_Real SCIPsetFeasRound(SCIP_SET *set, SCIP_Real val)
internal methods for separators
SCIP_Bool SCIPsetIsUpdateUnreliable(SCIP_SET *set, SCIP_Real newvalue, SCIP_Real oldvalue)
SCIP_RETCODE SCIPsetExitsolPlugins(SCIP_SET *set, BMS_BLKMEM *blkmem, SCIP_STAT *stat, SCIP_Bool restart)
#define SCIP_DEFAULT_SEPA_MINORTHO
void SCIPsetSortPropsName(SCIP_SET *set)
#define SCIP_DEFAULT_DISP_LPINFO
SCIP_RETCODE SCIPsetSetEmphasis(SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, SCIP_PARAMEMPHASIS paramemphasis, SCIP_Bool quiet)
SCIP_RETCODE SCIPparamsetFix(SCIP_PARAMSET *paramset, const char *name, SCIP_Bool fixed)
SCIP_RETCODE SCIPpricerInit(SCIP_PRICER *pricer, SCIP_SET *set)
#define SCIP_DEFAULT_BRANCH_FIRSTSBCHILD
#define SCIP_DEFAULT_PRESOL_MAXROUNDS
SCIP_Bool SCIPconflicthdlrIsInitialized(SCIP_CONFLICTHDLR *conflicthdlr)
SCIP_RETCODE SCIPreaderCopyInclude(SCIP_READER *reader, SCIP_SET *set)
#define SCIP_DEFAULT_BRANCH_ROUNDSBSOL
SCIP_RETCODE SCIPpropExitpre(SCIP_PROP *prop, SCIP_SET *set)
SCIP_RETCODE SCIPsetIncludeEventhdlr(SCIP_SET *set, SCIP_EVENTHDLR *eventhdlr)
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_Bool SCIPsetIsInfinity(SCIP_SET *set, SCIP_Real val)
SCIP_Bool SCIPsetIsSumGE(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)
SCIP_RETCODE SCIPpropInitsol(SCIP_PROP *prop, SCIP_SET *set)
SCIP_RETCODE SCIPdispInit(SCIP_DISP *disp, SCIP_SET *set)
#define SCIP_DEFAULT_VISUAL_BAKFILENAME
#define SCIP_DEFAULT_LP_CLEANUPCOLS
internal methods for managing events
SCIP_RETCODE SCIPparamsetWrite(SCIP_PARAMSET *paramset, SCIP_MESSAGEHDLR *messagehdlr, const char *filename, SCIP_Bool comments, SCIP_Bool onlychanged)
#define SCIP_DEFAULT_BRANCH_DELAYPSCOST
SCIP_Bool SCIPbranchruleIsInitialized(SCIP_BRANCHRULE *branchrule)
SCIP_Bool SCIPsetIsLE(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)
SCIP_Bool SCIPsetIsFeasZero(SCIP_SET *set, SCIP_Real val)
void SCIPsepaEnableOrDisableClocks(SCIP_SEPA *sepa, SCIP_Bool enable)
#define SCIP_DEFAULT_LP_LEXDUALMAXROUNDS
int SCIPnodeselGetMemsavePriority(SCIP_NODESEL *nodesel)
#define SCIP_DEFAULT_PRESOL_DONOTAGGR
static int calcGrowSize(int initsize, SCIP_Real growfac, int num)
#define SCIP_DEFAULT_SEPA_MAXROUNDSROOTSUBRUN
const char * SCIPpricerGetName(SCIP_PRICER *pricer)
void SCIPnodeselEnableOrDisableClocks(SCIP_NODESEL *nodesel, SCIP_Bool enable)
#define SCIP_DEFAULT_CONF_CLEANBNDDEPEND
#define SCIP_DEFAULT_REOPT_ENABLE
SCIP_STAGE SCIPgetStage(SCIP *scip)
SCIP_RETCODE SCIPsetIncludeConcsolver(SCIP_SET *set, SCIP_CONCSOLVER *concsolver)
#define BMSfreeMemoryArrayNull(ptr)
SCIP_RETCODE SCIPchgBarrierconvtol(SCIP *scip, SCIP_Real barrierconvtol)
SCIP_RETCODE SCIPdispInitsol(SCIP_DISP *disp, SCIP_SET *set)
SCIP_RETCODE SCIPpresolInit(SCIP_PRESOL *presol, SCIP_SET *set)
#define SCIP_DEFAULT_MISC_USESMALLTABLES
#define SCIP_DEFAULT_CONF_USEINFLP
SCIP_RETCODE SCIPtableInitsol(SCIP_TABLE *table, SCIP_SET *set)
#define SCIP_DEFAULT_CONF_MAXLPLOOPS
SCIP_CONFLICTHDLR ** conflicthdlrs
#define SCIP_DEFAULT_VISUAL_OBJEXTERN
#define SCIP_DEFAULT_MISC_REFERENCEVALUE
void SCIPsetPrintDebugMessage(SCIP_SET *set, const char *sourcefile, int sourceline, const char *formatstr,...)
#define SCIP_DEFAULT_MISC_FINITESOLSTORE
SCIP_Bool SCIPsetIsSumZero(SCIP_SET *set, SCIP_Real val)
SCIP_RETCODE SCIPconshdlrExit(SCIP_CONSHDLR *conshdlr, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat)
SCIP_NLPI * SCIPsetFindNlpi(SCIP_SET *set, const char *name)
#define SCIP_DEFAULT_LIMIT_SOLUTIONS
SCIP_Real SCIPsetFeastol(SCIP_SET *set)
#define SCIP_DEFAULT_CONCURRENT_MAXNSYNCDELAY
#define SCIP_DEFAULT_READ_DYNAMICCOLS
#define SCIP_DEFAULT_REOPT_SAVECONSPROP
SCIP_Bool SCIPsetIsDualfeasEQ(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)
#define SCIP_DEFAULT_MEM_TREEGROWINIT
SCIP_PRICER * SCIPsetFindPricer(SCIP_SET *set, const char *name)
SCIP_TABLE * SCIPsetFindTable(SCIP_SET *set, const char *name)
SCIP_RETCODE SCIPdispAutoActivate(SCIP_SET *set)
#define SCIP_DEFAULT_CONF_RESTARTNUM
#define SCIP_DEFAULT_LP_PRICING
SCIP_RETCODE SCIPpropCopyInclude(SCIP_PROP *prop, SCIP_SET *set)
SCIP_RETCODE SCIPsepaCopyInclude(SCIP_SEPA *sepa, SCIP_SET *set)
#define SCIP_DEFAULT_CONF_REPROPAGATE
#define SCIP_DEFAULT_MISC_OUTPUTORIGSOL
SCIP_Real SCIPsetFloor(SCIP_SET *set, SCIP_Real val)
#define SCIP_DEFAULT_CONCURRENT_FREQFACTOR
SCIP_Real SCIPsetPseudocosteps(SCIP_SET *set)
SCIP_Bool SCIPsetIsFeasEQ(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)
SCIP_RETCODE SCIPsetSetRealParam(SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, const char *name, SCIP_Real value)
SCIP_RETCODE SCIPrelaxInit(SCIP_RELAX *relax, SCIP_SET *set)
#define SCIP_DEFAULT_CONCURRENT_NBESTSOLS
SCIP_RETCODE SCIPbranchruleExitsol(SCIP_BRANCHRULE *branchrule, SCIP_SET *set)
SCIP_RETCODE SCIPnodeselExitsol(SCIP_NODESEL *nodesel, SCIP_SET *set)
#define SCIP_DEFAULT_MISC_RESETSTAT
#define SCIP_DEFAULT_SEPA_MAXRUNS
#define SCIP_DEFAULT_LIMIT_TIME
#define SCIP_DEFAULT_LP_LEXDUALROOTONLY
SCIP_RETCODE SCIPpresolFree(SCIP_PRESOL **presol, SCIP_SET *set)
#define SCIP_DEFAULT_WRITE_GENNAMES_OFFSET
SCIP_Bool SCIPsetIsDualfeasGE(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)
SCIP_RETCODE SCIPdispFree(SCIP_DISP **disp, SCIP_SET *set)
SCIP_RETCODE SCIPeventhdlrExit(SCIP_EVENTHDLR *eventhdlr, SCIP_SET *set)
SCIP_RETCODE SCIPcomprInit(SCIP_COMPR *compr, SCIP_SET *set)
#define SCIP_DEFAULT_PROP_MAXROUNDSROOT
#define SCIP_DEFAULT_LP_PRESOLVING
internal methods for clocks and timing issues
#define SCIP_DEFAULT_REOPT_SEPABESTSOL
SCIP_RETCODE SCIPparamsetSetToDefault(SCIP_PARAMSET *paramset, SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, const char *paramname)
SCIP_Bool SCIPsetIsSumGT(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)
#define SCIP_DEFAULT_REOPT_MAXDIFFOFNODES
SCIP_RETCODE SCIPsetCreate(SCIP_SET **set, SCIP_MESSAGEHDLR *messagehdlr, BMS_BLKMEM *blkmem, SCIP *scip)
SCIP_RETCODE SCIPsetIncludeRelax(SCIP_SET *set, SCIP_RELAX *relax)
SCIP_Bool SCIPsetIsPositive(SCIP_SET *set, SCIP_Real val)
SCIP_EVENTHDLR * SCIPsetFindEventhdlr(SCIP_SET *set, const char *name)
#define SCIP_DEFAULT_MEM_SAVEFAC
#define SCIP_DEFAULT_SEPA_CUTSELSUBSCIP
#define SCIP_DEFAULT_CONF_FULLSHORTENCONFLICT
struct SCIP_ParamData SCIP_PARAMDATA
#define SCIP_DEFAULT_CONCURRENT_COMMVARBNDS
#define SCIP_DEFAULT_LP_INITALGORITHM
#define SCIP_DEFAULT_CONS_AGELIMIT
#define SCIP_DEFAULT_PRESOL_ABORTFAC
void SCIPsetSortComprsName(SCIP_SET *set)
SCIP_Bool SCIPsetIsSumRelGT(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)
internal methods for NLPI solver interfaces
#define SCIP_DEFAULT_SEPA_CUTAGELIMIT
SCIP_RETCODE SCIPsetIncludeConshdlr(SCIP_SET *set, SCIP_CONSHDLR *conshdlr)
SCIP_RETCODE SCIPsetGetStringParam(SCIP_SET *set, const char *name, char **value)
const char * SCIPbanditvtableGetName(SCIP_BANDITVTABLE *banditvtable)
#define SCIPdebugSolDataCreate(debugsoldata)
void SCIPconcsolverTypeFree(SCIP_CONCSOLVERTYPE **concsolvertype)
SCIP_RETCODE SCIPparamsetSetSeparating(SCIP_PARAMSET *paramset, SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, SCIP_PARAMSETTING paramsetting, SCIP_Bool quiet)
SCIP_RETCODE SCIPeventhdlrCopyInclude(SCIP_EVENTHDLR *eventhdlr, SCIP_SET *set)
SCIP_RETCODE SCIPsetIncludeBanditvtable(SCIP_SET *set, SCIP_BANDITVTABLE *banditvtable)
SCIP_RETCODE SCIPsetResetParams(SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr)
SCIP_RETCODE SCIPdispExit(SCIP_DISP *disp, SCIP_SET *set)
#define SCIP_DEFAULT_CONF_MAXSTORESIZE
const char * SCIPreaderGetName(SCIP_READER *reader)
#define SCIP_DEFAULT_REOPT_REDUCETOFRONTIER
#define SCIP_DEFAULT_REOPT_MAXSAVEDNODES
SCIP_Bool SCIPsetIsScalingIntegral(SCIP_SET *set, SCIP_Real val, SCIP_Real scalar)
#define SCIP_DEFAULT_LP_THREADS
SCIP_Real SCIPsetInfinity(SCIP_SET *set)
internal methods for displaying statistics tables
#define SCIP_DEFAULT_LIMIT_ABSGAP
#define SCIP_DEFAULT_BRANCH_FORCEALL
SCIP_RETCODE SCIPtableFree(SCIP_TABLE **table, SCIP_SET *set)
SCIP_Bool SCIPpricerIsActive(SCIP_PRICER *pricer)
void SCIPsetSortConflicthdlrsName(SCIP_SET *set)
SCIP_RETCODE SCIPsetIncludeDialog(SCIP_SET *set, SCIP_DIALOG *dialog)
#define SCIP_DEFAULT_CONF_MAXCONSS
SCIP_RETCODE SCIPheurFree(SCIP_HEUR **heur, SCIP_SET *set, BMS_BLKMEM *blkmem)
#define SCIP_DEFAULT_REOPT_USECUTS
SCIP_RETCODE SCIPpresolExit(SCIP_PRESOL *presol, SCIP_SET *set)
enum SCIP_ClockType SCIP_CLOCKTYPE
#define SCIP_DEFAULT_MISC_CATCHCTRLC
SCIP_Bool SCIPcomprIsInitialized(SCIP_COMPR *compr)
void SCIPsetSortHeurs(SCIP_SET *set)
#define SCIP_DEFAULT_MISC_CALCINTEGRAL
SCIP_RETCODE SCIPpricerInitsol(SCIP_PRICER *pricer, SCIP_SET *set)
#define SCIP_DEFAULT_RECOMPFAC
#define SCIP_DEFAULT_CONF_MAXVARSFAC
#define SCIP_DEFAULT_CONF_PROOFSCOREFAC
SCIP_Real SCIPsetSetRelaxfeastol(SCIP_SET *set, SCIP_Real relaxfeastol)
SCIP_Bool SCIPsetIsFeasIntegral(SCIP_SET *set, SCIP_Real val)
const char * SCIPeventhdlrGetName(SCIP_EVENTHDLR *eventhdlr)
internal methods for bandit algorithms
SCIP_NODESEL * SCIPsetGetNodesel(SCIP_SET *set, SCIP_STAT *stat)
SCIP_Real SCIPrelDiff(SCIP_Real val1, SCIP_Real val2)
SCIP_PROP * SCIPsetFindProp(SCIP_SET *set, const char *name)
const char * SCIPtableGetName(SCIP_TABLE *table)
SCIP_RETCODE SCIPconshdlrInitsol(SCIP_CONSHDLR *conshdlr, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat)
#define SCIP_DEFAULT_MISC_USEVARTABLE
SCIP_RETCODE SCIPcomprFree(SCIP_COMPR **compr, SCIP_SET *set)
SCIP_Bool SCIPsetIsZero(SCIP_SET *set, SCIP_Real val)
void SCIPbanditvtableFree(SCIP_BANDITVTABLE **banditvtable)
const char * SCIPsepaGetName(SCIP_SEPA *sepa)
enum SCIP_Retcode SCIP_RETCODE
SCIP_PRESOL * SCIPsetFindPresol(SCIP_SET *set, const char *name)
SCIP_RETCODE SCIPheurInitsol(SCIP_HEUR *heur, SCIP_SET *set)
SCIP_PARAM * SCIPparamsetGetParam(SCIP_PARAMSET *paramset, const char *name)
#define SCIP_DEFAULT_REOPT_COMMONTIMELIMIT
SCIP_RETCODE SCIPsetSetParam(SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, const char *name, void *value)
enum SCIP_VerbLevel SCIP_VERBLEVEL
internal methods for branching rules and branching candidate storage
SCIP_RETCODE SCIPnodeselInitsol(SCIP_NODESEL *nodesel, SCIP_SET *set)
SCIP_RETCODE SCIPconflicthdlrExitsol(SCIP_CONFLICTHDLR *conflicthdlr, SCIP_SET *set)
SCIP_Real SCIPsetCutoffbounddelta(SCIP_SET *set)
int SCIPsetCalcMemGrowSize(SCIP_SET *set, int num)
const char * SCIPnlpiGetName(SCIP_NLPI *nlpi)
#define SCIP_DEFAULT_PRESOL_MAXRESTARTS
SCIP_Bool SCIPsetIsSumLT(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)
datastructures for concurrent solvers
SCIP_PARAM ** SCIPsetGetParams(SCIP_SET *set)
SCIP_Real SCIPsetRound(SCIP_SET *set, SCIP_Real val)
#define SCIP_DEFAULT_CONF_IGNORERELAXEDBD
#define SCIP_DEFAULT_LIMIT_STALLNODES
#define SCIP_DEFAULT_SEPA_MAXSTALLROUNDSROOT
#define SCIP_DEFAULT_LP_SCALING
SCIP_Bool SCIPsetIsDualfeasLE(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)
SCIP_RETCODE SCIPparamsetSetToDefaults(SCIP_PARAMSET *paramset, SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr)
#define SCIP_DEFAULT_SEPA_MINACTIVITYQUOT
SCIP_RETCODE SCIPsetIncludeNlpi(SCIP_SET *set, SCIP_NLPI *nlpi)
#define SCIP_DEFAULT_CONCURRENT_PRESOLVEBEFORE
SCIP_RETCODE SCIPenableOrDisableStatisticTiming(SCIP *scip)
#define SCIP_DEFAULT_NLP_SOLVER
SCIP_RETCODE SCIPbranchruleInitsol(SCIP_BRANCHRULE *branchrule, SCIP_SET *set)
SCIP_RETCODE SCIPconshdlrInit(SCIP_CONSHDLR *conshdlr, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat)
SCIP_Real SCIPsetRelaxfeastol(SCIP_SET *set)
SCIP_RETCODE SCIPsepaFree(SCIP_SEPA **sepa, SCIP_SET *set)
#define SCIP_DEFAULT_PROP_ABORTONCUTOFF
SCIP_RETCODE SCIPrelaxFree(SCIP_RELAX **relax, SCIP_SET *set)
#define SCIP_DEFAULT_LP_CLEARINITIALPROBINGLP
#define SCIP_DEFAULT_CONF_MINIMPROVE
#define SCIP_DEFAULT_CONCURRENT_MINSYNCDELAY
#define SCIP_DEFAULT_REOPT_VARORDERINTERDICTION
internal methods for handling parameter settings
#define SCIP_DEFAULT_LP_SOLUTIONPOLISHING
SCIP_RETCODE SCIPsetIncludeConcsolverType(SCIP_SET *set, SCIP_CONCSOLVERTYPE *concsolvertype)
#define SCIP_DEFAULT_SEPA_MAXLOCALBOUNDDIST
SCIP_RETCODE SCIPheurCopyInclude(SCIP_HEUR *heur, SCIP_SET *set)
SCIP_Bool SCIPsetIsNegative(SCIP_SET *set, SCIP_Real val)
#define SCIP_DEFAULT_DISP_FREQ
#define SCIP_DEFAULT_CONF_DOWNLOCKSCOREFAC
#define BMSfreeMemory(ptr)
SCIP_RETCODE SCIPpropInit(SCIP_PROP *prop, SCIP_SET *set)
#define SCIP_DEFAULT_MISC_IMPROVINGSOLS
SCIP_Real SCIPsetSumFloor(SCIP_SET *set, SCIP_Real val)
#define SCIP_DEFAULT_CONF_UPLOCKSCOREFAC
SCIP_CONSHDLR ** conshdlrs_include
#define SCIP_DEFAULT_VISUAL_REALTIME
SCIP_Bool SCIPpropIsInitialized(SCIP_PROP *prop)
SCIP_RETCODE SCIPpricerCopyInclude(SCIP_PRICER *pricer, SCIP_SET *set, SCIP_Bool *valid)
#define SCIP_DEFAULT_LP_SOLVEDEPTH
#define SCIP_DEFAULT_SEPA_ORTHOFUNC
SCIP_Real SCIPparamGetReal(SCIP_PARAM *param)
SCIP_Real SCIPsetCeil(SCIP_SET *set, SCIP_Real val)
SCIP_Real SCIPsetGetHugeValue(SCIP_SET *set)
internal methods for LP management
SCIP_Bool SCIPsetIsFeasFracIntegral(SCIP_SET *set, SCIP_Real val)
void SCIPsetSortHeursName(SCIP_SET *set)
#define SCIP_DEFAULT_CONCURRENT_TARGETPROGRESS
SCIP_RETCODE SCIPnodeselExit(SCIP_NODESEL *nodesel, SCIP_SET *set)
#define SCIP_DEFAULT_LP_ROWREPSWITCH
int SCIPconshdlrGetSepaPriority(SCIP_CONSHDLR *conshdlr)
#define SCIP_DEFAULT_LP_RESOLVEITERMIN
#define SCIP_DEFAULT_SEPA_MAXCOEFRATIO
SCIP_RETCODE SCIPsetIncludeSepa(SCIP_SET *set, SCIP_SEPA *sepa)
#define SCIP_DEFAULT_REOPT_STRONGBRANCHINIT
#define SCIP_DEFAULT_REOPT_STOREVARHISTOTY
SCIP_RETCODE SCIPsetIncludeCompr(SCIP_SET *set, SCIP_COMPR *compr)
SCIP_RETCODE SCIPsetSetStringParam(SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, const char *name, const char *value)
#define SCIP_DEFAULT_COMPR_ENABLE
enum SCIP_ParamSetting SCIP_PARAMSETTING
int SCIPsetGetSepaMaxcuts(SCIP_SET *set, SCIP_Bool root)
SCIP_Bool SCIPconshdlrIsClonable(SCIP_CONSHDLR *conshdlr)
#define SCIP_DEFAULT_DISP_WIDTH
SCIP_Real SCIPsetPseudocostdelta(SCIP_SET *set)
SCIP_RETCODE SCIPreaderFree(SCIP_READER **reader, SCIP_SET *set)
#define SCIP_DEFAULT_LP_ROOTITERLIM
SCIP_RETCODE SCIPpricerExit(SCIP_PRICER *pricer, SCIP_SET *set)
SCIP_RETCODE SCIPsetSetFeastol(SCIP_SET *set, SCIP_Real feastol)
SCIP_RETCODE SCIPsepaInit(SCIP_SEPA *sepa, SCIP_SET *set)
#define SCIP_DEFAULT_EPSILON
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_Bool SCIPsetIsGE(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)
#define SCIP_DEFAULT_CONF_SETTLELOCAL
internal methods for propagators
SCIP_RETCODE SCIPdispCopyInclude(SCIP_DISP *disp, SCIP_SET *set)
SCIP_RETCODE SCIPparamSetInt(SCIP_PARAM *param, SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, int value, SCIP_Bool initialize, SCIP_Bool quiet)
#define SCIP_DEFAULT_CHECKFEASTOLFAC
SCIP_RETCODE SCIPnodeselCopyInclude(SCIP_NODESEL *nodesel, SCIP_SET *set)
#define SCIP_DEFAULT_TIME_ENABLED
SCIP_Bool SCIPsetIsEfficacious(SCIP_SET *set, SCIP_Bool root, SCIP_Real efficacy)
#define SCIP_DEFAULT_PRESOL_RESTARTMINRED
#define SCIP_DEFAULT_CONF_KEEPREPROP
#define SCIP_DEFAULT_LIMIT_NODES
SCIP_Real SCIPsetDualfeasFloor(SCIP_SET *set, SCIP_Real val)
SCIP_RETCODE SCIPsetInitPlugins(SCIP_SET *set, BMS_BLKMEM *blkmem, SCIP_STAT *stat)
SCIP_RETCODE SCIPsetFree(SCIP_SET **set, BMS_BLKMEM *blkmem)
void SCIPreaderEnableOrDisableClocks(SCIP_READER *reader, SCIP_Bool enable)
#define SCIP_DEFAULT_LIMIT_AUTORESTARTNODES
int SCIPconshdlrGetCheckPriority(SCIP_CONSHDLR *conshdlr)
SCIP_RETCODE SCIPeventhdlrFree(SCIP_EVENTHDLR **eventhdlr, SCIP_SET *set)
#define SCIP_DEFAULT_MISC_ALLOWDUALREDS
struct SCIP_DebugSolData SCIP_DEBUGSOLDATA
SCIP_RETCODE SCIPparamSetChar(SCIP_PARAM *param, SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, char value, SCIP_Bool initialize, SCIP_Bool quiet)
SCIP_Bool SCIPsetIsLT(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)
SCIP_RETCODE SCIPsetReadParams(SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, const char *filename)
SCIP_Bool SCIPtableIsInitialized(SCIP_TABLE *table)
#define SCIP_DEFAULT_PRICE_MAXVARS
#define SCIP_DEFAULT_PRICE_ABORTFAC
#define SCIP_DEFAULT_TIME_READING
SCIP_RETCODE SCIPparamsetSetToSubscipsOff(SCIP_PARAMSET *paramset, SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, SCIP_Bool quiet)
#define SCIP_DEFAULT_CONF_LPITERATIONS
SCIP_RETCODE SCIPconflicthdlrExit(SCIP_CONFLICTHDLR *conflicthdlr, SCIP_SET *set)
#define SCIP_DEFAULT_CONF_USEBOUNDLP
SCIP_RETCODE SCIPconshdlrCopyInclude(SCIP_CONSHDLR *conshdlr, SCIP_SET *set, SCIP_Bool *valid)
#define SCIP_DEFAULT_PRESOL_RESTARTFAC
SCIP_RETCODE SCIPconflicthdlrInitsol(SCIP_CONFLICTHDLR *conflicthdlr, SCIP_SET *set)
SCIP_Bool SCIPsetIsSumLE(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)
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 copypropagators, SCIP_Bool copyheuristics, SCIP_Bool copyeventhdlrs, SCIP_Bool copynodeselectors, SCIP_Bool copybranchrules, SCIP_Bool copydisplays, SCIP_Bool copydialogs, SCIP_Bool copytables, SCIP_Bool copynlpis, SCIP_Bool *allvalid)
#define SCIP_DEFAULT_MISC_ALLOWOBJPROP
SCIP_CONSHDLR * SCIPsetFindConshdlr(SCIP_SET *set, const char *name)
SCIP_RETCODE SCIPsepaInitsol(SCIP_SEPA *sepa, SCIP_SET *set)
SCIP_RETCODE SCIPsetIncludeHeur(SCIP_SET *set, SCIP_HEUR *heur)
#define SCIP_DEFAULT_LP_LEXDUALALGO
#define SCIP_DEFAULT_RANDOM_LPSEED
SCIP_RETCODE SCIPsetChgIntParam(SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, SCIP_PARAM *param, int value)
#define SCIP_DEFAULT_REOPT_OBJSIMROOTLP
BMS_BUFMEM * SCIPbuffer(SCIP *scip)
SCIP_Bool SCIPsetIsParamFixed(SCIP_SET *set, const char *name)
#define SCIP_DEFAULT_MISC_ESTIMEXTERNMEM
void BMSsetBufferMemoryArraygrowinit(BMS_BUFMEM *buffer, int arraygrowinit)
SCIP_Bool SCIPsetIsSumRelGE(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)
#define SCIP_DEFAULT_SEPA_MAXROUNDS
SCIP_RETCODE SCIPnlpiFree(SCIP_NLPI **nlpi)
SCIP_RETCODE SCIPsetSetSubscipsOff(SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, SCIP_Bool quiet)
void SCIPsetSetPriorityNlpi(SCIP_SET *set, SCIP_NLPI *nlpi, int priority)
#define SCIP_DEFAULT_CONCURRENT_CHANGESEEDS
void SCIPsetReinsertConshdlrSepaPrio(SCIP_SET *set, SCIP_CONSHDLR *conshdlr, int oldpriority)
SCIP_RETCODE SCIPparamsetGetInt(SCIP_PARAMSET *paramset, const char *name, int *value)
void SCIPconshdlrEnableOrDisableClocks(SCIP_CONSHDLR *conshdlr, SCIP_Bool enable)
#define SCIP_DEFAULT_CONF_CONFLITGRAPHWEIGHT
const char * SCIPheurGetName(SCIP_HEUR *heur)
#define SCIP_DEFAULT_CONF_WEIGHTVALIDDEPTH
SCIP_RETCODE SCIPsetChgBoolParam(SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, SCIP_PARAM *param, SCIP_Bool value)
#define SCIP_DEFAULT_MEM_TREEGROWFAC
#define SCIP_DEFAULT_PRESOL_DONOTMULTAGGR
#define SCIP_DEFAULT_CONF_INTERCONSS
SCIP_Real SCIPsetLpfeastol(SCIP_SET *set)
#define SCIP_DEFAULT_REOPT_USESPLITCONS
const char * SCIPconshdlrGetName(SCIP_CONSHDLR *conshdlr)
#define SCIP_DEFAULT_RANDOM_PERMUTECONSS
SCIP_BANDITVTABLE * SCIPsetFindBanditvtable(SCIP_SET *set, const char *name)
SCIP_RETCODE SCIPparamsetSetReal(SCIP_PARAMSET *paramset, SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, const char *name, SCIP_Real value)
#define SCIP_DEFAULT_CONF_SEPARATE
SCIP_RETCODE SCIPdispExitsol(SCIP_DISP *disp, SCIP_SET *set)
SCIP_RETCODE SCIPrelaxExit(SCIP_RELAX *relax, SCIP_SET *set)
SCIP_RETCODE SCIPparamSetBool(SCIP_PARAM *param, SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, SCIP_Bool value, SCIP_Bool initialize, SCIP_Bool quiet)
#define SCIP_DEFAULT_TIME_RARECLOCKCHECK
#define SCIP_DEFAULT_BRANCH_SCOREFUNC
SCIP_RETCODE SCIPsetWriteParams(SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, const char *filename, SCIP_Bool comments, SCIP_Bool onlychanged)
SCIP_RETCODE SCIPparamsetSetDefaultInt(SCIP_PARAMSET *paramset, const char *name, int defaultvalue)
SCIP_RETCODE SCIPparamsetGetBool(SCIP_PARAMSET *paramset, const char *name, SCIP_Bool *value)
static SCIP_DECL_PARAMCHGD(paramChgdFeastol)
SCIP_Bool SCIPsetIsSumRelEQ(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)
SCIP_RETCODE SCIPtableInit(SCIP_TABLE *table, SCIP_SET *set)
SCIP_Bool SCIPeventhdlrIsInitialized(SCIP_EVENTHDLR *eventhdlr)
SCIP_Bool SCIPsetIsRelEQ(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)
#define SCIP_DEFAULT_SEPA_MINEFFICACY
SCIP_RETCODE SCIPsetSetSeparating(SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, SCIP_PARAMSETTING paramsetting, SCIP_Bool quiet)
SCIP_Bool SCIPsetIsDualfeasIntegral(SCIP_SET *set, SCIP_Real val)
#define SCIP_DEFAULT_MISC_EXACTSOLVE
BMS_BLKMEM * SCIPblkmem(SCIP *scip)
SCIP_RETCODE SCIPpricerFree(SCIP_PRICER **pricer, SCIP_SET *set)
void SCIPpresolEnableOrDisableClocks(SCIP_PRESOL *presol, SCIP_Bool enable)
#define SCIP_DEFAULT_HISTORY_ALLOWTRANSFER
#define SCIP_DEFAULT_LIMIT_BESTSOL
internal methods for presolvers
SCIP_RETCODE SCIPbranchruleExit(SCIP_BRANCHRULE *branchrule, SCIP_SET *set)
void SCIPsetSortComprs(SCIP_SET *set)
SCIP_RETCODE SCIPsetInitsolPlugins(SCIP_SET *set, BMS_BLKMEM *blkmem, SCIP_STAT *stat)
#define SCIP_DEFAULT_BRANCH_CLAMP
SCIP_RETCODE SCIPsetSetIntParam(SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, const char *name, int value)
SCIP_RELAX * SCIPsetFindRelax(SCIP_SET *set, const char *name)
void SCIPeventhdlrEnableOrDisableClocks(SCIP_EVENTHDLR *eventhdlr, SCIP_Bool enable)
SCIP_RETCODE SCIPparamSetString(SCIP_PARAM *param, SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, const char *value, SCIP_Bool quiet)
SCIP_RETCODE SCIPconshdlrInitpre(SCIP_CONSHDLR *conshdlr, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat)
SCIP_Real SCIPsetBarrierconvtol(SCIP_SET *set)
int SCIPsetGetNParams(SCIP_SET *set)
SCIP_CONFLICTHDLR * SCIPsetFindConflicthdlr(SCIP_SET *set, const char *name)
SCIP_RETCODE SCIPsetChgRealParam(SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, SCIP_PARAM *param, SCIP_Real value)
SCIP_Bool SCIPdispIsInitialized(SCIP_DISP *disp)
#define SCIP_DEFAULT_MISC_TRANSSOLSORIG
SCIP_Bool SCIPsetExistsDialog(SCIP_SET *set, SCIP_DIALOG *dialog)
SCIP_RETCODE SCIPparamsetGetLongint(SCIP_PARAMSET *paramset, const char *name, SCIP_Longint *value)
SCIP_RETCODE SCIPparamsetCreate(SCIP_PARAMSET **paramset, BMS_BLKMEM *blkmem)
SCIP_Bool SCIPsetIsSumRelLT(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)
SCIP_Real SCIPsetFeasCeil(SCIP_SET *set, SCIP_Real val)
void SCIPsetSetLimitChanged(SCIP_SET *set)
#define SCIP_DEFAULT_LP_ROWAGELIMIT
#define SCIP_DEFAULT_LP_RESOLVEALGORITHM
#define SCIP_DEFAULT_RANDOM_PERMUTEVARS
#define SCIP_DEFAULT_LP_COLAGELIMIT
SCIP_Bool SCIPsetIsRelLE(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)
SCIP_RETCODE SCIPsetChgLongintParam(SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, SCIP_PARAM *param, SCIP_Longint value)
SCIP_RETCODE SCIPparamsetSetEmphasis(SCIP_PARAMSET *paramset, SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, SCIP_PARAMEMPHASIS paramemphasis, SCIP_Bool quiet)
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)
#define SCIP_DEFAULT_REOPT_OBJSIMSOL
SCIP_Real SCIPsetDualfeasCeil(SCIP_SET *set, SCIP_Real val)
SCIP_RETCODE SCIPnodeselFree(SCIP_NODESEL **nodesel, SCIP_SET *set)
SCIP_Bool SCIPsetIsDualfeasFracIntegral(SCIP_SET *set, SCIP_Real val)
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_Bool SCIPsetIsDualfeasGT(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)
void SCIPpropEnableOrDisableClocks(SCIP_PROP *prop, SCIP_Bool enable)
SCIP_Real SCIPsetFrac(SCIP_SET *set, SCIP_Real val)
SCIP_RETCODE SCIPsetIncludePricer(SCIP_SET *set, SCIP_PRICER *pricer)
SCIP_SEPA * SCIPsetFindSepa(SCIP_SET *set, const char *name)
#define SCIP_DEFAULT_REOPT_MAXCUTAGE
SCIP_RETCODE SCIPchgDualfeastol(SCIP *scip, SCIP_Real dualfeastol)
SCIP_Bool SCIPsetIsRelGT(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)
#define SCIP_DEFAULT_SEPA_MAXINCROUNDS
#define SCIP_DEFAULT_PRINTZEROS
internal methods for node selectors and node priority queues
#define SCIP_DEFAULT_BRANCH_SCOREFAC
internal methods for variable pricers
const char * SCIPrelaxGetName(SCIP_RELAX *relax)
SCIP_RETCODE SCIPconflicthdlrFree(SCIP_CONFLICTHDLR **conflicthdlr, SCIP_SET *set)
#define SCIP_DEFAULT_REOPT_SAVESOLS
void SCIPsetSortProps(SCIP_SET *set)
void SCIPsortPtr(void **ptrarray, SCIP_DECL_SORTPTRCOMP((*ptrcomp)), int len)
internal methods for global SCIP settings
#define SCIP_DEFAULT_TIME_CLOCKTYPE
SCIP_RETCODE SCIPsetSetReoptimizationParams(SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr)
SCIP_RETCODE SCIPrelaxCopyInclude(SCIP_RELAX *relax, SCIP_SET *set)
SCIP main data structure.
#define SCIP_DEFAULT_READ_DYNAMICCONSS
SCIP_Bool SCIPsetIsFeasGE(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)
#define SCIP_DEFAULT_FEASTOL
#define SCIP_DEFAULT_REOPT_SOLVELP
SCIP_RETCODE SCIPparamsetSetHeuristics(SCIP_PARAMSET *paramset, SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, SCIP_PARAMSETTING paramsetting, SCIP_Bool quiet)
#define SCIP_DEFAULT_LP_FREESOLVALBUFFERS
SCIP_RETCODE SCIPconcsolverDestroyInstance(SCIP_SET *set, SCIP_CONCSOLVER **concsolver)
SCIP_RETCODE SCIPsetSetLpfeastol(SCIP_SET *set, SCIP_Real lpfeastol, SCIP_Bool printnewvalue)
SCIP_RETCODE SCIPeventhdlrInitsol(SCIP_EVENTHDLR *eventhdlr, SCIP_SET *set)
SCIP_RETCODE SCIPsetSetPresolving(SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, SCIP_PARAMSETTING paramsetting, SCIP_Bool quiet)
SCIP_Bool SCIPsetIsLbBetter(SCIP_SET *set, SCIP_Real newlb, SCIP_Real oldlb, SCIP_Real oldub)
#define SCIP_DEFAULT_PSEUDOCOSTEPS
void SCIPmarkLimitChanged(SCIP *scip)
BMS_BUFMEM * SCIPcleanbuffer(SCIP *scip)
void SCIPverbMessage(SCIP *scip, SCIP_VERBLEVEL msgverblevel, FILE *file, const char *formatstr,...)
int SCIPsetCalcTreeGrowSize(SCIP_SET *set, int num)
#define SCIP_DEFAULT_CONF_USESB
internal methods for relaxators
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)
SCIP_RETCODE SCIPparamSetLongint(SCIP_PARAM *param, SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, SCIP_Longint value, SCIP_Bool initialize, SCIP_Bool quiet)
SCIP_Bool SCIPsetIsEQ(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)
SCIP_RETCODE SCIPnodeselInit(SCIP_NODESEL *nodesel, SCIP_SET *set)
int SCIPparamsetGetNParams(SCIP_PARAMSET *paramset)
SCIP_Bool SCIPsetIsHugeValue(SCIP_SET *set, SCIP_Real val)
SCIP_RETCODE SCIPcomprExit(SCIP_COMPR *compr, SCIP_SET *set)
#define SCIP_DEFAULT_LP_CLEANUPCOLSROOT
#define SCIP_DEFAULT_LP_CLEANUPROWSROOT
#define SCIP_DEFAULT_SEPA_MINEFFICACYROOT
void SCIPsetSortPropsPresol(SCIP_SET *set)
#define SCIP_DEFAULT_REOPT_USEPSCOST
SCIP_Bool SCIPsetIsFeasLE(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)
void SCIPsetSortPresolsName(SCIP_SET *set)
#define BMSduplicateMemoryArray(ptr, source, num)
SCIP_Bool SCIPconshdlrNeedsCons(SCIP_CONSHDLR *conshdlr)
#define SCIP_DEFAULT_MISC_PRINTREASON
SCIP_READER * SCIPsetFindReader(SCIP_SET *set, const char *name)
void SCIPsetSortRelaxs(SCIP_SET *set)
#define SCIP_DEFAULT_TIME_STATISTICTIMING
SCIP_BRANCHRULE ** branchrules
#define SCIP_DEFAULT_LP_CLEANUPROWS
SCIP_RETCODE SCIPconflicthdlrInit(SCIP_CONFLICTHDLR *conflicthdlr, SCIP_SET *set)
#define SCIP_DEFAULT_CONF_ENABLE
#define SCIP_DEFAULT_LIMIT_MAXORIGSOL
SCIP_RETCODE SCIPsetSetLongintParam(SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, const char *name, SCIP_Longint value)
#define SCIP_DEFAULT_SEPA_MAXBOUNDDIST
SCIP_COMPR * SCIPsetFindCompr(SCIP_SET *set, const char *name)
SCIP_RETCODE SCIPsetIncludeProp(SCIP_SET *set, SCIP_PROP *prop)
SCIP_RETCODE SCIPactivatePricer(SCIP *scip, SCIP_PRICER *pricer)
#define SCIP_DEFAULT_LIMIT_RESTARTS
#define SCIP_DEFAULT_DISP_ALLVIOLS
SCIP_Bool SCIPsetIsIntegral(SCIP_SET *set, SCIP_Real val)
#define SCIP_DEFAULT_HUGEVAL
#define SCIP_DEFAULT_PRICE_DELVARS
SCIP_RETCODE SCIPsetSetHeuristics(SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, SCIP_PARAMSETTING paramsetting, SCIP_Bool quiet)
SCIP_RETCODE SCIPincludeNlpi(SCIP *scip, SCIP_NLPI *nlpi)
int SCIPdispGetPosition(SCIP_DISP *disp)
internal methods for user interface dialog
#define SCIP_DEFAULT_CONCURRENT_FREQMAX
#define SCIP_DEFAULT_MEM_PATHGROWFAC
SCIP_Real SCIPsetSumepsilon(SCIP_SET *set)
void SCIPsetSortSepasName(SCIP_SET *set)
#define SCIP_DEFAULT_LIMIT_MAXSOL
SCIP_RETCODE SCIPsetIncludeTable(SCIP_SET *set, SCIP_TABLE *table)
SCIP_RETCODE SCIPsetSetBarrierconvtol(SCIP_SET *set, SCIP_Real barrierconvtol)
SCIP_NODESEL * SCIPsetFindNodesel(SCIP_SET *set, const char *name)
SCIP_RETCODE SCIPparamsetSetInt(SCIP_PARAMSET *paramset, SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, const char *name, int value)
SCIP_RETCODE SCIPtableExitsol(SCIP_TABLE *table, SCIP_SET *set)
int SCIPsetCalcPathGrowSize(SCIP_SET *set, int num)
#define SCIP_DEFAULT_PRICE_DELVARSROOT
#define SCIP_DEFAULT_REOPT_OBJSIMDELAY
SCIP_RETCODE SCIPrelaxInitsol(SCIP_RELAX *relax, SCIP_SET *set)
SCIP_RETCODE SCIPnlpiCopy(BMS_BLKMEM *blkmem, SCIP_NLPI *sourcenlpi, SCIP_NLPI **targetnlpi)
SCIP_Real SCIPlpiInfinity(SCIP_LPI *lpi)
SCIP_RETCODE SCIPautoselectDisps(SCIP *scip)
#define SCIP_DEFAULT_CONF_REMOVEABLE
#define SCIP_DEFAULT_PRESOL_IMMRESTARTFAC
#define SCIP_DEFAULT_CONF_DEPTHSCOREFAC
SCIP_RETCODE SCIPparamsetGetReal(SCIP_PARAMSET *paramset, const char *name, SCIP_Real *value)
void BMSsetBufferMemoryArraygrowfac(BMS_BUFMEM *buffer, double arraygrowfac)
#define SCIP_DEFAULT_MISC_TRANSORIGSOLS
internal methods for input file readers
#define SCIP_DEFAULT_BOUNDSTREPS
SCIP_RETCODE SCIPsetGetIntParam(SCIP_SET *set, const char *name, int *value)
SCIP_RETCODE SCIPheurInit(SCIP_HEUR *heur, SCIP_SET *set)
SCIP_RETCODE SCIPsetIncludeExternalCode(SCIP_SET *set, const char *name, const char *description)
SCIP_RETCODE SCIPpricerExitsol(SCIP_PRICER *pricer, SCIP_SET *set)
void SCIPsetSortNlpis(SCIP_SET *set)
#define SCIP_DEFAULT_LP_SOLVEFREQ
SCIP_RETCODE SCIPparamsetSetDefaultBool(SCIP_PARAMSET *paramset, const char *name, SCIP_Bool defaultvalue)
SCIP_RETCODE SCIPsetCopyParams(SCIP_SET *sourceset, SCIP_SET *targetset, SCIP_MESSAGEHDLR *messagehdlr)
SCIP_RETCODE SCIPparamsetGetString(SCIP_PARAMSET *paramset, const char *name, char **value)
SCIP_Real SCIPsetDualfeasFrac(SCIP_SET *set, SCIP_Real val)
void SCIPbranchruleEnableOrDisableClocks(SCIP_BRANCHRULE *branchrule, SCIP_Bool enable)
SCIP_RETCODE SCIPparamsetSetBool(SCIP_PARAMSET *paramset, SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, const char *name, SCIP_Bool value)
#define SCIP_DEFAULT_DISP_VERBLEVEL
const char * SCIPpresolGetName(SCIP_PRESOL *presol)
SCIP_Bool SCIPsetIsRelLT(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)
#define SCIP_DEFAULT_LP_LEXDUALSTALLING
SCIP_RETCODE SCIPparamsetCopyParams(SCIP_PARAMSET *sourceparamset, SCIP_PARAMSET *targetparamset, SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr)
const char * SCIPnodeselGetName(SCIP_NODESEL *nodesel)
SCIP_Real SCIPsetDualfeasRound(SCIP_SET *set, SCIP_Real val)
void SCIPsetDebugMessagePrint(SCIP_SET *set, const char *formatstr,...)
#define SCIP_DEFAULT_BRANCH_LPGAINNORMALIZE
#define SCIP_DEFAULT_CONCURRENT_MAXNSOLS
#define SCIP_DEFAULT_SEPA_MINORTHOROOT
#define SCIP_DEFAULT_MEM_ARRAYGROWFAC
SCIP_RETCODE SCIPparamsetSetPresolving(SCIP_PARAMSET *paramset, SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, SCIP_PARAMSETTING paramsetting, SCIP_Bool quiet)
SCIP_RETCODE SCIPtableCopyInclude(SCIP_TABLE *table, SCIP_SET *set)
#define SCIP_DEFAULT_CONF_USEPSEUDO
#define SCIP_DEFAULT_CONF_WEIGHTREPROPDEPTH
void SCIPheurEnableOrDisableClocks(SCIP_HEUR *heur, SCIP_Bool enable)
void SCIPrelaxEnableOrDisableClocks(SCIP_RELAX *relax, SCIP_Bool enable)
#define SCIP_DEFAULT_PRESOL_SUBRESTARTFAC
SCIP_RETCODE SCIPsetSetDefaultBoolParam(SCIP_SET *set, const char *name, SCIP_Bool defaultvalue)
#define SCIP_DEFAULT_CONF_MINMAXVARS
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_RETCODE SCIPsetSetCharParam(SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, const char *name, char value)
SCIP_Bool SCIPsetIsSumNegative(SCIP_SET *set, SCIP_Real val)
SCIP_HEUR * SCIPsetFindHeur(SCIP_SET *set, const char *name)
#define SCIP_DEFAULT_CONF_WEIGHTSIZE
#define SCIP_DEFAULT_LIMIT_MEMORY
SCIP_RETCODE SCIPchgFeastol(SCIP *scip, SCIP_Real feastol)
#define SCIP_DEFAULT_LP_RESOLVERESTORE
SCIP_DISP * SCIPsetFindDisp(SCIP_SET *set, const char *name)
SCIP_Bool SCIPparamGetBool(SCIP_PARAM *param)
#define SCIP_DEFAULT_LP_LEXDUALBASIC
#define SCIP_DEFAULT_HISTORY_VALUEBASED
SCIP_RETCODE SCIPsetIncludeNodesel(SCIP_SET *set, SCIP_NODESEL *nodesel)
SCIP_RETCODE SCIPpropInitpre(SCIP_PROP *prop, SCIP_SET *set)
SCIP_Bool SCIPsetIsFeasLT(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)
#define SCIP_DEFAULT_REOPT_SOLVELPDIFF
SCIP_RETCODE SCIPchgLpfeastol(SCIP *scip, SCIP_Real lpfeastol, SCIP_Bool printnewvalue)
int SCIPconshdlrGetEnfoPriority(SCIP_CONSHDLR *conshdlr)
SCIP_Bool SCIPconshdlrIsInitialized(SCIP_CONSHDLR *conshdlr)
SCIP_Bool SCIPsetIsSumEQ(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)
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)
#define SCIP_DEFAULT_LP_ITERLIM
#define SCIP_DEFAULT_CONCURRENT_INITSEED
SCIP_RETCODE SCIPsetGetCharParam(SCIP_SET *set, const char *name, char *value)
#define SCIP_MAXTREEDEPTH
SCIP_Real SCIPsetGetReferencevalue(SCIP_SET *set)
#define SCIP_DEFAULT_REOPT_SHRINKINNER
void SCIPsetEnableOrDisablePluginClocks(SCIP_SET *set, SCIP_Bool enabled)
SCIP_PARAM * SCIPsetGetParam(SCIP_SET *set, const char *name)
const char * SCIPpropGetName(SCIP_PROP *prop)
SCIP_Real SCIPsetFeasFrac(SCIP_SET *set, SCIP_Real val)
enum SCIP_ParamEmphasis SCIP_PARAMEMPHASIS
SCIP_Bool SCIPsetIsDualfeasPositive(SCIP_SET *set, SCIP_Real val)
#define SCIP_DEFAULT_SEPA_CUTSELRESTART
int SCIPparamGetInt(SCIP_PARAM *param)
SCIP_RETCODE SCIPsetGetRealParam(SCIP_SET *set, const char *name, SCIP_Real *value)
SCIP_RETCODE SCIPconshdlrExitpre(SCIP_CONSHDLR *conshdlr, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat)
SCIP_RETCODE SCIPparamsetSetString(SCIP_PARAMSET *paramset, SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, const char *name, const char *value)
#define SCIP_DEFAULT_SEPA_MAXSTALLROUNDS
#define SCIP_DEFAULT_CONS_OBSOLETEAGE
#define SCIP_DEFAULT_LP_FASTMIP
SCIP_Bool SCIPsetIsSumPositive(SCIP_SET *set, SCIP_Real val)
SCIP_Real SCIPsetFeasFloor(SCIP_SET *set, SCIP_Real val)
#define SCIP_DEFAULT_CONF_USEPROP
#define SCIP_DEFAULT_CONF_PREFINFPROOF
const char * SCIPcomprGetName(SCIP_COMPR *compr)
int SCIPconcsolverGetIdx(SCIP_CONCSOLVER *concsolver)
#define SCIP_DEFAULT_BRANCH_CHECKSBSOL
void SCIPsetSortBranchrules(SCIP_SET *set)
#define SCIP_DEFAULT_CONF_FUIPLEVELS
#define SCIP_DEFAULT_INFINITY
#define SCIP_DEFAULT_SEPA_EFFICACYNORM
#define SCIP_DEFAULT_RANDOM_RANDSEEDSHIFT
#define SCIP_DEFAULT_MEM_PATHGROWINIT
#define SCIP_DEFAULT_LP_RESOLVEITERFAC
SCIP_RETCODE SCIPdialogCopyInclude(SCIP_DIALOG *dialog, SCIP_SET *set)
#define SCIP_DEFAULT_DUALFEASTOL
#define SCIP_DEFAULT_PARALLEL_MINNTHREADS
internal methods for conflict analysis
void SCIPsetSortPresols(SCIP_SET *set)
SCIP_RETCODE SCIPsepaExit(SCIP_SEPA *sepa, SCIP_SET *set)
internal methods for tree compressions
void SCIPsetSortRelaxsName(SCIP_SET *set)
SCIP_RETCODE SCIPsetResetParam(SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, const char *name)
void SCIPmessageVFPrintInfo(SCIP_MESSAGEHDLR *messagehdlr, FILE *file, const char *formatstr, va_list ap)
#define SCIP_DEFAULT_DISP_HEADERFREQ
SCIP_RETCODE SCIPsetChgParamFixed(SCIP_SET *set, const char *name, SCIP_Bool fixed)
void SCIPsetSortConflicthdlrs(SCIP_SET *set)
#define SCIP_DEFAULT_PARALLEL_MODE
#define SCIP_DEFAULT_LP_CONDITIONLIMIT
#define SCIP_DEFAULT_CONS_DISABLEENFOPS
#define SCIP_DEFAULT_MISC_USECONSTABLE
#define SCIP_DEFAULT_LPFEASTOL
#define SCIP_DEFAULT_SEPA_MAXCUTS
SCIP_RETCODE SCIPsetIncludeBranchrule(SCIP_SET *set, SCIP_BRANCHRULE *branchrule)
#define SCIP_DEFAULT_WRITE_ALLCONSS
#define SCIP_DEFAULT_RANDOM_PERMUTATIONSEED
#define SCIP_DEFAULT_READ_DYNAMICROWS
SCIP_RETCODE SCIPbranchruleInit(SCIP_BRANCHRULE *branchrule, SCIP_SET *set)
SCIP_RETCODE SCIPbranchruleCopyInclude(SCIP_BRANCHRULE *branchrule, SCIP_SET *set)
#define SCIP_DEFAULT_CONF_RESTARTFAC
SCIP_Real SCIPsetSumCeil(SCIP_SET *set, SCIP_Real val)
#define SCIP_DEFAULT_CONCURRENT_PARAMSETPREFIX
SCIP_RETCODE SCIPtableExit(SCIP_TABLE *table, SCIP_SET *set)
SCIP_RETCODE SCIPpresolCopyInclude(SCIP_PRESOL *presol, SCIP_SET *set)
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_Real SCIPsetSumRound(SCIP_SET *set, SCIP_Real val)
const char * SCIPconflicthdlrGetName(SCIP_CONFLICTHDLR *conflicthdlr)
#define SCIP_DEFAULT_SUMEPSILON
SCIP_RETCODE SCIPheurExit(SCIP_HEUR *heur, SCIP_SET *set)
#define SCIP_DEFAULT_LP_DISABLECUTOFF
#define SCIP_DEFAULT_BARRIERCONVTOL
#define SCIP_DEFAULT_LIMIT_GAP
#define SCIP_DEFAULT_SEPA_POOLFREQ
SCIP_Bool SCIPsetIsSumRelLE(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)
SCIP_RETCODE SCIPeventhdlrExitsol(SCIP_EVENTHDLR *eventhdlr, SCIP_SET *set)
SCIP_Bool SCIPrelaxIsInitialized(SCIP_RELAX *relax)
void SCIPnlpiSetPriority(SCIP_NLPI *nlpi, int priority)
#define SCIP_DEFAULT_REOPT_SEPAGLBINFSUBTREES
void SCIPmessageFPrintInfo(SCIP_MESSAGEHDLR *messagehdlr, FILE *file, const char *formatstr,...)
#define SCIP_DEFAULT_SEPA_MAXCUTSROOT
#define SCIP_DEFAULT_READ_INITIALCONSS
SCIP_Bool SCIPsetIsGT(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)
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)
SCIP_MESSAGEHDLR * messagehdlr
#define SCIP_DEFAULT_CONF_DYNAMIC
#define SCIP_DEFAULT_NODESEL_CHILDSEL
internal methods for problem statistics
const char * SCIPbranchruleGetName(SCIP_BRANCHRULE *branchrule)
SCIP_RETCODE SCIPbranchruleFree(SCIP_BRANCHRULE **branchrule, SCIP_SET *set)
SCIP_RETCODE SCIPsetIncludeReader(SCIP_SET *set, SCIP_READER *reader)
SCIP_RETCODE SCIPconshdlrExitsol(SCIP_CONSHDLR *conshdlr, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_Bool restart)
enum SCIP_Stage SCIP_STAGE
SCIP_BRANCHRULE * SCIPsetFindBranchrule(SCIP_SET *set, const char *name)
#define SCIP_DEFAULT_REOPT_FORCEHEURRESTART
SCIP_Bool SCIPsetIsFeasPositive(SCIP_SET *set, SCIP_Real val)
#define SCIP_DEFAULT_CONF_MAXVARSDETECTIMPLIEDBOUNDS
SCIP_DEBUGSOLDATA * SCIPsetGetDebugSolData(SCIP_SET *set)
SCIP_Real SCIPsetDualfeastol(SCIP_SET *set)
void SCIPsetSortPricers(SCIP_SET *set)
void SCIPparamsetFree(SCIP_PARAMSET **paramset, BMS_BLKMEM *blkmem)
#define SCIP_DEFAULT_SEPA_OBJPARALFAC
SCIP_RETCODE SCIPsetFreeConcsolvers(SCIP_SET *set)
#define SCIP_DEFAULT_CONF_CONFLITWEIGHT
SCIP_RETCODE SCIPparamsetRead(SCIP_PARAMSET *paramset, SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, const char *filename)
#define BMSallocMemory(ptr)
#define BMSreallocMemoryArray(ptr, num)
#define SCIP_DEFAULT_CONF_PREFERBINARY
SCIP_RETCODE SCIPparamsetSetLongint(SCIP_PARAMSET *paramset, SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, const char *name, SCIP_Longint value)
internal methods for constraints and constraint handlers
SCIP_RETCODE SCIPparamsetSetChar(SCIP_PARAMSET *paramset, SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, const char *name, char value)
SCIP_RETCODE SCIPpresolExitpre(SCIP_PRESOL *presol, SCIP_SET *set)
SCIP_RETCODE SCIPsetSetDefaultIntParam(SCIP_SET *set, const char *name, int defaultvalue)
SCIP_RETCODE SCIPsetSetDualfeastol(SCIP_SET *set, SCIP_Real dualfeastol)
SCIP_Bool SCIPsetIsDualfeasZero(SCIP_SET *set, SCIP_Real val)
void SCIPconflicthdlrEnableOrDisableClocks(SCIP_CONFLICTHDLR *conflicthdlr, SCIP_Bool enable)
SCIP_Bool SCIPsetIsFeasGT(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)
#define SCIP_DEFAULT_SEPA_INTSUPPORTFAC
SCIP_Bool SCIPparamsetIsFixed(SCIP_PARAMSET *paramset, const char *name)
SCIP_RETCODE SCIPsetChgStringParam(SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, SCIP_PARAM *param, const char *value)
SCIP_RETCODE SCIPsetGetLongintParam(SCIP_SET *set, const char *name, SCIP_Longint *value)
int SCIPsetInitializeRandomSeed(SCIP_SET *set, int initialseedvalue)
SCIP_Real SCIPsetRecompfac(SCIP_SET *set)
SCIP_RETCODE SCIPsetSetVerbLevel(SCIP_SET *set, SCIP_VERBLEVEL verblevel)
#define SCIP_DEFAULT_PRICE_MAXVARSROOT
SCIP_RETCODE SCIPparamsetGetChar(SCIP_PARAMSET *paramset, const char *name, char *value)
SCIP_RETCODE SCIPsetChgCharParam(SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, SCIP_PARAM *param, char value)
SCIP_Real SCIPsetEpsilon(SCIP_SET *set)
SCIP_STAGE SCIPsetGetStage(SCIP_SET *set)
#define SCIP_DEFAULT_MISC_USESYMMETRY
SCIP_PARAM ** SCIPparamsetGetParams(SCIP_PARAMSET *paramset)
#define SCIP_DEFAULT_CONF_SCOREFAC
#define SCIP_DEFAULT_BRANCH_PREFERBINARY
SCIP_Bool SCIPsetIsUbBetter(SCIP_SET *set, SCIP_Real newub, SCIP_Real oldlb, SCIP_Real oldub)
SCIP_Bool SCIPsepaIsInitialized(SCIP_SEPA *sepa)
SCIP_Bool SCIPsetIsDualfeasNegative(SCIP_SET *set, SCIP_Real val)
#define SCIP_DEFAULT_LP_CHECKSTABILITY
SCIP_Real SCIPsetSumFrac(SCIP_SET *set, SCIP_Real val)
SCIP_Bool SCIPheurIsInitialized(SCIP_HEUR *heur)
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 SCIPparamSetReal(SCIP_PARAM *param, SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, SCIP_Real value, SCIP_Bool initialize, SCIP_Bool quiet)
common defines and data types used in all packages of SCIP
#define SCIP_DEFAULT_VISUAL_VBCFILENAME
struct BMS_BlkMem BMS_BLKMEM
SCIP_RETCODE SCIPconshdlrFree(SCIP_CONSHDLR **conshdlr, 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_RETCODE SCIPsetExitPlugins(SCIP_SET *set, BMS_BLKMEM *blkmem, SCIP_STAT *stat)
#define SCIP_DEFAULT_VISUAL_DISPSOLS
internal methods for primal heuristics
#define SCIP_DEFAULT_LP_CHECKDUALFEAS
SCIP_RETCODE SCIPsetGetBoolParam(SCIP_SET *set, const char *name, SCIP_Bool *value)
SCIP_RETCODE SCIPconflicthdlrCopyInclude(SCIP_CONFLICTHDLR *conflicthdlr, SCIP_SET *set)
SCIP_RETCODE SCIPheurExitsol(SCIP_HEUR *heur, SCIP_SET *set)
#define SCIP_DEFAULT_SEPA_MAXROUNDSROOT
SCIP_RETCODE SCIPsetExitprePlugins(SCIP_SET *set, BMS_BLKMEM *blkmem, SCIP_STAT *stat)
#define SCIP_DEFAULT_CONF_RECONVLEVELS
#define SCIP_DEFAULT_CONF_ALLOWLOCAL
#define SCIP_DEFAULT_LP_CHECKPRIMFEAS
SCIP_RETCODE SCIPsepaExitsol(SCIP_SEPA *sepa, SCIP_SET *set)
#define SCIP_DEFAULT_CONF_SEPAALTPROOFS
SCIP_Bool SCIPsetIsRelGE(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)
const char * SCIPdispGetName(SCIP_DISP *disp)
int SCIPnodeselGetStdPriority(SCIP_NODESEL *nodesel)
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)
SCIP_Bool SCIPsetIsDualfeasLT(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)
SCIP_RETCODE SCIPsetIncludeConflicthdlr(SCIP_SET *set, SCIP_CONFLICTHDLR *conflicthdlr)
void SCIPsetSortSepas(SCIP_SET *set)
SCIP_RETCODE SCIPsetSetBoolParam(SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, const char *name, SCIP_Bool value)
SCIP_Bool SCIPsetIsFracIntegral(SCIP_SET *set, SCIP_Real val)
#define SCIP_DEFAULT_NLP_DISABLE
#define SCIP_DEFAULT_CONCURRENT_CHANGECHILDSEL
#define SCIP_DEFAULT_MEM_ARRAYGROWINIT
#define SCIP_DEFAULT_PARALLEL_MAXNTHREADS
#define SCIP_DEFAULT_CONCURRENT_FREQINIT
#define SCIP_DEFAULT_LP_REFACTORINTERVAL
SCIP_RETCODE SCIPpresolInitpre(SCIP_PRESOL *presol, SCIP_SET *set)
SCIP_RETCODE SCIPsetIncludeDisp(SCIP_SET *set, SCIP_DISP *disp)
SCIP_Bool SCIPnodeselIsInitialized(SCIP_NODESEL *nodesel)
#define SCIP_DEFAULT_SEPA_MAXADDROUNDS
#define SCIP_DEFAULT_HISTORY_ALLOWMERGE
SCIP_CONCSOLVERTYPE * SCIPsetFindConcsolverType(SCIP_SET *set, const char *name)
SCIP_RETCODE SCIPpropExit(SCIP_PROP *prop, SCIP_SET *set)
SCIP_RETCODE SCIPenableReoptimization(SCIP *scip, SCIP_Bool enable)
SCIP_RETCODE SCIPpropFree(SCIP_PROP **prop, SCIP_SET *set)
SCIP_EVENTHDLR ** eventhdlrs
#define SCIP_DEFAULT_BRANCH_SUMADJUSTSCORE
SCIP_Bool SCIPsetIsFeasNegative(SCIP_SET *set, SCIP_Real val)
SCIP_RETCODE SCIPpropExitsol(SCIP_PROP *prop, SCIP_SET *set, SCIP_Bool restart)
SCIP_RETCODE SCIPeventhdlrInit(SCIP_EVENTHDLR *eventhdlr, SCIP_SET *set)
#define SCIP_DEFAULT_PSEUDOCOSTDELTA
void SCIPsetSortBranchrulesName(SCIP_SET *set)
#define SCIP_DEFAULT_BRANCH_DIVINGPSCOST
#define SCIP_DEFAULT_PROP_MAXROUNDS
char * SCIPconcsolverTypeGetName(SCIP_CONCSOLVERTYPE *concsolvertype)
SCIP_RETCODE SCIPrelaxExitsol(SCIP_RELAX *relax, SCIP_SET *set)
int SCIPsetGetPriceMaxvars(SCIP_SET *set, SCIP_Bool root)
SCIP_RETCODE SCIPparamsetSet(SCIP_PARAMSET *paramset, SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, const char *name, void *value)
internal methods for displaying runtime statistics
void SCIPsetSortPricersName(SCIP_SET *set)