64 #define SCIP_DEFAULT_BRANCH_SCOREFUNC 'p' 65 #define SCIP_DEFAULT_BRANCH_SCOREFAC 0.167 67 #define SCIP_DEFAULT_BRANCH_PREFERBINARY FALSE 68 #define SCIP_DEFAULT_BRANCH_CLAMP 0.2 70 #define SCIP_DEFAULT_BRANCH_LPGAINNORMALIZE 's' 71 #define SCIP_DEFAULT_BRANCH_DELAYPSCOST TRUE 72 #define SCIP_DEFAULT_BRANCH_DIVINGPSCOST TRUE 73 #define SCIP_DEFAULT_BRANCH_FORCEALL FALSE 75 #define SCIP_DEFAULT_BRANCH_FIRSTSBCHILD 'a' 76 #define SCIP_DEFAULT_BRANCH_CHECKSBSOL TRUE 77 #define SCIP_DEFAULT_BRANCH_ROUNDSBSOL TRUE 78 #define SCIP_DEFAULT_BRANCH_SUMADJUSTSCORE FALSE 82 #define SCIP_DEFAULT_COMPR_ENABLE FALSE 87 #define SCIP_DEFAULT_CONF_ENABLE TRUE 88 #define SCIP_DEFAULT_CONF_MAXVARSFAC 0.10 89 #define SCIP_DEFAULT_CONF_MINMAXVARS 30 90 #define SCIP_DEFAULT_CONF_MAXLPLOOPS 2 92 #define SCIP_DEFAULT_CONF_LPITERATIONS 10 94 #define SCIP_DEFAULT_CONF_USEPROP TRUE 95 #define SCIP_DEFAULT_CONF_USEINFLP 'b' 98 #define SCIP_DEFAULT_CONF_USEBOUNDLP 'o' 101 #define SCIP_DEFAULT_CONF_USESB FALSE 103 #define SCIP_DEFAULT_CONF_USEPSEUDO TRUE 104 #define SCIP_DEFAULT_CONF_SEPARATE TRUE 105 #define SCIP_DEFAULT_CONF_DYNAMIC TRUE 110 #define SCIP_DEFAULT_CONF_MAXSTORESIZE 10000 111 #define SCIP_DEFAULT_CONF_RECONVLEVELS -1 113 #define SCIP_DEFAULT_CONF_CLEANBNDDEPEND TRUE 114 #define SCIP_DEFAULT_CONF_FUIPLEVELS -1 116 #define SCIP_DEFAULT_CONF_INTERCONSS -1 118 #define SCIP_DEFAULT_CONF_MAXCONSS 10 120 #define SCIP_DEFAULT_CONF_PREFERBINARY FALSE 121 #define SCIP_DEFAULT_CONF_ALLOWLOCAL TRUE 122 #define SCIP_DEFAULT_CONF_SETTLELOCAL FALSE 124 #define SCIP_DEFAULT_CONF_REPROPAGATE TRUE 126 #define SCIP_DEFAULT_CONF_KEEPREPROP TRUE 127 #define SCIP_DEFAULT_CONF_REMOVEABLE TRUE 128 #define SCIP_DEFAULT_CONF_DEPTHSCOREFAC 1.0 129 #define SCIP_DEFAULT_CONF_PROOFSCOREFAC 1.0 130 #define SCIP_DEFAULT_CONF_UPLOCKSCOREFAC 0.0 131 #define SCIP_DEFAULT_CONF_DOWNLOCKSCOREFAC 0.0 132 #define SCIP_DEFAULT_CONF_SCOREFAC 0.98 133 #define SCIP_DEFAULT_CONF_RESTARTNUM 0 135 #define SCIP_DEFAULT_CONF_RESTARTFAC 1.5 136 #define SCIP_DEFAULT_CONF_IGNORERELAXEDBD FALSE 137 #define SCIP_DEFAULT_CONF_MAXVARSDETECTIMPLIEDBOUNDS 250 138 #define SCIP_DEFAULT_CONF_FULLSHORTENCONFLICT TRUE 139 #define SCIP_DEFAULT_CONF_CONFLITWEIGHT 0.0 140 #define SCIP_DEFAULT_CONF_CONFLITGRAPHWEIGHT 1.0 141 #define SCIP_DEFAULT_CONF_WEIGHTSIZE 0.001 142 #define SCIP_DEFAULT_CONF_WEIGHTREPROPDEPTH 0.1 143 #define SCIP_DEFAULT_CONF_WEIGHTVALIDDEPTH 1.0 144 #define SCIP_DEFAULT_CONF_MINIMPROVE 0.05 149 #define SCIP_DEFAULT_CONF_APPLYMIR FALSE 150 #define SCIP_DEFAULT_CONF_PREFERMIR TRUE 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 0 244 #define SCIP_DEFAULT_NLP_SOLVER "" 245 #define SCIP_DEFAULT_NLP_DISABLE FALSE 250 #define SCIP_DEFAULT_MEM_SAVEFAC 0.8 251 #define SCIP_DEFAULT_MEM_TREEGROWFAC 2.0 252 #define SCIP_DEFAULT_MEM_PATHGROWFAC 2.0 253 #define SCIP_DEFAULT_MEM_TREEGROWINIT 65536 254 #define SCIP_DEFAULT_MEM_PATHGROWINIT 256 259 #define SCIP_DEFAULT_MISC_CATCHCTRLC TRUE 260 #define SCIP_DEFAULT_MISC_USEVARTABLE TRUE 261 #define SCIP_DEFAULT_MISC_USECONSTABLE TRUE 262 #define SCIP_DEFAULT_MISC_USESMALLTABLES FALSE 263 #define SCIP_DEFAULT_MISC_EXACTSOLVE FALSE 264 #define SCIP_DEFAULT_MISC_RESETSTAT TRUE 269 #define SCIP_DEFAULT_MISC_IMPROVINGSOLS FALSE 270 #define SCIP_DEFAULT_MISC_PRINTREASON TRUE 271 #define SCIP_DEFAULT_MISC_ESTIMEXTERNMEM TRUE 272 #define SCIP_DEFAULT_MISC_TRANSORIGSOLS TRUE 273 #define SCIP_DEFAULT_MISC_TRANSSOLSORIG TRUE 274 #define SCIP_DEFAULT_MISC_CALCINTEGRAL TRUE 275 #define SCIP_DEFAULT_MISC_FINITESOLSTORE FALSE 276 #define SCIP_DEFAULT_MISC_OUTPUTORIGSOL TRUE 277 #define SCIP_DEFAULT_MISC_ALLOWDUALREDS TRUE 278 #define SCIP_DEFAULT_MISC_ALLOWOBJPROP TRUE 279 #define SCIP_DEFAULT_MISC_REFERENCEVALUE 1e99 282 #define SCIP_DEFAULT_RANDOM_RANDSEEDSHIFT 0 283 #define SCIP_DEFAULT_RANDOM_PERMUTATIONSEED 0 284 #define SCIP_DEFAULT_RANDOM_LPSEED 0 285 #define SCIP_DEFAULT_RANDOM_PERMUTECONSS TRUE 286 #define SCIP_DEFAULT_RANDOM_PERMUTEVARS FALSE 291 #define SCIP_DEFAULT_NODESEL_CHILDSEL 'h' 297 #define SCIP_DEFAULT_PRESOL_ABORTFAC 8e-04 299 #define SCIP_DEFAULT_PRESOL_MAXROUNDS -1 300 #define SCIP_DEFAULT_PRESOL_MAXRESTARTS -1 301 #define SCIP_DEFAULT_PRESOL_RESTARTFAC 0.025 303 #define SCIP_DEFAULT_PRESOL_IMMRESTARTFAC 0.10 305 #define SCIP_DEFAULT_PRESOL_SUBRESTARTFAC 1.00 307 #define SCIP_DEFAULT_PRESOL_RESTARTMINRED 0.10 309 #define SCIP_DEFAULT_PRESOL_DONOTMULTAGGR FALSE 310 #define SCIP_DEFAULT_PRESOL_DONOTAGGR FALSE 315 #define SCIP_DEFAULT_PRICE_ABORTFAC 2.0 317 #define SCIP_DEFAULT_PRICE_MAXVARS 100 318 #define SCIP_DEFAULT_PRICE_MAXVARSROOT 2000 319 #define SCIP_DEFAULT_PRICE_DELVARS FALSE 321 #define SCIP_DEFAULT_PRICE_DELVARSROOT FALSE 326 #define SCIP_DEFAULT_REOPT_OBJSIMSOL -1.0 328 #define SCIP_DEFAULT_REOPT_OBJSIMROOTLP 0.8 329 #define SCIP_DEFAULT_REOPT_OBJSIMDELAY -1.0 331 #define SCIP_DEFAULT_REOPT_VARORDERINTERDICTION 'd' 335 #define SCIP_DEFAULT_REOPT_MAXSAVEDNODES INT_MAX 336 #define SCIP_DEFAULT_REOPT_MAXDIFFOFNODES INT_MAX 338 #define SCIP_DEFAULT_REOPT_FORCEHEURRESTART 3 341 #define SCIP_DEFAULT_REOPT_SAVESOLS INT_MAX 342 #define SCIP_DEFAULT_REOPT_SOLVELP 1 343 #define SCIP_DEFAULT_REOPT_SOLVELPDIFF 1 344 #define SCIP_DEFAULT_REOPT_ENABLE FALSE 345 #define SCIP_DEFAULT_REOPT_SEPAGLBINFSUBTREES TRUE 346 #define SCIP_DEFAULT_REOPT_SEPABESTSOL FALSE 349 #define SCIP_DEFAULT_REOPT_STOREVARHISTOTY FALSE 352 #define SCIP_DEFAULT_REOPT_USEPSCOST FALSE 353 #define SCIP_DEFAULT_REOPT_COMMONTIMELIMIT FALSE 354 #define SCIP_DEFAULT_REOPT_SHRINKINNER TRUE 357 #define SCIP_DEFAULT_REOPT_STRONGBRANCHINIT TRUE 360 #define SCIP_DEFAULT_REOPT_REDUCETOFRONTIER TRUE 361 #define SCIP_DEFAULT_REOPT_SAVECONSPROP FALSE 362 #define SCIP_DEFAULT_REOPT_USESPLITCONS TRUE 365 #define SCIP_DEFAULT_REOPT_USECUTS FALSE 366 #define SCIP_DEFAULT_REOPT_MAXCUTAGE 0 370 #define SCIP_DEFAULT_PROP_MAXROUNDS 100 371 #define SCIP_DEFAULT_PROP_MAXROUNDSROOT 1000 372 #define SCIP_DEFAULT_PROP_ABORTONCUTOFF TRUE 378 #define SCIP_DEFAULT_SEPA_MAXBOUNDDIST 1.0 381 #define SCIP_DEFAULT_SEPA_MINEFFICACY 0.05 382 #define SCIP_DEFAULT_SEPA_MINEFFICACYROOT 0.001 383 #define SCIP_DEFAULT_SEPA_MINORTHO 0.50 384 #define SCIP_DEFAULT_SEPA_MINORTHOROOT 0.50 385 #define SCIP_DEFAULT_SEPA_OBJPARALFAC 0.0001 386 #define SCIP_DEFAULT_SEPA_ORTHOFAC 1.00 387 #define SCIP_DEFAULT_SEPA_ORTHOFUNC 'e' 388 #define SCIP_DEFAULT_SEPA_EFFICACYNORM 'e' 390 #define SCIP_DEFAULT_SEPA_CUTSELRESTART 'a' 391 #define SCIP_DEFAULT_SEPA_CUTSELSUBSCIP 'a' 392 #define SCIP_DEFAULT_SEPA_MAXRUNS -1 393 #define SCIP_DEFAULT_SEPA_MAXROUNDS 5 394 #define SCIP_DEFAULT_SEPA_MAXROUNDSROOT -1 395 #define SCIP_DEFAULT_SEPA_MAXROUNDSROOTSUBRUN 1 396 #define SCIP_DEFAULT_SEPA_MAXADDROUNDS 1 398 #define SCIP_DEFAULT_SEPA_MAXSTALLROUNDS 5 400 #define SCIP_DEFAULT_SEPA_MAXCUTS 100 401 #define SCIP_DEFAULT_SEPA_MAXCUTSROOT 2000 402 #define SCIP_DEFAULT_SEPA_CUTAGELIMIT 100 404 #define SCIP_DEFAULT_SEPA_POOLFREQ 0 405 #define SCIP_DEFAULT_SEPA_FEASTOLFAC -1.00 406 #define SCIP_DEFAULT_SEPA_MINACTIVITYQUOT 0.8 410 #define SCIP_DEFAULT_PARALLEL_MODE 1 412 #define SCIP_DEFAULT_PARALLEL_MINNTHREADS 1 413 #define SCIP_DEFAULT_PARALLEL_MAXNTHREADS 8 416 #define SCIP_DEFAULT_CONCURRENT_CHANGESEEDS TRUE 417 #define SCIP_DEFAULT_CONCURRENT_CHANGECHILDSEL TRUE 418 #define SCIP_DEFAULT_CONCURRENT_COMMVARBNDS TRUE 419 #define SCIP_DEFAULT_CONCURRENT_PRESOLVEBEFORE TRUE 420 #define SCIP_DEFAULT_CONCURRENT_INITSEED 5131912 421 #define SCIP_DEFAULT_CONCURRENT_FREQINIT 10.0 423 #define SCIP_DEFAULT_CONCURRENT_FREQMAX 10.0 425 #define SCIP_DEFAULT_CONCURRENT_FREQFACTOR 1.5 426 #define SCIP_DEFAULT_CONCURRENT_TARGETPROGRESS 0.001 428 #define SCIP_DEFAULT_CONCURRENT_MAXNSOLS 3 429 #define SCIP_DEFAULT_CONCURRENT_MAXNSYNCDELAY 7 430 #define SCIP_DEFAULT_CONCURRENT_MINSYNCDELAY 10.0 431 #define SCIP_DEFAULT_CONCURRENT_NBESTSOLS 10 432 #define SCIP_DEFAULT_CONCURRENT_PARAMSETPREFIX "" 437 #define SCIP_DEFAULT_TIME_CLOCKTYPE SCIP_CLOCKTYPE_CPU 438 #define SCIP_DEFAULT_TIME_ENABLED TRUE 439 #define SCIP_DEFAULT_TIME_READING FALSE 440 #define SCIP_DEFAULT_TIME_RARECLOCKCHECK FALSE 441 #define SCIP_DEFAULT_TIME_STATISTICTIMING TRUE 446 #define SCIP_DEFAULT_VISUAL_VBCFILENAME "-" 447 #define SCIP_DEFAULT_VISUAL_BAKFILENAME "-" 448 #define SCIP_DEFAULT_VISUAL_REALTIME TRUE 449 #define SCIP_DEFAULT_VISUAL_DISPSOLS FALSE 450 #define SCIP_DEFAULT_VISUAL_OBJEXTERN TRUE 455 #define SCIP_DEFAULT_READ_INITIALCONSS TRUE 456 #define SCIP_DEFAULT_READ_DYNAMICCONSS TRUE 457 #define SCIP_DEFAULT_READ_DYNAMICCOLS FALSE 458 #define SCIP_DEFAULT_READ_DYNAMICROWS FALSE 459 #define SCIP_DEFAULT_WRITE_GENNAMES_OFFSET 0 466 #define SCIP_DEFAULT_WRITE_ALLCONSS FALSE 467 #define SCIP_DEFAULT_PRINTZEROS FALSE 481 assert(initsize >= 0);
482 assert(growfac >= 1.0);
486 size =
MAX(initsize, num);
492 initsize =
MAX(initsize, 4);
497 while( size < num && size > oldsize )
500 size = (int)(growfac * size + initsize);
504 if( size <= oldsize )
508 assert(size >= initsize);
611 int newarraygrowinit;
641 assert(messagehdlr !=
NULL);
643 if( set->reopt_enable )
708 for( i = set->nreaders - 1; i >= 0; --i )
711 for( i = set->npricers - 1; i >= 0; --i )
714 for( i = set->nconshdlrs - 1; i >= 0; --i )
717 for( i = set->nconflicthdlrs - 1; i >= 0; --i )
720 for( i = set->npresols - 1; i >= 0; --i )
723 for( i = set->nrelaxs - 1; i >= 0; --i )
726 for( i = set->nsepas - 1; i >= 0; --i )
729 for( i = set->nprops - 1; i >= 0; --i )
732 for( i = set->nheurs - 1; i >= 0; --i )
735 for( i = set->neventhdlrs - 1; i >= 0; --i )
738 for( i = set->nnodesels - 1; i >= 0; --i )
741 for( i = set->nbranchrules - 1; i >= 0; --i )
782 assert(sourceset !=
NULL);
783 assert(targetset !=
NULL);
784 assert(sourceset != targetset);
785 assert(allvalid !=
NULL);
792 for( p = sourceset->
nreaders - 1; p >= 0; --p )
801 for( p = sourceset->
npricers - 1; p >= 0; --p )
805 *allvalid = *allvalid && valid;
828 *allvalid = *allvalid && valid;
851 for( p = sourceset->
npresols - 1; p >= 0; --p )
859 if( copyrelaxators && sourceset->
relaxs !=
NULL )
861 for( p = sourceset->
nrelaxs - 1; p >= 0; --p )
869 if( copyseparators && sourceset->
sepas !=
NULL )
871 for( p = sourceset->
nsepas - 1; p >= 0; --p )
878 if( copypropagators && sourceset->
props !=
NULL )
880 for( p = sourceset->
nprops - 1; p >= 0; --p )
887 if( copyheuristics && sourceset->
heurs !=
NULL )
889 for( p = sourceset->
nheurs - 1; p >= 0; --p )
909 for( p = sourceset->
nnodesels - 1; p >= 0; --p )
926 if( copydisplays && sourceset->
disps !=
NULL )
928 for( p = sourceset->
ndisps - 1; p >= 0; --p )
938 for( p = sourceset->
ndialogs - 1; p >= 0; --p )
946 if( copynlpis && sourceset->
nlpis !=
NULL )
948 for( p = sourceset->
nnlpis - 1; p >= 0; --p )
967 assert(sourceset !=
NULL);
968 assert(targetset !=
NULL);
969 assert(sourceset != targetset);
986 assert(scip !=
NULL);
997 (*set)->readers =
NULL;
998 (*set)->nreaders = 0;
999 (*set)->readerssize = 0;
1000 (*set)->pricers =
NULL;
1001 (*set)->npricers = 0;
1002 (*set)->nactivepricers = 0;
1003 (*set)->pricerssize = 0;
1004 (*set)->pricerssorted =
FALSE;
1005 (*set)->pricersnamesorted =
FALSE;
1006 (*set)->conshdlrs =
NULL;
1007 (*set)->conshdlrs_sepa =
NULL;
1008 (*set)->conshdlrs_enfo =
NULL;
1009 (*set)->conshdlrs_include =
NULL;
1010 (*set)->nconshdlrs = 0;
1011 (*set)->conshdlrssize = 0;
1012 (*set)->conflicthdlrs =
NULL;
1013 (*set)->nconflicthdlrs = 0;
1014 (*set)->conflicthdlrssize = 0;
1015 (*set)->conflicthdlrssorted =
FALSE;
1016 (*set)->conflicthdlrsnamesorted =
FALSE;
1018 (*set)->debugsoldata =
NULL;
1021 (*set)->presols =
NULL;
1022 (*set)->npresols = 0;
1023 (*set)->presolssize = 0;
1024 (*set)->presolssorted =
FALSE;
1025 (*set)->presolsnamesorted =
FALSE;
1026 (*set)->relaxs =
NULL;
1027 (*set)->nrelaxs = 0;
1028 (*set)->relaxssize = 0;
1029 (*set)->relaxssorted =
FALSE;
1030 (*set)->relaxsnamesorted =
FALSE;
1031 (*set)->sepas =
NULL;
1033 (*set)->sepassize = 0;
1034 (*set)->sepassorted =
FALSE;
1036 (*set)->props =
NULL;
1037 (*set)->props_presol =
NULL;
1039 (*set)->propssize = 0;
1040 (*set)->propssorted =
FALSE;
1041 (*set)->propspresolsorted =
FALSE;
1042 (*set)->propsnamesorted =
FALSE;
1043 (*set)->concsolvertypes =
NULL;
1044 (*set)->nconcsolvertypes = 0;
1045 (*set)->concsolvertypessize = 0;
1046 (*set)->concsolvers =
NULL;
1047 (*set)->nconcsolvers = 0;
1048 (*set)->concsolverssize = 0;
1049 (*set)->concurrent_paramsetprefix =
NULL;
1050 (*set)->heurs =
NULL;
1052 (*set)->heurssize = 0;
1053 (*set)->heurssorted =
FALSE;
1054 (*set)->heursnamesorted =
FALSE;
1055 (*set)->comprs =
NULL;
1056 (*set)->ncomprs = 0;
1057 (*set)->comprssize = 0;
1058 (*set)->comprssorted =
FALSE;
1059 (*set)->comprsnamesorted =
FALSE;
1060 (*set)->eventhdlrs =
NULL;
1061 (*set)->neventhdlrs = 0;
1062 (*set)->eventhdlrssize = 0;
1063 (*set)->nodesels =
NULL;
1064 (*set)->nnodesels = 0;
1065 (*set)->nodeselssize = 0;
1066 (*set)->nodesel =
NULL;
1067 (*set)->branchrules =
NULL;
1068 (*set)->nbranchrules = 0;
1069 (*set)->branchrulessize = 0;
1070 (*set)->branchrulessorted =
FALSE;
1071 (*set)->branchrulesnamesorted =
FALSE;
1072 (*set)->disps =
NULL;
1074 (*set)->dispssize = 0;
1075 (*set)->dialogs =
NULL;
1076 (*set)->ndialogs = 0;
1077 (*set)->dialogssize = 0;
1078 (*set)->nlpis =
NULL;
1080 (*set)->nlpissize = 0;
1081 (*set)->nlpissorted =
FALSE;
1082 (*set)->limitchanged =
FALSE;
1083 (*set)->extcodenames =
NULL;
1084 (*set)->extcodedescs =
NULL;
1085 (*set)->nextcodes = 0;
1086 (*set)->extcodessize = 0;
1087 (*set)->visual_vbcfilename =
NULL;
1088 (*set)->visual_bakfilename =
NULL;
1089 (*set)->nlp_solver =
NULL;
1090 (*set)->nlp_disable =
FALSE;
1094 (*set)->istimelimitfinite =
FALSE;
1098 "branching/scorefunc",
1099 "branching score function ('s'um, 'p'roduct, 'q'uotient)",
1103 "branching/scorefac",
1104 "branching score factor to weigh downward and upward gain prediction in sum score function",
1108 "branching/preferbinary",
1109 "should branching on binary variables be preferred?",
1114 "minimal relative distance of branching point to bounds when branching on a continuous variable",
1118 "branching/lpgainnormalize",
1119 "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)",
1123 "branching/delaypscostupdate",
1124 "should updating pseudo costs for continuous variables be delayed to the time after separation?",
1128 "branching/divingpscost",
1129 "should pseudo costs be updated also in diving and probing mode?",
1133 "branching/forceallchildren",
1134 "should all strong branching children be regarded even if one is detected to be infeasible? (only with propagation)",
1138 "branching/firstsbchild",
1139 "child node to be regarded first during strong branching (only with propagation): 'u'p child, 'd'own child, 'h'istory-based, or 'a'utomatic",
1143 "branching/checksol",
1144 "should LP solutions during strong branching with propagation be checked for feasibility?",
1148 "branching/roundsbsol",
1149 "should LP solutions during strong branching with propagation be rounded? (only when checksbsol=TRUE)",
1153 "branching/sumadjustscore",
1154 "score adjustment near zero by adding epsilon (TRUE) or using maximum (FALSE)",
1160 "compression/enable",
1161 "should automatic tree compression after the presolving be enabled?",
1168 "should conflict analysis be enabled?",
1172 "conflict/cleanboundexceedings",
1173 "should conflicts based on an old cutoff bound be removed from the conflict pool after improving the primal bound?",
1178 "should propagation conflict analysis be used?",
1182 "conflict/useinflp",
1183 "should infeasible LP conflict analysis be used? ('o'ff, 'c'onflict graph, 'd'ual ray, 'b'oth conflict graph and dual ray)",
1187 "conflict/useboundlp",
1188 "should bound exceeding LP conflict analysis be used? ('o'ff, 'c'onflict graph, 'd'ual ray, 'b'oth conflict graph and dual ray)",
1193 "should infeasible/bound exceeding strong branching conflict analysis be used?",
1197 "conflict/usepseudo",
1198 "should pseudo solution conflict analysis be used?",
1202 "conflict/maxvarsfac",
1203 "maximal fraction of variables involved in a conflict constraint",
1207 "conflict/minmaxvars",
1208 "minimal absolute maximum of variables involved in a conflict constraint",
1212 "conflict/maxlploops",
1213 "maximal number of LP resolving loops during conflict analysis (-1: no limit)",
1217 "conflict/lpiterations",
1218 "maximal number of LP iterations in each LP resolving loop (-1: no limit)",
1222 "conflict/fuiplevels",
1223 "number of depth levels up to which first UIP's are used in conflict analysis (-1: use All-FirstUIP rule)",
1227 "conflict/interconss",
1228 "maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)",
1232 "conflict/reconvlevels",
1233 "number of depth levels up to which UIP reconvergence constraints are generated (-1: generate reconvergence constraints in all depth levels)",
1237 "conflict/maxconss",
1238 "maximal number of conflict constraints accepted at an infeasible node (-1: use all generated conflict constraints)",
1242 "conflict/maxstoresize",
1243 "maximal size of conflict store (-1: auto, 0: disable storage)",
1247 "conflict/preferbinary",
1248 "should binary conflicts be preferred?",
1252 "conflict/allowlocal",
1253 "should conflict constraints be generated that are only valid locally?",
1257 "conflict/settlelocal",
1258 "should conflict constraints be attached only to the local subtree where they can be useful?",
1262 "conflict/repropagate",
1263 "should earlier nodes be repropagated in order to replace branching decisions by deductions?",
1267 "conflict/keepreprop",
1268 "should constraints be kept for repropagation even if they are too long?",
1272 "conflict/separate",
1273 "should the conflict constraints be separated?",
1278 "should the conflict constraints be subject to aging?",
1282 "conflict/removable",
1283 "should the conflict's relaxations be subject to LP aging and cleanup?",
1287 "conflict/graph/depthscorefac",
1288 "score factor for depth level in bound relaxation heuristic",
1292 "conflict/proofscorefac",
1293 "score factor for impact on acticity in bound relaxation heuristic",
1297 "conflict/uplockscorefac",
1298 "score factor for up locks in bound relaxation heuristic",
1302 "conflict/downlockscorefac",
1303 "score factor for down locks in bound relaxation heuristic",
1307 "conflict/scorefac",
1308 "factor to decrease importance of variables' earlier conflict scores",
1312 "conflict/restartnum",
1313 "number of successful conflict analysis calls that trigger a restart (0: disable conflict restarts)",
1317 "conflict/restartfac",
1318 "factor to increase restartnum with after each restart",
1322 "conflict/ignorerelaxedbd",
1323 "should relaxed bounds be ignored?",
1327 "conflict/maxvarsdetectimpliedbounds",
1328 "maximal number of variables to try to detect global bound implications and shorten the whole conflict set (0: disabled)",
1332 "conflict/fullshortenconflict",
1333 "try to shorten the whole conflict set or terminate early (depending on the 'maxvarsdetectimpliedbounds' parameter)",
1337 "conflict/conflictweight",
1338 "the weight the VSIDS score is weight by updating the VSIDS for a variable if it is part of a conflict",
1342 "conflict/conflictgraphweight",
1343 "the weight the VSIDS score is weight by updating the VSIDS for a variable if it is part of a conflict graph",
1348 "apply MIR function to dual rays",
1352 "conflict/prefermir",
1353 "prefer a ray after applying the MIR function if the proof is still valid, use both rays otherwise",
1357 "conflict/minimprove",
1358 "minimal improvement of primal bound to remove conflicts based on a previous incumbent",
1361 "conflict/weightsize",
1362 "weight of the size of a conflict used in score calculation",
1365 "conflict/weightrepropdepth",
1366 "weight of the repropagation depth of a conflict used in score calculation",
1369 "conflict/weightvaliddepth",
1370 "weight of the valid depth of a conflict used in score calculation",
1375 "constraints/agelimit",
1376 "maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)",
1380 "constraints/obsoleteage",
1381 "age of a constraint after which it is marked obsolete (0: dynamic, -1 do not mark constraints obsolete)",
1385 "constraints/disableenfops",
1386 "should enforcement of pseudo solution be disabled?",
1393 "display/verblevel",
1394 "verbosity level of output",
1400 "maximal number of characters in a node information line",
1402 SCIPparamChgdDispWidth,
NULL) );
1405 "frequency for displaying node information lines",
1409 "display/headerfreq",
1410 "frequency for displaying header lines (every n'th node information line)",
1415 "should the LP solver display status messages?",
1420 "display all violations for a given start solution / the best solution after the solving process?",
1426 "history/valuebased",
1427 "should statistics be collected for variable domain value pairs?",
1431 "history/allowmerge",
1432 "should variable histories be merged from sub-SCIPs whenever possible?",
1436 "history/allowtransfer",
1437 "should variable histories be transferred to initialize SCIP copies?",
1444 "maximal time in seconds to run",
1446 SCIPparamChgdLimit,
NULL) );
1449 "maximal number of nodes to process (-1: no limit)",
1451 SCIPparamChgdLimit,
NULL) );
1453 "limits/totalnodes",
1454 "maximal number of total nodes (incl. restarts) to process (-1: no limit)",
1456 SCIPparamChgdLimit,
NULL) );
1458 "limits/stallnodes",
1459 "solving stops, if the given number of nodes was processed since the last improvement of the primal solution value (-1: no limit)",
1461 SCIPparamChgdLimit,
NULL) );
1464 "maximal memory usage in MB; reported memory usage is lower than real memory usage!",
1466 SCIPparamChgdLimit,
NULL) );
1469 "solving stops, if the relative gap = |primal - dual|/MIN(|dual|,|primal|) is below the given value",
1471 SCIPparamChgdLimit,
NULL) );
1474 "solving stops, if the absolute gap = |primalbound - dualbound| is below the given value",
1476 SCIPparamChgdLimit,
NULL) );
1479 "solving stops, if the given number of solutions were found (-1: no limit)",
1481 SCIPparamChgdLimit,
NULL) );
1484 "solving stops, if the given number of solution improvements were found (-1: no limit)",
1486 SCIPparamChgdLimit,
NULL) );
1489 "maximal number of solutions to store in the solution storage",
1491 SCIPparamChgdLimit,
NULL) );
1493 "limits/maxorigsol",
1494 "maximal number of solutions candidates to store in the solution storage of the original problem",
1496 SCIPparamChgdLimit,
NULL) );
1499 "solving stops, if the given number of restarts was triggered (-1: no limit)",
1501 SCIPparamChgdLimit,
NULL) );
1504 "limits/autorestartnodes",
1505 "if solve exceeds this number of nodes for the first time, an automatic restart is triggered (-1: no automatic restart)",
1507 SCIPparamChgdLimit,
NULL) );
1512 "frequency for solving LP at the nodes (-1: never; 0: only root LP)",
1517 "iteration limit for each single LP solve (-1: no limit)",
1522 "iteration limit for initial root LP solve (-1: no limit)",
1527 "maximal depth for solving LP at the nodes (-1: no depth limit)",
1532 "LP algorithm for solving initial LP relaxations (automatic 's'implex, 'p'rimal simplex, 'd'ual simplex, 'b'arrier, barrier with 'c'rossover)",
1536 "lp/resolvealgorithm",
1537 "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)",
1542 "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)",
1546 "lp/clearinitialprobinglp",
1547 "should lp state be cleared at the end of probing mode when lp was initially unsolved, e.g., when called right after presolving?",
1551 "lp/resolverestore",
1552 "should the LP be resolved to restore the state at start of diving (if FALSE we buffer the solution values)?",
1556 "lp/freesolvalbuffers",
1557 "should the buffers for storing LP solution values during diving be freed at end of diving?",
1562 "maximum age a dynamic column can reach before it is deleted from the LP (-1: don't delete columns due to aging)",
1567 "maximum age a dynamic row can reach before it is deleted from the LP (-1: don't delete rows due to aging)",
1572 "should new non-basic columns be removed after LP solving?",
1576 "lp/cleanupcolsroot",
1577 "should new non-basic columns be removed after root LP solving?",
1582 "should new basic rows be removed after LP solving?",
1586 "lp/cleanuprowsroot",
1587 "should new basic rows be removed after root LP solving?",
1591 "lp/checkstability",
1592 "should LP solver's return status be checked for stability?",
1596 "lp/conditionlimit",
1597 "maximum condition number of LP basis counted as stable (-1.0: no limit)",
1602 "should LP solutions be checked for primal feasibility, resolving LP when numerical troubles occur?",
1607 "should LP solutions be checked for dual feasibility, resolving LP when numerical troubles occur?",
1612 "which FASTMIP setting of LP solver should be used? 0: off, 1: low",
1617 "LP scaling (0: none, 1: normal, 2: aggressive)",
1622 "should presolving of LP solver be used?",
1627 "should the lexicographic dual algorithm be used?",
1631 "lp/lexdualrootonly",
1632 "should the lexicographic dual algorithm be applied only at the root node",
1636 "lp/lexdualmaxrounds",
1637 "maximum number of rounds in the lexicographic dual algorithm (-1: unbounded)",
1642 "choose fractional basic variables in lexicographic dual algorithm?",
1646 "lp/lexdualstalling",
1647 "turn on the lex dual algorithm only when stalling?",
1652 "disable the cutoff bound in the LP solver? (0: enabled, 1: disabled, 2: auto)",
1657 "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)",
1662 "number of threads used for solving the LP (0: automatic)",
1666 "lp/resolveiterfac",
1667 "factor of average LP iterations that is used as LP iteration limit for LP resolve (-1: unlimited)",
1671 "lp/resolveitermin",
1672 "minimum number of iterations that are allowed for LP resolve",
1677 "lp/solutionpolishing",
1678 "LP solution polishing method (0: disabled, 1: only root, 2: always)",
1685 "solver to use for solving NLPs; leave empty to select NLPI with highest priority",
1690 "should the NLP relaxation be always disabled (also for NLPs/MINLPs)?",
1697 "fraction of maximal memory usage resulting in switch to memory saving mode",
1701 "memory/arraygrowfac",
1702 "memory growing factor for dynamically allocated arrays",
1704 paramChgdArraygrowfac,
NULL) );
1706 "memory/arraygrowinit",
1707 "initial size of dynamically allocated arrays",
1709 paramChgdArraygrowinit,
NULL) );
1711 "memory/treegrowfac",
1712 "memory growing factor for tree array",
1716 "memory/treegrowinit",
1717 "initial size of tree array",
1721 "memory/pathgrowfac",
1722 "memory growing factor for path array",
1726 "memory/pathgrowinit",
1727 "initial size of path array",
1734 "should the CTRL-C interrupt be caught by SCIP?",
1739 "should a hashtable be used to map from variable names to variables?",
1743 "misc/useconstable",
1744 "should a hashtable be used to map from constraint names to constraints?",
1748 "misc/usesmalltables",
1749 "should smaller hashtables be used? yields better performance for small problems with about 100 variables",
1755 "should the problem be solved exactly (with proven dual bounds)?",
1764 "should the statistics be reset if the transformed problem is freed (in case of a Benders decomposition this parameter should be set to FALSE)",
1769 "misc/improvingsols",
1770 "should only solutions be checked which improve the primal bound",
1775 "should the reason be printed if a given start solution is infeasible",
1779 "misc/estimexternmem",
1780 "should the usage of external memory be estimated?",
1784 "misc/transorigsols",
1785 "should SCIP try to transfer original solutions to the transformed space (after presolving)?",
1789 "misc/transsolsorig",
1790 "should SCIP try to transfer transformed solutions to the original space (after solving)?",
1794 "misc/calcintegral",
1795 "should SCIP calculate the primal dual integral value?",
1799 "misc/finitesolutionstore",
1800 "should SCIP try to remove infinite fixings from solutions copied to the solution store?",
1804 "misc/outputorigsol",
1805 "should the best solution be transformed to the orignal space and be output in command line run?",
1809 "misc/allowdualreds",
1810 "should dual reductions in propagation methods and presolver be allowed?",
1814 "misc/allowobjprop",
1815 "should propagation to the current objective be allowed in propagation methods?",
1820 "misc/referencevalue",
1821 "objective value for reference purposes",
1827 "randomization/randomseedshift",
1828 "global shift of all random seeds in the plugins and the LP random seed",
1833 "randomization/permutationseed",
1834 "seed value for permuting the problem after reading/transformation (0: no permutation)",
1839 "randomization/permuteconss",
1840 "should order of constraints be permuted (depends on permutationseed)?",
1845 "randomization/permutevars",
1846 "should order of variables be permuted (depends on permutationseed)?",
1852 "randomization/lpseed",
1853 "random seed for LP solver, e.g. for perturbations in the simplex (0: LP default)",
1859 "nodeselection/childsel",
1860 "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)",
1866 "numerics/infinity",
1867 "values larger than this are considered infinity",
1872 "absolute values smaller than this are considered zero",
1876 "numerics/sumepsilon",
1877 "absolute values of sums smaller than this are considered zero",
1882 "feasibility tolerance for constraints",
1884 paramChgdFeastol,
NULL) );
1886 "numerics/checkfeastolfac",
1887 "feasibility tolerance factor; for checking the feasibility of the best solution",
1891 "numerics/lpfeastol",
1892 "primal feasibility tolerance of LP solver",
1894 paramChgdLpfeastol,
NULL) );
1896 "numerics/dualfeastol",
1897 "feasibility tolerance for reduced costs in LP solution",
1899 paramChgdDualfeastol,
NULL) );
1901 "numerics/barrierconvtol",
1902 "LP convergence tolerance used in barrier algorithm",
1904 paramChgdBarrierconvtol,
NULL) );
1906 "numerics/boundstreps",
1907 "minimal relative improve for strengthening bounds",
1911 "numerics/pseudocosteps",
1912 "minimal variable distance value to use for branching pseudo cost updates",
1916 "numerics/pseudocostdelta",
1917 "minimal objective distance value to use for branching pseudo cost updates",
1921 "numerics/recomputefac",
1922 "minimal decrease factor that causes the recomputation of a value (e.g., pseudo objective) instead of an update",
1927 "values larger than this are considered huge and should be handled separately (e.g., in activity computation)",
1933 "presolving/maxrounds",
1934 "maximal number of presolving rounds (-1: unlimited, 0: off)",
1938 "presolving/abortfac",
1939 "abort presolve, if at most this fraction of the problem was changed in last presolve round",
1943 "presolving/maxrestarts",
1944 "maximal number of restarts (-1: unlimited)",
1948 "presolving/restartfac",
1949 "fraction of integer variables that were fixed in the root node triggering a restart with preprocessing after root node evaluation",
1953 "presolving/immrestartfac",
1954 "fraction of integer variables that were fixed in the root node triggering an immediate restart with preprocessing",
1958 "presolving/subrestartfac",
1959 "fraction of integer variables that were globally fixed during the solving process triggering a restart with preprocessing",
1963 "presolving/restartminred",
1964 "minimal fraction of integer variables removed after restart to allow for an additional restart",
1968 "presolving/donotmultaggr",
1969 "should multi-aggregation of variables be forbidden?",
1973 "presolving/donotaggr",
1974 "should aggregation of variables be forbidden?",
1982 "maximal number of variables priced in per pricing round",
1986 "pricing/maxvarsroot",
1987 "maximal number of priced variables at the root node",
1992 "pricing is aborted, if fac * pricing/maxvars pricing candidates were found",
1997 "should variables created at the current node be deleted when the node is solved in case they are not present in the LP anymore?",
2001 "pricing/delvarsroot",
2002 "should variables created at the root node be deleted when the root is solved in case they are not present in the LP anymore?",
2008 "propagating/maxrounds",
2009 "maximal number of propagation rounds per node (-1: unlimited)",
2013 "propagating/maxroundsroot",
2014 "maximal number of propagation rounds in the root node (-1: unlimited)",
2018 "propagating/abortoncutoff",
2019 "should propagation be aborted immediately? setting this to FALSE could help conflict analysis to produce more conflict constraints",
2025 "reoptimization/enable",
2026 "should reoptimization used?",
2028 paramChgdEnableReopt,
NULL) );
2030 "reoptimization/maxsavednodes",
2031 "maximal number of saved nodes",
2035 "reoptimization/maxdiffofnodes",
2036 "maximal number of bound changes between two stored nodes on one path",
2040 "reoptimization/globalcons/sepainfsubtrees",
2041 "save global constraints to separate infeasible subtrees.",
2045 "reoptimization/sepabestsol",
2046 "separate the optimal solution, i.e., for constrained shortest path",
2050 "reoptimization/storevarhistory",
2051 "use variable history of the previous solve if the objctive function has changed only slightly",
2055 "reoptimization/usepscost",
2056 "re-use pseudo costs if the objective function changed only slightly ",
2060 "reoptimization/solvelp",
2061 "at which reopttype should the LP be solved? (1: transit, 3: strong branched, 4: w/ added logicor, 5: only leafs).",
2065 "reoptimization/solvelpdiff",
2066 "maximal number of bound changes at node to skip solving the LP",
2070 "reoptimization/savesols",
2071 "number of best solutions which should be saved for the following runs. (-1: save all)",
2075 "reoptimization/objsimrootLP",
2076 "similarity of two sequential objective function to disable solving the root LP.",
2080 "reoptimization/objsimsol",
2081 "similarity of two objective functions to re-use stored solutions",
2085 "reoptimization/delay",
2086 "minimum similarity for using reoptimization of the search tree.",
2090 "reoptimization/commontimelimit",
2091 "time limit over all reoptimization rounds?.",
2095 "reoptimization/shrinkinner",
2096 "replace branched inner nodes by their child nodes, if the number of bound changes is not to large",
2100 "reoptimization/strongbranchinginit",
2101 "try to fix variables at the root node before reoptimizing by probing like strong branching",
2105 "reoptimization/reducetofrontier",
2106 "delete stored nodes which were not reoptimized",
2110 "reoptimization/forceheurrestart",
2111 "force a restart if the last n optimal solutions were found by heuristic reoptsols",
2115 "reoptimization/saveconsprop",
2116 "save constraint propagations",
2120 "reoptimization/usesplitcons",
"use constraints to reconstruct the subtree pruned be dual reduction when reactivating the node",
2124 "reoptimization/varorderinterdiction",
"use 'd'efault, 'r'andom or a variable ordering based on 'i'nference score for interdiction branching used during reoptimization",
2128 "reoptimization/usecuts",
2129 "reoptimize cuts found at the root node",
2133 "reoptimization/maxcutage",
2134 "maximal age of a cut to be use for reoptimization",
2140 "separating/maxbounddist",
2141 "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)",
2145 "separating/minefficacy",
2146 "minimal efficacy for a cut to enter the LP",
2150 "separating/minefficacyroot",
2151 "minimal efficacy for a cut to enter the LP in the root node",
2155 "separating/minortho",
2156 "minimal orthogonality for a cut to enter the LP",
2160 "separating/minorthoroot",
2161 "minimal orthogonality for a cut to enter the LP in the root node",
2165 "separating/objparalfac",
2166 "factor to scale objective parallelism of cut in separation score calculation",
2170 "separating/orthofac",
2171 "factor to scale orthogonality of cut in separation score calculation (0.0 to disable orthogonality calculation)",
2175 "separating/minactivityquot",
2176 "minimum cut activity quotient to convert cuts into constraints during a restart (0.0: all cuts are converted)",
2180 "separating/orthofunc",
2181 "function used for calc. scalar prod. in orthogonality test ('e'uclidean, 'd'iscrete)",
2185 "separating/efficacynorm",
2186 "row norm to use for efficacy calculation ('e'uclidean, 'm'aximum, 's'um, 'd'iscrete)",
2190 "separating/cutselrestart",
2191 "cut selection during restart ('a'ge, activity 'q'uotient)",
2195 "separating/cutselsubscip",
2196 "cut selection for sub SCIPs ('a'ge, activity 'q'uotient)",
2200 "separating/maxruns",
2201 "maximal number of runs for which separation is enabled (-1: unlimited)",
2205 "separating/maxrounds",
2206 "maximal number of separation rounds per node (-1: unlimited)",
2210 "separating/maxroundsroot",
2211 "maximal number of separation rounds in the root node (-1: unlimited)",
2215 "separating/maxroundsrootsubrun",
2216 "maximal number of separation rounds in the root node of a subsequent run (-1: unlimited)",
2220 "separating/maxaddrounds",
2221 "maximal additional number of separation rounds in subsequent price-and-cut loops (-1: no additional restriction)",
2225 "separating/maxstallrounds",
2226 "maximal number of consecutive separation rounds without objective or integrality improvement (-1: no additional restriction)",
2230 "separating/maxcuts",
2231 "maximal number of cuts separated per separation round (0: disable local separation)",
2235 "separating/maxcutsroot",
2236 "maximal number of separated cuts at the root node (0: disable root node separation)",
2240 "separating/cutagelimit",
2241 "maximum age a cut can reach before it is deleted from the global cut pool, or -1 to keep all cuts",
2245 "separating/poolfreq",
2246 "separation frequency for the global cut pool (-1: disable global cut pool, 0: only separate pool at the root)",
2250 "separating/feastolfac",
2251 "factor on cut infeasibility to limit feasibility tolerance for relaxation solver (-1: off)",
2258 "parallel optimisation mode, 0: opportunistic or 1: deterministic.",
2262 "parallel/minnthreads",
2263 "the minimum number of threads used during parallel solve",
2267 "parallel/maxnthreads",
2268 "the maximum number of threads used during parallel solve",
2274 "concurrent/changeseeds",
2275 "set different random seeds in each concurrent solver?",
2279 "concurrent/changechildsel",
2280 "use different child selection rules in each concurrent solver?",
2284 "concurrent/commvarbnds",
2285 "should the concurrent solvers communicate global variable bound changes?",
2289 "concurrent/presolvebefore",
2290 "should the problem be presolved before it is copied to the concurrent solvers?",
2294 "concurrent/initseed",
2295 "maximum number of solutions that will be shared in a one synchronization",
2299 "concurrent/sync/freqinit",
2300 "initial frequency of synchronization with other threads",
2304 "concurrent/sync/freqmax",
2305 "maximal frequency of synchronization with other threads",
2309 "concurrent/sync/freqfactor",
2310 "factor by which the frequency of synchronization is changed",
2314 "concurrent/sync/targetprogress",
2315 "when adapting the synchronization frequency this value is the targeted relative difference by which the absolute gap decreases per synchronization",
2319 "concurrent/sync/maxnsols",
2320 "maximum number of solutions that will be shared in a single synchronization",
2324 "concurrent/sync/maxnsyncdelay",
2325 "maximum number of synchronizations before reading is enforced regardless of delay",
2329 "concurrent/sync/minsyncdelay",
2330 "minimum delay before synchronization data is read",
2334 "concurrent/sync/nbestsols",
2335 "how many of the N best solutions should be considered for synchronization?",
2339 "concurrent/paramsetprefix",
2340 "path prefix for parameter setting files of concurrent solvers",
2348 "default clock type (1: CPU user seconds, 2: wall clock time)",
2353 "is timing enabled?",
2358 "belongs reading time to solving time?",
2362 "timing/rareclockcheck",
2363 "should clock checks of solving time be performed less frequently (note: time limit could be exceeded slightly)",
2367 "timing/statistictiming",
2368 "should timing for statistic output be performed?",
2370 paramChgdStatistictiming,
NULL) );
2374 "visual/vbcfilename",
2375 "name of the VBC tool output file, or - if no VBC tool output should be created",
2379 "visual/bakfilename",
2380 "name of the BAK tool output file, or - if no BAK tool output should be created",
2385 "should the real solving time be used instead of a time step counter in visualization?",
2390 "should the node where solutions are found be visualized?",
2395 "should be output the external value of the objective?",
2401 "reading/initialconss",
2402 "should model constraints be marked as initial?",
2406 "reading/dynamicconss",
2407 "should model constraints be subject to aging?",
2411 "reading/dynamiccols",
2412 "should columns be added and removed dynamically to the LP?",
2416 "reading/dynamicrows",
2417 "should rows be added and removed dynamically to the LP?",
2424 "should all constraints be written (including the redundant constraints)?",
2429 "should variables set to zero be printed?",
2433 "write/genericnamesoffset",
2434 "when writing a generic problem the index for the first variable should start with?",
2449 assert(
set !=
NULL);
2455 for( i = 0; i < (*set)->nreaders; ++i )
2462 for( i = 0; i < (*set)->npricers; ++i )
2469 for( i = 0; i < (*set)->nconshdlrs; ++i )
2479 for( i = 0; i < (*set)->nconflicthdlrs; ++i )
2486 for( i = 0; i < (*set)->npresols; ++i )
2493 for( i = 0; i < (*set)->nrelaxs; ++i )
2500 for( i = 0; i < (*set)->nsepas; ++i )
2507 for( i = 0; i < (*set)->nprops; ++i )
2515 for( i = 0; i < (*set)->nheurs; ++i )
2522 for( i = 0; i < (*set)->ncomprs; ++i )
2529 for( i = 0; i < (*set)->neventhdlrs; ++i )
2536 for( i = 0; i < (*set)->nnodesels; ++i )
2543 for( i = 0; i < (*set)->nbranchrules; ++i )
2550 for( i = 0; i < (*set)->ndisps; ++i )
2560 for( i = 0; i < (*set)->nnlpis; ++i )
2570 for( i = 0; i < (*set)->nconcsolvertypes; ++i )
2578 for( i = 0; i < (*set)->nextcodes; ++i )
2599 assert(
set !=
NULL);
2618 assert(
set !=
NULL);
2621 defaultvalue, paramchgd, paramdata) );
2642 assert(
set !=
NULL);
2645 defaultvalue, minvalue, maxvalue, paramchgd, paramdata) );
2666 assert(
set !=
NULL);
2669 defaultvalue, minvalue, maxvalue, paramchgd, paramdata) );
2690 assert(
set !=
NULL);
2693 defaultvalue, minvalue, maxvalue, paramchgd, paramdata) );
2708 const char* allowedvalues,
2713 assert(
set !=
NULL);
2716 defaultvalue, allowedvalues, paramchgd, paramdata) );
2730 const char* defaultvalue,
2735 assert(
set !=
NULL);
2738 defaultvalue, paramchgd, paramdata) );
2760 assert(
set !=
NULL);
2772 assert(
set !=
NULL);
2786 assert(
set !=
NULL);
2800 assert(
set !=
NULL);
2814 assert(
set !=
NULL);
2828 assert(
set !=
NULL);
2842 assert(
set !=
NULL);
2856 assert(
set !=
NULL);
2871 assert(
set !=
NULL);
2888 assert(
set !=
NULL);
2908 assert(
set !=
NULL);
2922 assert(
set !=
NULL);
2940 assert(
set !=
NULL);
2941 assert(param !=
NULL);
2961 assert(
set !=
NULL);
2992 assert(
set !=
NULL);
2993 assert(param !=
NULL);
3013 assert(
set !=
NULL);
3030 assert(
set !=
NULL);
3031 assert(param !=
NULL);
3051 assert(
set !=
NULL);
3068 assert(
set !=
NULL);
3069 assert(param !=
NULL);
3089 assert(
set !=
NULL);
3106 assert(
set !=
NULL);
3107 assert(param !=
NULL);
3127 assert(
set !=
NULL);
3138 const char* filename
3141 assert(
set !=
NULL);
3152 const char* filename,
3157 assert(
set !=
NULL);
3285 assert(
set !=
NULL);
3295 assert(
set !=
NULL);
3307 assert(reader !=
NULL);
3309 if( set->nreaders >= set->readerssize )
3314 assert(set->nreaders < set->readerssize);
3316 set->readers[
set->nreaders] = reader;
3330 assert(
set !=
NULL);
3331 assert(name !=
NULL);
3333 for( i = 0; i <
set->nreaders; ++i )
3336 return set->readers[i];
3348 assert(
set !=
NULL);
3349 assert(pricer !=
NULL);
3351 if( set->npricers >= set->pricerssize )
3356 assert(set->npricers < set->pricerssize);
3358 set->pricers[
set->npricers] = pricer;
3360 set->pricerssorted =
FALSE;
3373 assert(
set !=
NULL);
3374 assert(name !=
NULL);
3376 for( i = 0; i <
set->npricers; ++i )
3379 return set->pricers[i];
3390 assert(
set !=
NULL);
3392 if( !set->pricerssorted )
3394 SCIPsortPtr((
void**)set->pricers, SCIPpricerComp, set->npricers);
3395 set->pricerssorted =
TRUE;
3396 set->pricersnamesorted =
FALSE;
3405 assert(
set !=
NULL);
3407 if( !set->pricersnamesorted )
3409 SCIPsortPtr((
void**)set->pricers, SCIPpricerCompName, set->npricers);
3410 set->pricerssorted =
FALSE;
3411 set->pricersnamesorted =
TRUE;
3424 assert(
set !=
NULL);
3425 assert(conshdlr !=
NULL);
3429 if( set->nconshdlrs >= set->conshdlrssize )
3437 assert(set->nconshdlrs < set->conshdlrssize);
3443 set->conshdlrs[i] =
set->conshdlrs[i-1];
3445 set->conshdlrs[i] = conshdlr;
3451 set->conshdlrs_sepa[i] =
set->conshdlrs_sepa[i-1];
3453 set->conshdlrs_sepa[i] = conshdlr;
3459 set->conshdlrs_enfo[i] =
set->conshdlrs_enfo[i-1];
3461 set->conshdlrs_enfo[i] = conshdlr;
3464 set->conshdlrs_include[
set->nconshdlrs] = conshdlr;
3481 assert(
set !=
NULL);
3482 assert(conshdlr !=
NULL);
3488 if( newpriority > oldpriority )
3491 while( i < set->nconshdlrs &&
3497 assert(priorityatpos >= oldpriority);
3500 if( newpriority > priorityatpos && newpos == -1 )
3505 assert(i < set->nconshdlrs);
3511 for( ; i > newpos; --i )
3513 set->conshdlrs_sepa[i] =
set->conshdlrs_sepa[i-1];
3515 set->conshdlrs_sepa[newpos] = conshdlr;
3519 else if( newpriority < oldpriority )
3521 i =
set->nconshdlrs - 1;
3528 assert(priorityatpos <= oldpriority);
3531 if( newpriority < priorityatpos && newpos == -1 )
3542 for(; i < newpos; ++i )
3544 set->conshdlrs_sepa[i] =
set->conshdlrs_sepa[i + 1];
3546 set->conshdlrs_sepa[newpos] = conshdlr;
3549 for( i = 0; i <
set->nconshdlrs - 1; ++i )
3564 assert(
set !=
NULL);
3565 assert(name !=
NULL);
3567 for( i = 0; i <
set->nconshdlrs; ++i )
3570 return set->conshdlrs[i];
3582 assert(
set !=
NULL);
3583 assert(conflicthdlr !=
NULL);
3586 if( set->nconflicthdlrs >= set->conflicthdlrssize )
3591 assert(set->nconflicthdlrs < set->conflicthdlrssize);
3593 set->conflicthdlrs[
set->nconflicthdlrs] = conflicthdlr;
3594 set->nconflicthdlrs++;
3595 set->conflicthdlrssorted =
FALSE;
3608 assert(
set !=
NULL);
3609 assert(name !=
NULL);
3611 for( i = 0; i <
set->nconflicthdlrs; ++i )
3614 return set->conflicthdlrs[i];
3625 assert(
set !=
NULL);
3627 if( !set->conflicthdlrssorted )
3629 SCIPsortPtr((
void**)set->conflicthdlrs, SCIPconflicthdlrComp, set->nconflicthdlrs);
3630 set->conflicthdlrssorted =
TRUE;
3640 assert(
set !=
NULL);
3642 if( !set->conflicthdlrsnamesorted )
3644 SCIPsortPtr((
void**)set->conflicthdlrs, SCIPconflicthdlrCompName, set->nconflicthdlrs);
3645 set->conflicthdlrssorted =
FALSE;
3646 set->conflicthdlrsnamesorted =
TRUE;
3656 assert(
set !=
NULL);
3657 assert(presol !=
NULL);
3659 if( set->npresols >= set->presolssize )
3664 assert(set->npresols < set->presolssize);
3666 set->presols[
set->npresols] = presol;
3668 set->presolssorted =
FALSE;
3681 assert(
set !=
NULL);
3682 assert(name !=
NULL);
3684 for( i = 0; i <
set->npresols; ++i )
3687 return set->presols[i];
3698 assert(
set !=
NULL);
3700 if( !set->presolssorted )
3702 SCIPsortPtr((
void**)set->presols, SCIPpresolComp, set->npresols);
3703 set->presolssorted =
TRUE;
3704 set->presolsnamesorted =
FALSE;
3713 assert(
set !=
NULL);
3715 if( !set->presolsnamesorted )
3717 SCIPsortPtr((
void**)set->presols, SCIPpresolCompName, set->npresols);
3718 set->presolssorted =
FALSE;
3719 set->presolsnamesorted =
TRUE;
3729 assert(
set !=
NULL);
3730 assert(relax !=
NULL);
3733 if( set->nrelaxs >= set->relaxssize )
3738 assert(set->nrelaxs < set->relaxssize);
3740 set->relaxs[
set->nrelaxs] = relax;
3742 set->relaxssorted =
FALSE;
3755 assert(
set !=
NULL);
3756 assert(name !=
NULL);
3758 for( i = 0; i <
set->nrelaxs; ++i )
3761 return set->relaxs[i];
3772 assert(
set !=
NULL);
3774 if( !set->relaxssorted )
3776 SCIPsortPtr((
void**)set->relaxs, SCIPrelaxComp, set->nrelaxs);
3777 set->relaxssorted =
TRUE;
3778 set->relaxsnamesorted =
FALSE;
3787 assert(
set !=
NULL);
3789 if( !set->relaxsnamesorted )
3791 SCIPsortPtr((
void**)set->relaxs, SCIPrelaxCompName, set->nrelaxs);
3792 set->relaxssorted =
FALSE;
3793 set->relaxsnamesorted =
TRUE;
3803 assert(
set !=
NULL);
3804 assert(sepa !=
NULL);
3807 if( set->nsepas >= set->sepassize )
3812 assert(set->nsepas < set->sepassize);
3814 set->sepas[
set->nsepas] = sepa;
3816 set->sepassorted =
FALSE;
3829 assert(
set !=
NULL);
3830 assert(name !=
NULL);
3832 for( i = 0; i <
set->nsepas; ++i )
3835 return set->sepas[i];
3846 assert(
set !=
NULL);
3848 if( !set->sepassorted )
3850 SCIPsortPtr((
void**)set->sepas, SCIPsepaComp, set->nsepas);
3851 set->sepassorted =
TRUE;
3852 set->sepasnamesorted =
FALSE;
3861 assert(
set !=
NULL);
3863 if( !set->sepasnamesorted )
3865 SCIPsortPtr((
void**)set->sepas, SCIPsepaCompName, set->nsepas);
3866 set->sepassorted =
FALSE;
3867 set->sepasnamesorted =
TRUE;
3877 assert(
set !=
NULL);
3878 assert(prop !=
NULL);
3881 if( set->nprops >= set->propssize )
3887 assert(set->nprops < set->propssize);
3889 set->props[
set->nprops] = prop;
3890 set->props_presol[
set->nprops] = prop;
3892 set->propssorted =
FALSE;
3893 set->propspresolsorted =
FALSE;
3906 assert(
set !=
NULL);
3907 assert(name !=
NULL);
3909 for( i = 0; i <
set->nprops; ++i )
3912 return set->props[i];
3923 assert(
set !=
NULL);
3925 if( !set->propssorted )
3927 SCIPsortPtr((
void**)set->props, SCIPpropComp, set->nprops);
3928 set->propssorted =
TRUE;
3929 set->propsnamesorted =
FALSE;
3938 assert(
set !=
NULL);
3940 if( !set->propspresolsorted )
3942 SCIPsortPtr((
void**)set->props_presol, SCIPpropCompPresol, set->nprops);
3943 set->propspresolsorted =
TRUE;
3944 set->propsnamesorted =
FALSE;
3953 assert(
set !=
NULL);
3955 if( !set->propsnamesorted )
3957 SCIPsortPtr((
void**)set->props, SCIPpropCompName, set->nprops);
3958 set->propssorted =
FALSE;
3959 set->propsnamesorted =
TRUE;
3969 assert(
set !=
NULL);
3970 assert(concsolvertype !=
NULL);
3972 if( set->nconcsolvertypes >= set->concsolvertypessize )
3977 assert(set->nconcsolvertypes < set->concsolvertypessize);
3979 set->concsolvertypes[
set->nconcsolvertypes] = concsolvertype;
3980 set->nconcsolvertypes++;
3994 assert(name !=
NULL);
3996 for( i = 0; i <
set->nconcsolvertypes; ++i )
3999 return set->concsolvertypes[i];
4011 assert(
set !=
NULL);
4012 assert(concsolver !=
NULL);
4014 if( set->nconcsolvers >= set->concsolverssize )
4019 assert(set->nconcsolvers < set->concsolverssize);
4021 set->concsolvers[
set->nconcsolvers] = concsolver;
4024 set->nconcsolvers++;
4035 assert(
set !=
NULL);
4038 for( i = 0; i <
set->nconcsolvers; ++i )
4044 set->nconcsolvers = 0;
4045 set->concsolverssize = 0;
4057 assert(
set !=
NULL);
4058 assert(heur !=
NULL);
4061 if( set->nheurs >= set->heurssize )
4066 assert(set->nheurs < set->heurssize);
4068 set->heurs[
set->nheurs] = heur;
4070 set->heurssorted =
FALSE;
4083 assert(
set !=
NULL);
4084 assert(name !=
NULL);
4086 for( i = 0; i <
set->nheurs; ++i )
4089 return set->heurs[i];
4100 assert(
set !=
NULL);
4102 if( !set->heurssorted )
4105 set->heurssorted =
TRUE;
4106 set->heursnamesorted =
FALSE;
4115 assert(
set !=
NULL);
4117 if( !set->heursnamesorted )
4119 SCIPsortPtr((
void**)set->heurs, SCIPheurCompName, set->nheurs);
4120 set->heurssorted =
FALSE;
4121 set->heursnamesorted =
TRUE;
4131 assert(
set !=
NULL);
4132 assert(compr !=
NULL);
4135 if( set->ncomprs >= set->comprssize )
4140 assert(set->ncomprs < set->comprssize);
4142 set->comprs[
set->ncomprs] = compr;
4144 set->comprssorted =
FALSE;
4157 assert(
set !=
NULL);
4158 assert(name !=
NULL);
4160 for( i = 0; i <
set->ncomprs; ++i )
4163 return set->comprs[i];
4174 assert(
set !=
NULL);
4176 if( !set->comprssorted )
4178 SCIPsortPtr((
void**)set->comprs, SCIPcomprComp, set->ncomprs);
4179 set->comprssorted =
TRUE;
4180 set->comprsnamesorted =
FALSE;
4189 assert(
set !=
NULL);
4191 if( !set->comprsnamesorted )
4193 SCIPsortPtr((
void**)set->comprs, SCIPcomprCompName, set->ncomprs);
4194 set->comprssorted =
FALSE;
4195 set->comprsnamesorted =
TRUE;
4205 assert(
set !=
NULL);
4206 assert(eventhdlr !=
NULL);
4209 if( set->neventhdlrs >= set->eventhdlrssize )
4214 assert(set->neventhdlrs < set->eventhdlrssize);
4216 set->eventhdlrs[
set->neventhdlrs] = eventhdlr;
4230 assert(
set !=
NULL);
4231 assert(name !=
NULL);
4233 for( i = 0; i <
set->neventhdlrs; ++i )
4236 return set->eventhdlrs[i];
4251 assert(
set !=
NULL);
4252 assert(nodesel !=
NULL);
4255 if( set->nnodesels >= set->nodeselssize )
4260 assert(set->nnodesels < set->nodeselssize);
4265 set->nodesels[i] =
set->nodesels[i-1];
4267 set->nodesels[i] = nodesel;
4281 assert(
set !=
NULL);
4282 assert(name !=
NULL);
4284 for( i = 0; i <
set->nnodesels; ++i )
4287 return set->nodesels[i];
4299 assert(
set !=
NULL);
4300 assert(stat !=
NULL);
4303 if( set->nodesel ==
NULL && set->nnodesels > 0 )
4307 set->nodesel =
set->nodesels[0];
4310 if( stat->memsavemode )
4312 for( i = 1; i <
set->nnodesels; ++i )
4315 set->nodesel =
set->nodesels[i];
4320 for( i = 1; i <
set->nnodesels; ++i )
4323 set->nodesel =
set->nodesels[i];
4328 return set->nodesel;
4337 assert(
set !=
NULL);
4338 assert(branchrule !=
NULL);
4341 if( set->nbranchrules >= set->branchrulessize )
4346 assert(set->nbranchrules < set->branchrulessize);
4348 set->branchrules[
set->nbranchrules] = branchrule;
4349 set->nbranchrules++;
4350 set->branchrulessorted =
FALSE;
4363 assert(
set !=
NULL);
4364 assert(name !=
NULL);
4366 for( i = 0; i <
set->nbranchrules; ++i )
4369 return set->branchrules[i];
4380 assert(
set !=
NULL);
4382 if( !set->branchrulessorted )
4384 SCIPsortPtr((
void**)set->branchrules, SCIPbranchruleComp, set->nbranchrules);
4385 set->branchrulessorted =
TRUE;
4386 set->branchrulesnamesorted =
FALSE;
4395 assert(
set !=
NULL);
4397 if( !set->branchrulesnamesorted )
4399 SCIPsortPtr((
void**)set->branchrules, SCIPbranchruleCompName, set->nbranchrules);
4400 set->branchrulessorted =
FALSE;
4401 set->branchrulesnamesorted =
TRUE;
4414 assert(
set !=
NULL);
4415 assert(disp !=
NULL);
4418 if( set->ndisps >= set->dispssize )
4423 assert(set->ndisps < set->dispssize);
4429 set->disps[i] =
set->disps[i-1];
4431 set->disps[i] = disp;
4445 assert(
set !=
NULL);
4446 assert(name !=
NULL);
4448 for( i = 0; i <
set->ndisps; ++i )
4451 return set->disps[i];
4463 assert(
set !=
NULL);
4464 assert(dialog !=
NULL);
4466 if( set->ndialogs >= set->dialogssize )
4471 assert(set->ndialogs < set->dialogssize);
4473 set->dialogs[
set->ndialogs] = dialog;
4487 assert(
set !=
NULL);
4489 if( dialog ==
NULL )
4492 for( i = 0; i <
set->ndialogs; ++i )
4494 if( set->dialogs[i] == dialog )
4507 assert(
set !=
NULL);
4508 assert(nlpi !=
NULL);
4510 if( set->nnlpis >= set->nlpissize )
4515 assert(set->nnlpis < set->nlpissize);
4517 set->nlpis[
set->nnlpis] = nlpi;
4519 set->nlpissorted =
FALSE;
4533 assert(name !=
NULL);
4535 for( i = 0; i <
set->nnlpis; ++i )
4538 return set->nlpis[i];
4549 assert(
set !=
NULL);
4551 if( !set->nlpissorted )
4553 SCIPsortPtr((
void**)set->nlpis, SCIPnlpiComp, set->nnlpis);
4565 assert(
set !=
NULL);
4566 assert(nlpi !=
NULL);
4569 set->nlpissorted =
FALSE;
4576 const char* description
4579 assert(
set !=
NULL);
4580 assert(name !=
NULL);
4582 if( set->nextcodes >= set->extcodessize )
4588 assert(set->nextcodes < set->extcodessize);
4591 if( description !=
NULL )
4597 set->extcodedescs[
set->nextcodes] =
NULL;
4613 assert(
set !=
NULL);
4617 for( i = 0; i <
set->nactivepricers; ++i )
4623 for( i = 0; i <
set->nconshdlrs; ++i )
4629 for( i = 0; i <
set->nconflicthdlrs; ++i )
4635 for( i = 0; i <
set->npresols; ++i )
4641 for( i = 0; i <
set->nrelaxs; ++i )
4647 for( i = 0; i <
set->nsepas; ++i )
4653 for( i = 0; i <
set->nprops; ++i )
4659 for( i = 0; i <
set->nheurs; ++i )
4665 for( i = 0; i <
set->ncomprs; ++i )
4671 for( i = 0; i <
set->neventhdlrs; ++i )
4677 for( i = 0; i <
set->nnodesels; ++i )
4683 for( i = 0; i <
set->nbranchrules; ++i )
4689 for( i = 0; i <
set->ndisps; ++i )
4707 assert(
set !=
NULL);
4711 for( i = 0; i <
set->nactivepricers; ++i )
4717 for( i = 0; i <
set->nconshdlrs; ++i )
4723 for( i = 0; i <
set->nconflicthdlrs; ++i )
4729 for( i = 0; i <
set->npresols; ++i )
4735 for( i = 0; i <
set->nrelaxs; ++i )
4741 for( i = 0; i <
set->nsepas; ++i )
4747 for( i = 0; i <
set->nprops; ++i )
4753 for( i = 0; i <
set->nheurs; ++i )
4759 for( i = 0; i <
set->ncomprs; ++i )
4765 for( i = 0; i <
set->neventhdlrs; ++i )
4771 for( i = 0; i <
set->nnodesels; ++i )
4777 for( i = 0; i <
set->nbranchrules; ++i )
4783 for( i = 0; i <
set->ndisps; ++i )
4800 assert(
set !=
NULL);
4803 for( i = 0; i <
set->npresols; ++i )
4809 for( i = 0; i <
set->nprops; ++i )
4815 for( i = 0; i <
set->nconshdlrs; ++i )
4832 assert(
set !=
NULL);
4835 for( i = 0; i <
set->npresols; ++i )
4841 for( i = 0; i <
set->nprops; ++i )
4847 for( i = 0; i <
set->nconshdlrs; ++i )
4864 assert(
set !=
NULL);
4868 for( i = 0; i <
set->nactivepricers; ++i )
4874 for( i = 0; i <
set->nconshdlrs; ++i )
4880 for( i = 0; i <
set->nconflicthdlrs; ++i )
4886 for( i = 0; i <
set->nrelaxs; ++i )
4892 for( i = 0; i <
set->nsepas; ++i )
4898 for( i = 0; i <
set->nprops; ++i )
4904 for( i = 0; i <
set->nheurs; ++i )
4910 for( i = 0; i <
set->neventhdlrs; ++i )
4916 for( i = 0; i <
set->nnodesels; ++i )
4922 for( i = 0; i <
set->nbranchrules; ++i )
4928 for( i = 0; i <
set->ndisps; ++i )
4949 assert(
set !=
NULL);
4953 for( i = 0; i <
set->nactivepricers; ++i )
4959 for( i = 0; i <
set->nconshdlrs; ++i )
4965 for( i = 0; i <
set->nconflicthdlrs; ++i )
4971 for( i = 0; i <
set->nrelaxs; ++i )
4977 for( i = 0; i <
set->nsepas; ++i )
4983 for( i = 0; i <
set->nprops; ++i )
4989 for( i = 0; i <
set->nheurs; ++i )
4995 for( i = 0; i <
set->neventhdlrs; ++i )
5001 for( i = 0; i <
set->nnodesels; ++i )
5007 for( i = 0; i <
set->nbranchrules; ++i )
5013 for( i = 0; i <
set->ndisps; ++i )
5027 return calcGrowSize(set->mem_arraygrowinit, set->mem_arraygrowfac, num);
5036 return calcGrowSize(set->mem_treegrowinit, set->mem_treegrowfac, num);
5045 return calcGrowSize(set->mem_pathgrowinit, set->mem_pathgrowfac, num);
5054 assert(
set !=
NULL);
5062 set->disp_verblevel = verblevel;
5073 assert(
set !=
NULL);
5075 set->num_feastol = feastol;
5098 assert(
set !=
NULL);
5109 SCIPerrorMessage(
"LP feasibility tolerance must be at least as tight as SCIP's feasibility tolerance\n");
5112 printnewvalue =
TRUE;
5117 set->num_lpfeastol = lpfeastol;
5133 assert(
set !=
NULL);
5135 set->num_dualfeastol = dualfeastol;
5146 assert(
set !=
NULL);
5148 set->num_barrierconvtol = barrierconvtol;
5158 set->limitchanged =
TRUE;
5169 assert(
set !=
NULL);
5172 return set->price_maxvarsroot;
5174 return set->price_maxvars;
5183 assert(
set !=
NULL);
5186 return set->sepa_maxcutsroot;
5188 return set->sepa_maxcuts;
5196 assert(
NULL !=
set);
5198 return set->misc_referencevalue;
5207 assert(
set !=
NULL);
5209 return set->debugsoldata;
5223 #undef SCIPsetInfinity 5224 #undef SCIPsetEpsilon 5225 #undef SCIPsetSumepsilon 5226 #undef SCIPsetFeastol 5227 #undef SCIPsetLpfeastol 5228 #undef SCIPsetSepaprimfeastol 5229 #undef SCIPsetDualfeastol 5230 #undef SCIPsetBarrierconvtol 5231 #undef SCIPsetPseudocosteps 5232 #undef SCIPsetPseudocostdelta 5233 #undef SCIPsetCutoffbounddelta 5234 #undef SCIPsetRecompfac 5240 #undef SCIPsetIsInfinity 5241 #undef SCIPsetIsZero 5242 #undef SCIPsetIsPositive 5243 #undef SCIPsetIsNegative 5244 #undef SCIPsetIsIntegral 5245 #undef SCIPsetIsScalingIntegral 5246 #undef SCIPsetIsFracIntegral 5251 #undef SCIPsetIsSumEQ 5252 #undef SCIPsetIsSumLT 5253 #undef SCIPsetIsSumLE 5254 #undef SCIPsetIsSumGT 5255 #undef SCIPsetIsSumGE 5256 #undef SCIPsetIsSumZero 5257 #undef SCIPsetIsSumPositive 5258 #undef SCIPsetIsSumNegative 5259 #undef SCIPsetSumFloor 5260 #undef SCIPsetSumCeil 5261 #undef SCIPsetSumRound 5262 #undef SCIPsetSumFrac 5263 #undef SCIPsetIsFeasEQ 5264 #undef SCIPsetIsFeasLT 5265 #undef SCIPsetIsFeasLE 5266 #undef SCIPsetIsFeasGT 5267 #undef SCIPsetIsFeasGE 5268 #undef SCIPsetIsFeasZero 5269 #undef SCIPsetIsFeasPositive 5270 #undef SCIPsetIsFeasNegative 5271 #undef SCIPsetIsFeasIntegral 5272 #undef SCIPsetIsFeasFracIntegral 5273 #undef SCIPsetFeasFloor 5274 #undef SCIPsetFeasCeil 5275 #undef SCIPsetFeasRound 5276 #undef SCIPsetFeasFrac 5277 #undef SCIPsetIsDualfeasEQ 5278 #undef SCIPsetIsDualfeasLT 5279 #undef SCIPsetIsDualfeasLE 5280 #undef SCIPsetIsDualfeasGT 5281 #undef SCIPsetIsDualfeasGE 5282 #undef SCIPsetIsDualfeasZero 5283 #undef SCIPsetIsDualfeasPositive 5284 #undef SCIPsetIsDualfeasNegative 5285 #undef SCIPsetIsDualfeasIntegral 5286 #undef SCIPsetIsDualfeasFracIntegral 5287 #undef SCIPsetDualfeasFloor 5288 #undef SCIPsetDualfeasCeil 5289 #undef SCIPsetDualfeasRound 5290 #undef SCIPsetDualfeasFrac 5291 #undef SCIPsetIsLbBetter 5292 #undef SCIPsetIsUbBetter 5293 #undef SCIPsetIsEfficacious 5294 #undef SCIPsetIsRelEQ 5295 #undef SCIPsetIsRelLT 5296 #undef SCIPsetIsRelLE 5297 #undef SCIPsetIsRelGT 5298 #undef SCIPsetIsRelGE 5299 #undef SCIPsetIsSumRelEQ 5300 #undef SCIPsetIsSumRelLT 5301 #undef SCIPsetIsSumRelLE 5302 #undef SCIPsetIsSumRelGT 5303 #undef SCIPsetIsSumRelGE 5304 #undef SCIPsetIsUpdateUnreliable 5305 #undef SCIPsetInitializeRandomSeed 5306 #undef SCIPsetIsHugeValue 5307 #undef SCIPsetGetHugeValue 5314 assert(
set !=
NULL);
5316 return set->num_infinity;
5326 assert(
set !=
NULL);
5328 return set->num_hugeval;
5336 assert(
set !=
NULL);
5338 return set->num_epsilon;
5346 assert(
set !=
NULL);
5348 return set->num_sumepsilon;
5356 assert(
set !=
NULL);
5358 return set->num_feastol;
5366 assert(
set !=
NULL);
5368 return set->num_dualfeastol;
5376 assert(
set !=
NULL);
5379 return MIN(set->sepa_primfeastol, set->num_lpfeastol);
5381 return set->num_lpfeastol;
5389 return set->sepa_primfeastol;
5397 assert(
set !=
NULL);
5399 return set->num_barrierconvtol;
5407 assert(
set !=
NULL);
5409 return set->num_pseudocosteps;
5417 assert(
set !=
NULL);
5419 return set->num_pseudocostdelta;
5429 assert(
set !=
NULL);
5433 return MIN(100.0 * feastol, 0.0001);
5442 assert(
set !=
NULL);
5444 return set->num_recompfac;
5453 assert(
set !=
NULL);
5455 return (val >= set->num_infinity);
5464 assert(
set !=
NULL);
5466 return (val >= set->num_hugeval);
5476 assert(
set !=
NULL);
5484 return EPSEQ(val1, val2, set->num_epsilon);
5494 assert(
set !=
NULL);
5502 return EPSLT(val1, val2, set->num_epsilon);
5520 return EPSLE(val1, val2, set->num_epsilon);
5530 assert(
set !=
NULL);
5538 return EPSGT(val1, val2, set->num_epsilon);
5548 assert(
set !=
NULL);
5556 return EPSGE(val1, val2, set->num_epsilon);
5565 assert(
set !=
NULL);
5567 return EPSZ(val, set->num_epsilon);
5576 assert(
set !=
NULL);
5578 return EPSP(val, set->num_epsilon);
5587 assert(
set !=
NULL);
5589 return EPSN(val, set->num_epsilon);
5600 return EPSISINT(val, set->num_epsilon);
5612 assert(
set !=
NULL);
5615 scaledeps =
MAX(scaledeps, 1.0);
5616 scaledeps *=
set->num_epsilon;
5618 return EPSISINT(scalar*val, scaledeps);
5627 assert(
set !=
NULL);
5629 assert(
SCIPsetIsLE(
set, val, 1.0+set->num_epsilon));
5631 return (val <= set->num_epsilon);
5640 assert(
set !=
NULL);
5642 return EPSFLOOR(val, set->num_epsilon);
5651 assert(
set !=
NULL);
5653 return EPSCEIL(val, set->num_epsilon);
5662 assert(
set !=
NULL);
5664 return EPSROUND(val, set->num_epsilon);
5673 assert(
set !=
NULL);
5675 return EPSFRAC(val, set->num_epsilon);
5685 assert(
set !=
NULL);
5693 return EPSEQ(val1, val2, set->num_sumepsilon);
5703 assert(
set !=
NULL);
5711 return EPSLT(val1, val2, set->num_sumepsilon);
5721 assert(
set !=
NULL);
5729 return EPSLE(val1, val2, set->num_sumepsilon);
5739 assert(
set !=
NULL);
5747 return EPSGT(val1, val2, set->num_sumepsilon);
5757 assert(
set !=
NULL);
5765 return EPSGE(val1, val2, set->num_sumepsilon);
5774 assert(
set !=
NULL);
5776 return EPSZ(val, set->num_sumepsilon);
5785 assert(
set !=
NULL);
5787 return EPSP(val, set->num_sumepsilon);
5796 assert(
set !=
NULL);
5798 return EPSN(val, set->num_sumepsilon);
5809 return EPSFLOOR(val, set->num_sumepsilon);
5818 assert(
set !=
NULL);
5820 return EPSCEIL(val, set->num_sumepsilon);
5829 assert(
set !=
NULL);
5831 return EPSROUND(val, set->num_sumepsilon);
5840 assert(
set !=
NULL);
5842 return EPSFRAC(val, set->num_sumepsilon);
5864 return EPSZ(diff, set->num_feastol);
5886 return EPSN(diff, set->num_feastol);
5908 return !
EPSP(diff, set->num_feastol);
5930 return EPSP(diff, set->num_feastol);
5952 return !
EPSN(diff, set->num_feastol);
5961 assert(
set !=
NULL);
5963 return EPSZ(val, set->num_feastol);
5972 assert(
set !=
NULL);
5974 return EPSP(val, set->num_feastol);
5983 assert(
set !=
NULL);
5985 return EPSN(val, set->num_feastol);
5994 assert(
set !=
NULL);
5996 return EPSISINT(val, set->num_feastol);
6005 assert(
set !=
NULL);
6006 assert(
SCIPsetIsGE(
set, val, -2*set->num_feastol));
6007 assert(
SCIPsetIsLE(
set, val, 1.0+set->num_feastol));
6009 return (val <= set->num_feastol);
6018 assert(
set !=
NULL);
6020 return EPSFLOOR(val, set->num_feastol);
6029 assert(
set !=
NULL);
6031 return EPSCEIL(val, set->num_feastol);
6040 assert(
set !=
NULL);
6042 return EPSROUND(val, set->num_feastol);
6051 assert(
set !=
NULL);
6053 return EPSFRAC(val, set->num_feastol);
6065 assert(
set !=
NULL);
6075 return EPSZ(diff, set->num_dualfeastol);
6097 return EPSN(diff, set->num_dualfeastol);
6119 return !
EPSP(diff, set->num_dualfeastol);
6141 return EPSP(diff, set->num_dualfeastol);
6163 return !
EPSN(diff, set->num_dualfeastol);
6172 assert(
set !=
NULL);
6174 return EPSZ(val, set->num_dualfeastol);
6183 assert(
set !=
NULL);
6185 return EPSP(val, set->num_dualfeastol);
6194 assert(
set !=
NULL);
6196 return EPSN(val, set->num_dualfeastol);
6205 assert(
set !=
NULL);
6207 return EPSISINT(val, set->num_dualfeastol);
6216 assert(
set !=
NULL);
6217 assert(
SCIPsetIsGE(
set, val, -set->num_dualfeastol));
6218 assert(
SCIPsetIsLE(
set, val, 1.0+set->num_dualfeastol));
6220 return (val <= set->num_dualfeastol);
6229 assert(
set !=
NULL);
6231 return EPSFLOOR(val, set->num_dualfeastol);
6240 assert(
set !=
NULL);
6242 return EPSCEIL(val, set->num_dualfeastol);
6251 assert(
set !=
NULL);
6253 return EPSROUND(val, set->num_dualfeastol);
6262 assert(
set !=
NULL);
6264 return EPSFRAC(val, set->num_dualfeastol);
6280 assert(
set !=
NULL);
6284 if( oldlb < 0.0 && newlb >= 0.0 )
6288 eps =
MIN(oldub - oldlb, eps);
6289 return EPSGT(newlb, oldlb, set->num_boundstreps *
MAX(eps, 1e-3));
6305 assert(
set !=
NULL);
6309 if( oldub > 0.0 && newub <= 0.0 )
6313 eps =
MIN(oldub - oldlb, eps);
6314 return EPSLT(newub, oldub, set->num_boundstreps *
MAX(eps, 1e-3));
6324 assert(
set !=
NULL);
6327 return EPSP(efficacy, set->sepa_minefficacyroot);
6329 return EPSP(efficacy, set->sepa_minefficacy);
6341 assert(
set !=
NULL);
6351 return EPSZ(diff, set->num_epsilon);
6363 assert(
set !=
NULL);
6373 return EPSN(diff, set->num_epsilon);
6385 assert(
set !=
NULL);
6395 return !
EPSP(diff, set->num_epsilon);
6417 return EPSP(diff, set->num_epsilon);
6439 return !
EPSN(diff, set->num_epsilon);
6461 return EPSZ(diff, set->num_sumepsilon);
6483 return EPSN(diff, set->num_sumepsilon);
6505 return !
EPSP(diff, set->num_sumepsilon);
6527 return EPSP(diff, set->num_sumepsilon);
6549 return !
EPSN(diff, set->num_sumepsilon);
6571 assert(
set !=
NULL);
6573 quotient = ABS(oldvalue) /
MAX(ABS(newvalue), set->num_epsilon);
6575 return quotient >=
set->num_recompfac;
6581 const char* sourcefile,
6583 const char* formatstr,
6587 int subscipdepth = 0;
6591 assert( sourcefile !=
NULL );
6592 assert(
set !=
NULL );
6595 assert( scip !=
NULL );
6600 if ( subscipdepth > 0 )
6605 va_start(ap, formatstr);
6613 const char* formatstr,
6619 assert(
set !=
NULL );
6620 assert( set->scip !=
NULL );
6622 va_start(ap, formatstr);
6630 int initialseedvalue
6633 assert(
set !=
NULL);
6635 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_RETCODE SCIPheurFree(SCIP_HEUR **heur, SCIP_SET *set)
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_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
#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)
#define SCIPdebugFreeDebugData(set)
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_CONF_PREFERMIR
#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)
#define SCIP_DEFAULT_SEPA_FEASTOLFAC
SCIP_RETCODE SCIPsetGetStringParam(SCIP_SET *set, const char *name, char **value)
#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 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)
#define SCIP_DEFAULT_LIMIT_ABSGAP
#define SCIP_DEFAULT_BRANCH_FORCEALL
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
#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_Bool SCIPsetIsFeasIntegral(SCIP_SET *set, SCIP_Real val)
const char * SCIPeventhdlrGetName(SCIP_EVENTHDLR *eventhdlr)
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)
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)
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_CONF_APPLYMIR
#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_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)
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
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)
#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)
#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 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 copynlpis, SCIP_Bool *allvalid)
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_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_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_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 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)
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_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)
#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)
SCIP_Real SCIPsetSepaprimfeastol(SCIP_SET *set)
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
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 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)
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)
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)
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
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_SEPA_ORTHOFAC
#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)