A RetroSearch Logo

Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Search Query:

Showing content from https://scip.zib.de/doc/html/set_8c_source.php below:

SCIP Doxygen Documentation: set.c Source File

81#define SCIP_DEFAULT_BRANCH_SCOREFUNC 'p' 82#define SCIP_DEFAULT_BRANCH_SCOREFAC 0.167 84#define SCIP_DEFAULT_BRANCH_PREFERBINARY FALSE 85#define SCIP_DEFAULT_BRANCH_CLAMP 0.2 87#define SCIP_DEFAULT_BRANCH_MIDPULL 0.75 88#define SCIP_DEFAULT_BRANCH_MIDPULLRELDOMTRIG 0.5 89#define SCIP_DEFAULT_BRANCH_LPGAINNORMALIZE 's' 90#define SCIP_DEFAULT_BRANCH_DELAYPSCOST TRUE 91#define SCIP_DEFAULT_BRANCH_DIVINGPSCOST TRUE 92#define SCIP_DEFAULT_BRANCH_FORCEALL FALSE 94#define SCIP_DEFAULT_BRANCH_FIRSTSBCHILD 'a' 95#define SCIP_DEFAULT_BRANCH_CHECKSBSOL TRUE 96#define SCIP_DEFAULT_BRANCH_ROUNDSBSOL TRUE 97#define SCIP_DEFAULT_BRANCH_SUMADJUSTSCORE FALSE 101#define SCIP_DEFAULT_COMPR_ENABLE FALSE 106#define SCIP_DEFAULT_CONF_ENABLE TRUE 107#define SCIP_DEFAULT_CONF_MAXVARSFAC 0.15 108#define SCIP_DEFAULT_CONF_MINMAXVARS 0 109#define SCIP_DEFAULT_CONF_MAXLPLOOPS 2 111#define SCIP_DEFAULT_CONF_LPITERATIONS 10 113#define SCIP_DEFAULT_CONF_USEPROP TRUE 114#define SCIP_DEFAULT_CONF_USEINFLP 'b' 117#define SCIP_DEFAULT_CONF_USEBOUNDLP 'b' 120#define SCIP_DEFAULT_CONF_USESB TRUE 122#define SCIP_DEFAULT_CONF_USEPSEUDO TRUE 123#define SCIP_DEFAULT_CONF_PREFINFPROOF TRUE 124#define SCIP_DEFAULT_CONF_SEPARATE TRUE 125#define SCIP_DEFAULT_CONF_DYNAMIC TRUE 130#define SCIP_DEFAULT_CONF_MAXSTORESIZE 10000 131#define SCIP_DEFAULT_CONF_RECONVLEVELS -1 133#define SCIP_DEFAULT_CONF_CLEANBNDDEPEND TRUE 134#define SCIP_DEFAULT_CONF_FUIPLEVELS -1 136#define SCIP_DEFAULT_CONF_INTERCONSS -1 138#define SCIP_DEFAULT_CONF_MAXCONSS 10 140#define SCIP_DEFAULT_CONF_PREFERBINARY FALSE 141#define SCIP_DEFAULT_CONF_ALLOWLOCAL TRUE 142#define SCIP_DEFAULT_CONF_SETTLELOCAL FALSE 144#define SCIP_DEFAULT_CONF_REPROPAGATE TRUE 146#define SCIP_DEFAULT_CONF_KEEPREPROP TRUE 147#define SCIP_DEFAULT_CONF_REMOVEABLE TRUE 148#define SCIP_DEFAULT_CONF_DEPTHSCOREFAC 1.0 149#define SCIP_DEFAULT_CONF_PROOFSCOREFAC 1.0 150#define SCIP_DEFAULT_CONF_UPLOCKSCOREFAC 0.0 151#define SCIP_DEFAULT_CONF_DOWNLOCKSCOREFAC 0.0 152#define SCIP_DEFAULT_CONF_SCOREFAC 0.98 153#define SCIP_DEFAULT_CONF_RESTARTNUM 0 155#define SCIP_DEFAULT_CONF_RESTARTFAC 1.5 156#define SCIP_DEFAULT_CONF_IGNORERELAXEDBD FALSE 157#define SCIP_DEFAULT_CONF_MAXVARSDETECTIMPLIEDBOUNDS 250 158#define SCIP_DEFAULT_CONF_FULLSHORTENCONFLICT TRUE 159#define SCIP_DEFAULT_CONF_CONFLITWEIGHT 0.0 160#define SCIP_DEFAULT_CONF_CONFLITGRAPHWEIGHT 1.0 161#define SCIP_DEFAULT_CONF_WEIGHTSIZE 0.001 162#define SCIP_DEFAULT_CONF_WEIGHTREPROPDEPTH 0.1 163#define SCIP_DEFAULT_CONF_WEIGHTVALIDDEPTH 1.0 164#define SCIP_DEFAULT_CONF_MINIMPROVE 0.05 168#define SCIP_DEFAULT_CONF_SEPAALTPROOFS FALSE 169#define SCIP_DEFAULT_CONF_USELOCALROWS TRUE 173#define SCIP_DEFAULT_CONS_AGELIMIT 0 175#define SCIP_DEFAULT_CONS_OBSOLETEAGE -1 177#define SCIP_DEFAULT_CONS_DISABLEENFOPS FALSE 182#define SCIP_DEFAULT_DISP_VERBLEVEL SCIP_VERBLEVEL_HIGH 183#define SCIP_DEFAULT_DISP_WIDTH 143 184#define SCIP_DEFAULT_DISP_FREQ 100 185#define SCIP_DEFAULT_DISP_HEADERFREQ 15 186#define SCIP_DEFAULT_DISP_LPINFO FALSE 187#define SCIP_DEFAULT_DISP_ALLVIOLS FALSE 188#define SCIP_DEFAULT_DISP_RELEVANTSTATS TRUE 192#define SCIP_DEFAULT_HEUR_USEUCTSUBSCIP FALSE 196#define SCIP_DEFAULT_HISTORY_VALUEBASED FALSE 197#define SCIP_DEFAULT_HISTORY_ALLOWMERGE FALSE 198#define SCIP_DEFAULT_HISTORY_ALLOWTRANSFER FALSE 202#define SCIP_DEFAULT_LIMIT_TIME 1e+20 203#define SCIP_DEFAULT_LIMIT_MEMORY SCIP_MEM_NOLIMIT 204#define SCIP_DEFAULT_LIMIT_GAP 0.0 205#define SCIP_DEFAULT_LIMIT_ABSGAP 0.0 207#define SCIP_DEFAULT_LIMIT_PRIMAL SCIP_INVALID 208#define SCIP_DEFAULT_LIMIT_DUAL SCIP_INVALID 209#define SCIP_DEFAULT_LIMIT_NODES -1LL 210#define SCIP_DEFAULT_LIMIT_STALLNODES -1LL 212#define SCIP_DEFAULT_LIMIT_SOLUTIONS -1 213#define SCIP_DEFAULT_LIMIT_BESTSOL -1 215#define SCIP_DEFAULT_LIMIT_MAXSOL 100 216#define SCIP_DEFAULT_LIMIT_MAXORIGSOL 10 217#define SCIP_DEFAULT_LIMIT_RESTARTS -1 218#define SCIP_DEFAULT_LIMIT_AUTORESTARTNODES -1 222#define SCIP_DEFAULT_LP_SOLVEFREQ 1 223#define SCIP_DEFAULT_LP_ITERLIM -1LL 224#define SCIP_DEFAULT_LP_ROOTITERLIM -1LL 225#define SCIP_DEFAULT_LP_SOLVEDEPTH -1 226#define SCIP_DEFAULT_LP_INITALGORITHM 's' 228#define SCIP_DEFAULT_LP_RESOLVEALGORITHM 's' 230#define SCIP_DEFAULT_LP_PRICING 'l' 233#define SCIP_DEFAULT_LP_CLEARINITIALPROBINGLP TRUE 235#define SCIP_DEFAULT_LP_RESOLVERESTORE FALSE 236#define SCIP_DEFAULT_LP_FREESOLVALBUFFERS FALSE 237#define SCIP_DEFAULT_LP_COLAGELIMIT 10 239#define SCIP_DEFAULT_LP_ROWAGELIMIT 10 241#define SCIP_DEFAULT_LP_CLEANUPCOLS FALSE 242#define SCIP_DEFAULT_LP_CLEANUPCOLSROOT FALSE 243#define SCIP_DEFAULT_LP_CLEANUPROWS TRUE 244#define SCIP_DEFAULT_LP_CLEANUPROWSROOT TRUE 245#define SCIP_DEFAULT_LP_CHECKSTABILITY TRUE 246#define SCIP_DEFAULT_LP_CONDITIONLIMIT -1.0 247#define SCIP_DEFAULT_LP_MARKOWITZ 0.01 248#define SCIP_DEFAULT_LP_CHECKPRIMFEAS TRUE 249#define SCIP_DEFAULT_LP_CHECKDUALFEAS TRUE 250#define SCIP_DEFAULT_LP_CHECKFARKAS TRUE 251#define SCIP_DEFAULT_LP_FASTMIP 1 252#define SCIP_DEFAULT_LP_SCALING 1 253#define SCIP_DEFAULT_LP_PRESOLVING TRUE 254#define SCIP_DEFAULT_LP_LEXDUALALGO FALSE 255#define SCIP_DEFAULT_LP_LEXDUALROOTONLY TRUE 256#define SCIP_DEFAULT_LP_LEXDUALMAXROUNDS 2 257#define SCIP_DEFAULT_LP_LEXDUALBASIC FALSE 258#define SCIP_DEFAULT_LP_LEXDUALSTALLING TRUE 259#define SCIP_DEFAULT_LP_DISABLECUTOFF 2 260#define SCIP_DEFAULT_LP_ROWREPSWITCH 1.2 262#define SCIP_DEFAULT_LP_THREADS 0 263#define SCIP_DEFAULT_LP_RESOLVEITERFAC -1.0 265#define SCIP_DEFAULT_LP_RESOLVEITERMIN 1000 266#define SCIP_DEFAULT_LP_SOLUTIONPOLISHING 3 267#define SCIP_DEFAULT_LP_REFACTORINTERVAL 0 268#define SCIP_DEFAULT_LP_ALWAYSGETDUALS FALSE 272#define SCIP_DEFAULT_NLP_SOLVER "" 273#define SCIP_DEFAULT_NLP_DISABLE FALSE 278#define SCIP_DEFAULT_MEM_SAVEFAC 0.8 279#define SCIP_DEFAULT_MEM_TREEGROWFAC 2.0 280#define SCIP_DEFAULT_MEM_PATHGROWFAC 2.0 281#define SCIP_DEFAULT_MEM_TREEGROWINIT 65536 282#define SCIP_DEFAULT_MEM_PATHGROWINIT 256 287#define SCIP_DEFAULT_MISC_CATCHCTRLC TRUE 288#define SCIP_DEFAULT_MISC_USEVARTABLE TRUE 289#define SCIP_DEFAULT_MISC_USECONSTABLE TRUE 290#define SCIP_DEFAULT_MISC_USESMALLTABLES FALSE 291#define SCIP_DEFAULT_MISC_EXACTSOLVE FALSE 292#define SCIP_DEFAULT_MISC_RESETSTAT TRUE 297#define SCIP_DEFAULT_MISC_IMPROVINGSOLS FALSE 298#define SCIP_DEFAULT_MISC_PRINTREASON TRUE 299#define SCIP_DEFAULT_MISC_ESTIMEXTERNMEM TRUE 300#define SCIP_DEFAULT_MISC_AVOIDMEMOUT TRUE 301#define SCIP_DEFAULT_MISC_TRANSORIGSOLS TRUE 302#define SCIP_DEFAULT_MISC_TRANSSOLSORIG TRUE 303#define SCIP_DEFAULT_MISC_CALCINTEGRAL TRUE 304#define SCIP_DEFAULT_MISC_FINITESOLSTORE FALSE 305#define SCIP_DEFAULT_MISC_OUTPUTORIGSOL TRUE 306#define SCIP_DEFAULT_MISC_ALLOWSTRONGDUALREDS TRUE 307#define SCIP_DEFAULT_MISC_ALLOWWEAKDUALREDS TRUE 308#define SCIP_DEFAULT_MISC_REFERENCEVALUE 1e99 309#define SCIP_DEFAULT_MISC_USESYMMETRY 7 313#define SCIP_DEFAULT_MISC_SCALEOBJ TRUE 314#define SCIP_DEFAULT_MISC_SHOWDIVINGSTATS FALSE 316#ifdef WITH_DEBUG_SOLUTION 317#define SCIP_DEFAULT_MISC_DEBUGSOLUTION "-" 321#define SCIP_DEFAULT_RANDOM_RANDSEEDSHIFT 0 322#define SCIP_DEFAULT_RANDOM_PERMUTATIONSEED 0 323#define SCIP_DEFAULT_RANDOM_LPSEED 0 324#define SCIP_DEFAULT_RANDOM_PERMUTECONSS TRUE 325#define SCIP_DEFAULT_RANDOM_PERMUTEVARS FALSE 330#define SCIP_DEFAULT_NODESEL_CHILDSEL 'h' 336#define SCIP_DEFAULT_PRESOL_ABORTFAC 8e-04 338#define SCIP_DEFAULT_PRESOL_MAXROUNDS -1 339#define SCIP_DEFAULT_PRESOL_MAXRESTARTS -1 340#define SCIP_DEFAULT_PRESOL_CLQTABLEFAC 2.0 341#define SCIP_DEFAULT_PRESOL_RESTARTFAC 0.025 343#define SCIP_DEFAULT_PRESOL_IMMRESTARTFAC 0.10 345#define SCIP_DEFAULT_PRESOL_SUBRESTARTFAC 1.00 347#define SCIP_DEFAULT_PRESOL_RESTARTMINRED 0.10 349#define SCIP_DEFAULT_PRESOL_DONOTMULTAGGR FALSE 350#define SCIP_DEFAULT_PRESOL_DONOTAGGR FALSE 355#define SCIP_DEFAULT_PRICE_ABORTFAC 2.0 357#define SCIP_DEFAULT_PRICE_MAXVARS 100 358#define SCIP_DEFAULT_PRICE_MAXVARSROOT 2000 359#define SCIP_DEFAULT_PRICE_DELVARS FALSE 361#define SCIP_DEFAULT_PRICE_DELVARSROOT FALSE 365#define SCIP_DEFAULT_DECOMP_BENDERSLABELS FALSE 366#define SCIP_DEFAULT_DECOMP_APPLYBENDERS FALSE 367#define SCIP_DEFAULT_DECOMP_MAXGRAPHEDGE 10000 368#define SCIP_DEFAULT_DECOMP_DISABLEMEASURES FALSE 371#define SCIP_DEFAULT_BENDERS_SOLTOL 1e-6 372#define SCIP_DEFAULT_BENDERS_CUTLPSOL TRUE 373#define SCIP_DEFAULT_BENDERS_COPYBENDERS TRUE 377#define SCIP_DEFAULT_REOPT_OBJSIMSOL -1.0 379#define SCIP_DEFAULT_REOPT_OBJSIMROOTLP 0.8 380#define SCIP_DEFAULT_REOPT_OBJSIMDELAY -1.0 382#define SCIP_DEFAULT_REOPT_VARORDERINTERDICTION 'd' 386#define SCIP_DEFAULT_REOPT_MAXSAVEDNODES INT_MAX 387#define SCIP_DEFAULT_REOPT_MAXDIFFOFNODES INT_MAX 389#define SCIP_DEFAULT_REOPT_FORCEHEURRESTART 3 392#define SCIP_DEFAULT_REOPT_SAVESOLS INT_MAX 393#define SCIP_DEFAULT_REOPT_SOLVELP 1 394#define SCIP_DEFAULT_REOPT_SOLVELPDIFF 1 395#define SCIP_DEFAULT_REOPT_ENABLE FALSE 396#define SCIP_DEFAULT_REOPT_SEPAGLBINFSUBTREES TRUE 397#define SCIP_DEFAULT_REOPT_SEPABESTSOL FALSE 400#define SCIP_DEFAULT_REOPT_STOREVARHISTOTY FALSE 403#define SCIP_DEFAULT_REOPT_USEPSCOST FALSE 404#define SCIP_DEFAULT_REOPT_COMMONTIMELIMIT FALSE 405#define SCIP_DEFAULT_REOPT_SHRINKINNER TRUE 408#define SCIP_DEFAULT_REOPT_STRONGBRANCHINIT TRUE 411#define SCIP_DEFAULT_REOPT_REDUCETOFRONTIER TRUE 412#define SCIP_DEFAULT_REOPT_SAVEPROP FALSE 413#define SCIP_DEFAULT_REOPT_USESPLITCONS TRUE 416#define SCIP_DEFAULT_REOPT_USECUTS FALSE 417#define SCIP_DEFAULT_REOPT_MAXCUTAGE 0 421#define SCIP_DEFAULT_PROP_MAXROUNDS 100 422#define SCIP_DEFAULT_PROP_MAXROUNDSROOT 1000 423#define SCIP_DEFAULT_PROP_ABORTONCUTOFF TRUE 429#define SCIP_DEFAULT_SEPA_MAXBOUNDDIST 1.0 432#define SCIP_DEFAULT_SEPA_MAXLOCALBOUNDDIST 0.0 435#define SCIP_DEFAULT_SEPA_MAXCOEFRATIO 1e+4 436#define SCIP_DEFAULT_SEPA_MAXCOEFRATIOFACROWPREP 10.0 437#define SCIP_DEFAULT_SEPA_MINEFFICACY 1e-4 438#define SCIP_DEFAULT_SEPA_MINEFFICACYROOT 1e-4 439#define SCIP_DEFAULT_SEPA_ORTHOFUNC 'e' 440#define SCIP_DEFAULT_SEPA_EFFICACYNORM 'e' 442#define SCIP_DEFAULT_SEPA_CUTSELRESTART 'a' 443#define SCIP_DEFAULT_SEPA_CUTSELSUBSCIP 'a' 444#define SCIP_DEFAULT_SEPA_FILTERCUTPOOLREL FALSE 445#define SCIP_DEFAULT_SEPA_MAXRUNS -1 446#define SCIP_DEFAULT_SEPA_MAXROUNDS -1 447#define SCIP_DEFAULT_SEPA_MAXROUNDSROOT -1 448#define SCIP_DEFAULT_SEPA_MAXROUNDSROOTSUBRUN -1 449#define SCIP_DEFAULT_SEPA_MAXADDROUNDS 1 451#define SCIP_DEFAULT_SEPA_MAXSTALLROUNDSROOT 10 453#define SCIP_DEFAULT_SEPA_MAXSTALLROUNDS 1 455#define SCIP_DEFAULT_SEPA_MAXCUTSGENFACTOR 2.0 456#define SCIP_DEFAULT_SEPA_MAXCUTSROOTGENFACTOR 2.0 457#define SCIP_DEFAULT_SEPA_MAXCUTS 100 458#define SCIP_DEFAULT_SEPA_MAXCUTSROOT 2000 459#define SCIP_DEFAULT_SEPA_CUTAGELIMIT 80 461#define SCIP_DEFAULT_SEPA_POOLFREQ 10 462#define SCIP_DEFAULT_SEPA_MINACTIVITYQUOT 0.8 466#define SCIP_DEFAULT_PARALLEL_MODE 1 468#define SCIP_DEFAULT_PARALLEL_MINNTHREADS 1 469#define SCIP_DEFAULT_PARALLEL_MAXNTHREADS 8 472#define SCIP_DEFAULT_CONCURRENT_CHANGESEEDS TRUE 473#define SCIP_DEFAULT_CONCURRENT_CHANGECHILDSEL TRUE 474#define SCIP_DEFAULT_CONCURRENT_COMMVARBNDS TRUE 475#define SCIP_DEFAULT_CONCURRENT_PRESOLVEBEFORE TRUE 476#define SCIP_DEFAULT_CONCURRENT_INITSEED 5131912 477#define SCIP_DEFAULT_CONCURRENT_FREQINIT 10.0 479#define SCIP_DEFAULT_CONCURRENT_FREQMAX 10.0 481#define SCIP_DEFAULT_CONCURRENT_FREQFACTOR 1.5 482#define SCIP_DEFAULT_CONCURRENT_TARGETPROGRESS 0.001 484#define SCIP_DEFAULT_CONCURRENT_MAXNSOLS 3 485#define SCIP_DEFAULT_CONCURRENT_MAXNSYNCDELAY 7 486#define SCIP_DEFAULT_CONCURRENT_MINSYNCDELAY 10.0 487#define SCIP_DEFAULT_CONCURRENT_NBESTSOLS 10 488#define SCIP_DEFAULT_CONCURRENT_PARAMSETPREFIX "" 493#define SCIP_DEFAULT_TIME_CLOCKTYPE SCIP_CLOCKTYPE_WALL 494#define SCIP_DEFAULT_TIME_ENABLED TRUE 495#define SCIP_DEFAULT_TIME_READING FALSE 496#define SCIP_DEFAULT_TIME_RARECLOCKCHECK FALSE 497#define SCIP_DEFAULT_TIME_STATISTICTIMING TRUE 498#define SCIP_DEFAULT_TIME_NLPIEVAL FALSE 503#define SCIP_DEFAULT_VISUAL_VBCFILENAME "-" 504#define SCIP_DEFAULT_VISUAL_BAKFILENAME "-" 505#define SCIP_DEFAULT_VISUAL_REALTIME TRUE 506#define SCIP_DEFAULT_VISUAL_DISPSOLS FALSE 507#define SCIP_DEFAULT_VISUAL_DISPLB FALSE 508#define SCIP_DEFAULT_VISUAL_OBJEXTERN TRUE 513#define SCIP_DEFAULT_READ_INITIALCONSS TRUE 514#define SCIP_DEFAULT_READ_DYNAMICCONSS TRUE 515#define SCIP_DEFAULT_READ_DYNAMICCOLS FALSE 516#define SCIP_DEFAULT_READ_DYNAMICROWS FALSE 517#define SCIP_DEFAULT_WRITE_GENNAMES_OFFSET 0 524#define SCIP_DEFAULT_WRITE_ALLCONSS FALSE 525#define SCIP_DEFAULT_PRINTZEROS FALSE 539

assert(initsize >= 0);

540

assert(growfac >= 1.0);

543 if

( growfac == 1.0 )

544

size =

MAX

(initsize, num);

550

initsize =

MAX

(initsize, 4);

555 while

( size < num && size > oldsize )

558

size = (int)(growfac * size + initsize);

562 if

( size <= oldsize )

566

assert(size >= initsize);

646 SCIPerrorMessage

(

"The infinity value of the LP solver has to be at least as large as the one of SCIP.\n"

);

690 int

newarraygrowinit;

708

assert( param !=

NULL

);

725

assert( param !=

NULL

);

731 SCIPerrorMessage

(

"Cannot turn on symmetry handling during (pre)solving or change method.\n"

);

746

assert(messagehdlr !=

NULL

);

748 if

(

set

->reopt_enable )

808 for

( i =

set

->nreaders - 1; i >= 0; --i )

811 for

( i =

set

->npricers - 1; i >= 0; --i )

814 for

( i =

set

->nconshdlrs - 1; i >= 0; --i )

817 for

( i =

set

->nconflicthdlrs - 1; i >= 0; --i )

820 for

( i =

set

->npresols - 1; i >= 0; --i )

823 for

( i =

set

->nrelaxs - 1; i >= 0; --i )

826 for

( i =

set

->nsepas - 1; i >= 0; --i )

829 for

( i =

set

->nprops - 1; i >= 0; --i )

832 for

( i =

set

->nheurs - 1; i >= 0; --i )

835 for

( i =

set

->neventhdlrs - 1; i >= 0; --i )

838 for

( i =

set

->nnodesels - 1; i >= 0; --i )

841 for

( i =

set

->ncutsels - 1; i >= 0; --i )

844 for

( i =

set

->nbranchrules - 1; i >= 0; --i )

888

assert(sourceset !=

NULL

);

889

assert(targetset !=

NULL

);

890

assert(sourceset != targetset);

891

assert(allvalid !=

NULL

);

898 for

( p = 0; p < sourceset->

ndialogs

; ++p )

908 for

( p = 0; p < sourceset->

npricers

; ++p )

912

*allvalid = *allvalid && valid;

929 for

( p = 0; p < sourceset->

nconshdlrs

; ++p )

935

*allvalid = *allvalid && valid;

949 for

( p = 0; p < sourceset->

nreaders

; ++p )

965 if

( copypresolvers && sourceset->

presols

!=

NULL

)

967 for

( p = 0; p < sourceset->

npresols

; ++p )

974 if

( copynodeselectors && sourceset->

nodesels

!=

NULL

)

976 for

( p = 0; p < sourceset->

nnodesels

; ++p )

1002 if

( copyrelaxators && sourceset->

relaxs

!=

NULL

)

1004 for

( p = 0; p < sourceset->

nrelaxs

; ++p )

1011 if

( copyheuristics && sourceset->

heurs

!=

NULL

)

1013 for

( p = 0; p < sourceset->

nheurs

; ++p )

1020 if

( copypropagators && sourceset->

props

!=

NULL

)

1022 for

( p = 0; p < sourceset->

nprops

; ++p )

1029 if

( copyseparators && sourceset->

sepas

!=

NULL

)

1031 for

( p = 0; p < sourceset->

nsepas

; ++p )

1038 if

( copycutselectors && sourceset->

cutsels

!=

NULL

)

1040 for

( p = 0; p < sourceset->

ncutsels

; ++p )

1049 for

( p = 0; p < sourceset->

nexprhdlrs

; ++p )

1056 if

( copynlpis && sourceset->

nlpis

!=

NULL

)

1058 for

( p = 0; p < sourceset->

nnlpis

; ++p )

1065 if

( copydisplays && sourceset->

disps

!=

NULL

)

1067 for

( p = 0; p < sourceset->

ndisps

; ++p )

1074 if

( copytables && sourceset->

tables

!=

NULL

)

1076 for

( p = 0; p < sourceset->

ntables

; ++p )

1093

assert(sourceset !=

NULL

);

1094

assert(targetset !=

NULL

);

1095

assert(sourceset != targetset);

1117

(*set)->scip =

scip

;

1123

(*set)->readers =

NULL

;

1124

(*set)->nreaders = 0;

1125

(*set)->readerssize = 0;

1126

(*set)->pricers =

NULL

;

1127

(*set)->npricers = 0;

1128

(*set)->nactivepricers = 0;

1129

(*set)->pricerssize = 0;

1130

(*set)->pricerssorted =

FALSE

;

1131

(*set)->pricersnamesorted =

FALSE

;

1132

(*set)->conshdlrs =

NULL

;

1133

(*set)->conshdlrs_sepa =

NULL

;

1134

(*set)->conshdlrs_enfo =

NULL

;

1135

(*set)->conshdlrs_include =

NULL

;

1136

(*set)->nconshdlrs = 0;

1137

(*set)->conshdlrssize = 0;

1138

(*set)->conflicthdlrs =

NULL

;

1139

(*set)->nconflicthdlrs = 0;

1140

(*set)->conflicthdlrssize = 0;

1141

(*set)->conflicthdlrssorted =

FALSE

;

1142

(*set)->conflicthdlrsnamesorted =

FALSE

;

1143

(*set)->benders =

NULL

;

1144

(*set)->nbenders = 0;

1145

(*set)->nactivebenders = 0;

1146

(*set)->benderssize = 0;

1147

(*set)->benderssorted =

FALSE

;

1148

(*set)->bendersnamesorted =

FALSE

;

1150

(*set)->debugsoldata =

NULL

;

1153

(*set)->presols =

NULL

;

1154

(*set)->npresols = 0;

1155

(*set)->presolssize = 0;

1156

(*set)->presolssorted =

FALSE

;

1157

(*set)->presolsnamesorted =

FALSE

;

1158

(*set)->relaxs =

NULL

;

1159

(*set)->nrelaxs = 0;

1160

(*set)->relaxssize = 0;

1161

(*set)->relaxssorted =

FALSE

;

1162

(*set)->relaxsnamesorted =

FALSE

;

1163

(*set)->sepas =

NULL

;

1165

(*set)->sepassize = 0;

1166

(*set)->sepassorted =

FALSE

;

1167

(*set)->sepasnamesorted =

FALSE

;

1168

(*set)->props =

NULL

;

1169

(*set)->props_presol =

NULL

;

1171

(*set)->propssize = 0;

1172

(*set)->propssorted =

FALSE

;

1173

(*set)->propspresolsorted =

FALSE

;

1174

(*set)->propsnamesorted =

FALSE

;

1175

(*set)->concsolvertypes =

NULL

;

1176

(*set)->nconcsolvertypes = 0;

1177

(*set)->concsolvertypessize = 0;

1178

(*set)->concsolvers =

NULL

;

1179

(*set)->nconcsolvers = 0;

1180

(*set)->concsolverssize = 0;

1181

(*set)->concurrent_paramsetprefix =

NULL

;

1182

(*set)->cutsels =

NULL

;

1183

(*set)->ncutsels = 0;

1184

(*set)->cutselssize = 0;

1185

(*set)->cutselssorted =

FALSE

;

1186

(*set)->heurs =

NULL

;

1188

(*set)->heurssize = 0;

1189

(*set)->heurssorted =

FALSE

;

1190

(*set)->heursnamesorted =

FALSE

;

1191

(*set)->comprs =

NULL

;

1192

(*set)->ncomprs = 0;

1193

(*set)->comprssize = 0;

1194

(*set)->comprssorted =

FALSE

;

1195

(*set)->comprsnamesorted =

FALSE

;

1196

(*set)->eventhdlrs =

NULL

;

1197

(*set)->neventhdlrs = 0;

1198

(*set)->eventhdlrssize = 0;

1199

(*set)->nodesels =

NULL

;

1200

(*set)->nnodesels = 0;

1201

(*set)->nodeselssize = 0;

1202

(*set)->nodesel =

NULL

;

1203

(*set)->branchrules =

NULL

;

1204

(*set)->nbranchrules = 0;

1205

(*set)->branchrulessize = 0;

1206

(*set)->branchrulessorted =

FALSE

;

1207

(*set)->branchrulesnamesorted =

FALSE

;

1208

(*set)->banditvtables =

NULL

;

1209

(*set)->banditvtablessize = 0;

1210

(*set)->nbanditvtables = 0;

1211

(*set)->disps =

NULL

;

1213

(*set)->dispssize = 0;

1214

(*set)->tables =

NULL

;

1215

(*set)->ntables = 0;

1216

(*set)->tablessize = 0;

1217

(*set)->tablessorted =

FALSE

;

1218

(*set)->dialogs =

NULL

;

1219

(*set)->ndialogs = 0;

1220

(*set)->dialogssize = 0;

1221

(*set)->exprhdlrs =

NULL

;

1222

(*set)->exprhdlrvar =

NULL

;

1223

(*set)->exprhdlrval =

NULL

;

1224

(*set)->exprhdlrsum =

NULL

;

1225

(*set)->exprhdlrproduct =

NULL

;

1226

(*set)->exprhdlrpow =

NULL

;

1227

(*set)->nexprhdlrs = 0;

1228

(*set)->exprhdlrssize = 0;

1229

(*set)->exprhdlrssorted =

FALSE

;

1230

(*set)->nlpis =

NULL

;

1232

(*set)->nlpissize = 0;

1233

(*set)->nlpissorted =

FALSE

;

1234

(*set)->limitchanged =

FALSE

;

1235

(*set)->subscipsoff =

FALSE

;

1236

(*set)->extcodenames =

NULL

;

1237

(*set)->extcodedescs =

NULL

;

1238

(*set)->nextcodes = 0;

1239

(*set)->extcodessize = 0;

1240

(*set)->visual_vbcfilename =

NULL

;

1241

(*set)->visual_bakfilename =

NULL

;

1242

(*set)->nlp_solver =

NULL

;

1243

(*set)->nlp_disable =

FALSE

;

1245

(*set)->misc_debugsol =

NULL

;

1248

(*set)->istimelimitfinite =

FALSE

;

1252 "branching/scorefunc"

,

1253 "branching score function ('s'um, 'p'roduct, 'q'uotient)"

,

1257 "branching/scorefac"

,

1258 "branching score factor to weigh downward and upward gain prediction in sum score function"

,

1262 "branching/preferbinary"

,

1263 "should branching on binary variables be preferred?"

,

1268 "minimal relative distance of branching point to bounds when branching on a continuous variable"

,

1272 "branching/midpull"

,

1273 "fraction by which to move branching point of a continuous variable towards the middle of the domain; a value of 1.0 leads to branching always in the middle of the domain"

,

1277 "branching/midpullreldomtrig"

,

1278 "multiply midpull by relative domain width if the latter is below this value"

,

1282 "branching/lpgainnormalize"

,

1283 "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)"

,

1287 "branching/delaypscostupdate"

,

1288 "should updating pseudo costs for continuous variables be delayed to the time after separation?"

,

1292 "branching/divingpscost"

,

1293 "should pseudo costs be updated also in diving and probing mode?"

,

1297 "branching/forceallchildren"

,

1298 "should all strong branching children be regarded even if one is detected to be infeasible? (only with propagation)"

,

1302 "branching/firstsbchild"

,

1303 "child node to be regarded first during strong branching (only with propagation): 'u'p child, 'd'own child, 'h'istory-based, or 'a'utomatic"

,

1307 "branching/checksol"

,

1308 "should LP solutions during strong branching with propagation be checked for feasibility?"

,

1312 "branching/roundsbsol"

,

1313 "should LP solutions during strong branching with propagation be rounded? (only when checksbsol=TRUE)"

,

1317 "branching/sumadjustscore"

,

1318 "score adjustment near zero by adding epsilon (TRUE) or using maximum (FALSE)"

,

1324 "compression/enable"

,

1325 "should automatic tree compression after the presolving be enabled?"

,

1332 "should conflict analysis be enabled?"

,

1336 "conflict/cleanboundexceedings"

,

1337 "should conflicts based on an old cutoff bound be removed from the conflict pool after improving the primal bound?"

,

1341 "conflict/uselocalrows"

,

1342 "use local rows to construct infeasibility proofs"

,

1346 "conflict/useprop"

,

1347 "should propagation conflict analysis be used?"

,

1351 "conflict/useinflp"

,

1352 "should infeasible LP conflict analysis be used? ('o'ff, 'c'onflict graph, 'd'ual ray, 'b'oth conflict graph and dual ray)"

,

1356 "conflict/useboundlp"

,

1357 "should bound exceeding LP conflict analysis be used? ('o'ff, 'c'onflict graph, 'd'ual ray, 'b'oth conflict graph and dual ray)"

,

1362 "should infeasible/bound exceeding strong branching conflict analysis be used?"

,

1366 "conflict/usepseudo"

,

1367 "should pseudo solution conflict analysis be used?"

,

1371 "conflict/maxvarsfac"

,

1372 "maximal fraction of variables involved in a conflict constraint"

,

1376 "conflict/minmaxvars"

,

1377 "minimal absolute maximum of variables involved in a conflict constraint"

,

1381 "conflict/maxlploops"

,

1382 "maximal number of LP resolving loops during conflict analysis (-1: no limit)"

,

1386 "conflict/lpiterations"

,

1387 "maximal number of LP iterations in each LP resolving loop (-1: no limit)"

,

1391 "conflict/fuiplevels"

,

1392 "number of depth levels up to which first UIP's are used in conflict analysis (-1: use All-FirstUIP rule)"

,

1396 "conflict/interconss"

,

1397 "maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)"

,

1401 "conflict/reconvlevels"

,

1402 "number of depth levels up to which UIP reconvergence constraints are generated (-1: generate reconvergence constraints in all depth levels)"

,

1406 "conflict/maxconss"

,

1407 "maximal number of conflict constraints accepted at an infeasible node (-1: use all generated conflict constraints)"

,

1411 "conflict/maxstoresize"

,

1412 "maximal size of conflict store (-1: auto, 0: disable storage)"

,

1416 "conflict/preferbinary"

,

1417 "should binary conflicts be preferred?"

,

1421 "conflict/prefinfproof"

,

1422 "prefer infeasibility proof to boundexceeding proof"

,

1426 "conflict/allowlocal"

,

1427 "should conflict constraints be generated that are only valid locally?"

,

1431 "conflict/settlelocal"

,

1432 "should conflict constraints be attached only to the local subtree where they can be useful?"

,

1436 "conflict/repropagate"

,

1437 "should earlier nodes be repropagated in order to replace branching decisions by deductions?"

,

1441 "conflict/keepreprop"

,

1442 "should constraints be kept for repropagation even if they are too long?"

,

1446 "conflict/separate"

,

1447 "should the conflict constraints be separated?"

,

1451 "conflict/dynamic"

,

1452 "should the conflict constraints be subject to aging?"

,

1456 "conflict/removable"

,

1457 "should the conflict's relaxations be subject to LP aging and cleanup?"

,

1461 "conflict/graph/depthscorefac"

,

1462 "score factor for depth level in bound relaxation heuristic"

,

1466 "conflict/proofscorefac"

,

1467 "score factor for impact on acticity in bound relaxation heuristic"

,

1471 "conflict/uplockscorefac"

,

1472 "score factor for up locks in bound relaxation heuristic"

,

1476 "conflict/downlockscorefac"

,

1477 "score factor for down locks in bound relaxation heuristic"

,

1481 "conflict/scorefac"

,

1482 "factor to decrease importance of variables' earlier conflict scores"

,

1486 "conflict/restartnum"

,

1487 "number of successful conflict analysis calls that trigger a restart (0: disable conflict restarts)"

,

1491 "conflict/restartfac"

,

1492 "factor to increase restartnum with after each restart"

,

1496 "conflict/ignorerelaxedbd"

,

1497 "should relaxed bounds be ignored?"

,

1501 "conflict/maxvarsdetectimpliedbounds"

,

1502 "maximal number of variables to try to detect global bound implications and shorten the whole conflict set (0: disabled)"

,

1506 "conflict/fullshortenconflict"

,

1507 "try to shorten the whole conflict set or terminate early (depending on the 'maxvarsdetectimpliedbounds' parameter)"

,

1511 "conflict/conflictweight"

,

1512 "the weight the VSIDS score is weight by updating the VSIDS for a variable if it is part of a conflict"

,

1516 "conflict/conflictgraphweight"

,

1517 "the weight the VSIDS score is weight by updating the VSIDS for a variable if it is part of a conflict graph"

,

1521 "conflict/minimprove"

,

1522 "minimal improvement of primal bound to remove conflicts based on a previous incumbent"

,

1525 "conflict/weightsize"

,

1526 "weight of the size of a conflict used in score calculation"

,

1529 "conflict/weightrepropdepth"

,

1530 "weight of the repropagation depth of a conflict used in score calculation"

,

1533 "conflict/weightvaliddepth"

,

1534 "weight of the valid depth of a conflict used in score calculation"

,

1537 "conflict/sepaaltproofs"

,

1538 "apply cut generating functions to construct alternative proofs"

,

1544 "constraints/agelimit"

,

1545 "maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)"

,

1549 "constraints/obsoleteage"

,

1550 "age of a constraint after which it is marked obsolete (0: dynamic, -1 do not mark constraints obsolete)"

,

1554 "constraints/disableenfops"

,

1555 "should enforcement of pseudo solution be disabled?"

,

1562 "display/verblevel"

,

1563 "verbosity level of output"

,

1569 "maximal number of characters in a node information line"

,

1571

SCIPparamChgdDispWidth,

NULL

) );

1574 "frequency for displaying node information lines"

,

1578 "display/headerfreq"

,

1579 "frequency for displaying header lines (every n'th node information line)"

,

1584 "should the LP solver display status messages?"

,

1588 "display/allviols"

,

1589 "display all violations for a given start solution / the best solution after the solving process?"

,

1593 "display/relevantstats"

,

1594 "should the relevant statistics be displayed at the end of solving?"

,

1600 "heuristics/useuctsubscip"

,

1601 "should setting of common subscip parameters include the activation of the UCT node selector?"

,

1606 "history/valuebased"

,

1607 "should statistics be collected for variable domain value pairs?"

,

1611 "history/allowmerge"

,

1612 "should variable histories be merged from sub-SCIPs whenever possible?"

,

1616 "history/allowtransfer"

,

1617 "should variable histories be transferred to initialize SCIP copies?"

,

1624 "maximal time in seconds to run"

,

1626

SCIPparamChgdLimit,

NULL

) );

1629 "maximal number of nodes to process (-1: no limit)"

,

1631

SCIPparamChgdLimit,

NULL

) );

1633 "limits/totalnodes"

,

1634 "maximal number of total nodes (incl. restarts) to process (-1: no limit)"

,

1636

SCIPparamChgdLimit,

NULL

) );

1638 "limits/stallnodes"

,

1639 "solving stops, if the given number of nodes was processed since the last improvement of the primal solution value (-1: no limit)"

,

1641

SCIPparamChgdLimit,

NULL

) );

1644 "maximal memory usage in MB; reported memory usage is lower than real memory usage!"

,

1646

SCIPparamChgdLimit,

NULL

) );

1649 "solving stops, if the relative gap = |primal - dual|/MIN(|dual|,|primal|) is below the given value, the gap is 'Infinity', if primal and dual bound have opposite signs"

,

1651

SCIPparamChgdLimit,

NULL

) );

1654 "solving stops, if the absolute gap = |primalbound - dualbound| is below the given value"

,

1656

SCIPparamChgdLimit,

NULL

) );

1658 "limits/objectivestop"

,

1659 "solving stops, if primal bound is at least as good as given value (deprecated primal)"

,

1661

SCIPparamChgdLimit,

NULL

) );

1663

--(*set)->paramset->nparams;

1666 "solving stops, if primal bound is at least as good as given value (alias objectivestop)"

,

1668

SCIPparamChgdLimit,

NULL

) );

1671 "solving stops, if dual bound is at least as good as given value"

,

1673

SCIPparamChgdLimit,

NULL

) );

1675 "limits/solutions"

,

1676 "solving stops, if the given number of solutions were found; this limit is first checked in presolving (-1: no limit)"

,

1678

SCIPparamChgdLimit,

NULL

) );

1681 "solving stops, if the given number of solution improvements were found (-1: no limit)"

,

1683

SCIPparamChgdLimit,

NULL

) );

1686 "maximal number of solutions to store in the solution storage"

,

1688

SCIPparamChgdLimit,

NULL

) );

1690 "limits/maxorigsol"

,

1691 "maximal number of solutions candidates to store in the solution storage of the original problem"

,

1693

SCIPparamChgdLimit,

NULL

) );

1696 "solving stops, if the given number of restarts was triggered (-1: no limit)"

,

1698

SCIPparamChgdLimit,

NULL

) );

1700 "limits/autorestartnodes"

,

1701 "if solve exceeds this number of nodes for the first time, an automatic restart is triggered (-1: no automatic restart)"

,

1703

SCIPparamChgdLimit,

NULL

) );

1708 "frequency for solving LP at the nodes (-1: never; 0: only root LP)"

,

1713 "iteration limit for each single LP solve (-1: no limit)"

,

1718 "iteration limit for initial root LP solve (-1: no limit)"

,

1723 "maximal depth for solving LP at the nodes (-1: no depth limit)"

,

1727 "lp/initalgorithm"

,

1728 "LP algorithm for solving initial LP relaxations (automatic 's'implex, 'p'rimal simplex, 'd'ual simplex, 'b'arrier, barrier with 'c'rossover)"

,

1732 "lp/resolvealgorithm"

,

1733 "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)"

,

1738 "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)"

,

1742 "lp/clearinitialprobinglp"

,

1743 "should lp state be cleared at the end of probing mode when lp was initially unsolved, e.g., when called right after presolving?"

,

1747 "lp/resolverestore"

,

1748 "should the LP be resolved to restore the state at start of diving (if FALSE we buffer the solution values)?"

,

1752 "lp/freesolvalbuffers"

,

1753 "should the buffers for storing LP solution values during diving be freed at end of diving?"

,

1758 "maximum age a dynamic column can reach before it is deleted from the LP (-1: don't delete columns due to aging)"

,

1763 "maximum age a dynamic row can reach before it is deleted from the LP (-1: don't delete rows due to aging)"

,

1768 "should new non-basic columns be removed after LP solving?"

,

1772 "lp/cleanupcolsroot"

,

1773 "should new non-basic columns be removed after root LP solving?"

,

1778 "should new basic rows be removed after LP solving?"

,

1782 "lp/cleanuprowsroot"

,

1783 "should new basic rows be removed after root LP solving?"

,

1787 "lp/checkstability"

,

1788 "should LP solver's return status be checked for stability?"

,

1792 "lp/conditionlimit"

,

1793 "maximum condition number of LP basis counted as stable (-1.0: no limit)"

,

1798 "minimal Markowitz threshold to control sparsity/stability in LU factorization"

,

1802 "lp/checkprimfeas"

,

1803 "should LP solutions be checked for primal feasibility, resolving LP when numerical troubles occur?"

,

1807 "lp/checkdualfeas"

,

1808 "should LP solutions be checked for dual feasibility, resolving LP when numerical troubles occur?"

,

1813 "should infeasibility proofs from the LP be checked?"

,

1818 "which FASTMIP setting of LP solver should be used? 0: off, 1: low"

,

1823 "LP scaling (0: none, 1: normal, 2: aggressive)"

,

1828 "should presolving of LP solver be used?"

,

1833 "should the lexicographic dual algorithm be used?"

,

1837 "lp/lexdualrootonly"

,

1838 "should the lexicographic dual algorithm be applied only at the root node"

,

1842 "lp/lexdualmaxrounds"

,

1843 "maximum number of rounds in the lexicographic dual algorithm (-1: unbounded)"

,

1848 "choose fractional basic variables in lexicographic dual algorithm?"

,

1852 "lp/lexdualstalling"

,

1853 "turn on the lex dual algorithm only when stalling?"

,

1857 "lp/disablecutoff"

,

1858 "disable the cutoff bound in the LP solver? (0: enabled, 1: disabled, 2: auto)"

,

1863 "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)"

,

1868 "number of threads used for solving the LP (0: automatic)"

,

1872 "lp/resolveiterfac"

,

1873 "factor of average LP iterations that is used as LP iteration limit for LP resolve (-1: unlimited)"

,

1877 "lp/resolveitermin"

,

1878 "minimum number of iterations that are allowed for LP resolve"

,

1883 "lp/solutionpolishing"

,

1884 "LP solution polishing method (0: disabled, 1: only root, 2: always, 3: auto)"

,

1889 "lp/refactorinterval"

,

1890 "LP refactorization interval (0: auto)"

,

1894 "lp/alwaysgetduals"

,

1895 "should the Farkas duals always be collected when an LP is found to be infeasible?"

,

1902 "solver to use for solving NLPs; leave empty to select NLPI with highest priority"

,

1907 "should the NLP relaxation be always disabled (also for NLPs/MINLPs)?"

,

1914 "fraction of maximal memory usage resulting in switch to memory saving mode"

,

1918 "memory/arraygrowfac"

,

1919 "memory growing factor for dynamically allocated arrays"

,

1921

paramChgdArraygrowfac,

NULL

) );

1923 "memory/arraygrowinit"

,

1924 "initial size of dynamically allocated arrays"

,

1926

paramChgdArraygrowinit,

NULL

) );

1928 "memory/treegrowfac"

,

1929 "memory growing factor for tree array"

,

1933 "memory/treegrowinit"

,

1934 "initial size of tree array"

,

1938 "memory/pathgrowfac"

,

1939 "memory growing factor for path array"

,

1943 "memory/pathgrowinit"

,

1944 "initial size of path array"

,

1951 "should the CTRL-C interrupt be caught by SCIP?"

,

1955 "misc/usevartable"

,

1956 "should a hashtable be used to map from variable names to variables?"

,

1960 "misc/useconstable"

,

1961 "should a hashtable be used to map from constraint names to constraints?"

,

1965 "misc/usesmalltables"

,

1966 "should smaller hashtables be used? yields better performance for small problems with about 100 variables"

,

1972 "should the problem be solved exactly (with proven dual bounds)?"

,

1981 "should the statistics be reset if the transformed problem is freed (in case of a Benders' decomposition this parameter should be set to FALSE)"

,

1986 "misc/improvingsols"

,

1987 "should only solutions be checked which improve the primal bound"

,

1991 "misc/printreason"

,

1992 "should the reason be printed if a given start solution is infeasible"

,

1996 "misc/estimexternmem"

,

1997 "should the usage of external memory be estimated?"

,

2001 "misc/avoidmemout"

,

2002 "try to avoid running into memory limit by restricting plugins like heuristics?"

,

2006 "misc/transorigsols"

,

2007 "should SCIP try to transfer original solutions to the transformed space (after presolving)?"

,

2011 "misc/transsolsorig"

,

2012 "should SCIP try to transfer transformed solutions to the original space (after solving)?"

,

2016 "misc/calcintegral"

,

2017 "should SCIP calculate the primal dual integral value?"

,

2021 "misc/finitesolutionstore"

,

2022 "should SCIP try to remove infinite fixings from solutions copied to the solution store?"

,

2026 "misc/outputorigsol"

,

2027 "should the best solution be transformed to the orignal space and be output in command line run?"

,

2031 "misc/allowstrongdualreds"

,

2032 "should strong dual reductions be allowed in propagation and presolving?"

,

2036 "misc/allowweakdualreds"

,

2037 "should weak dual reductions be allowed in propagation and presolving?"

,

2042 "should the objective function be scaled so that it is always integer?"

,

2046 "misc/showdivingstats"

,

2047 "should detailed statistics for diving heuristics be shown?"

,

2052 "misc/referencevalue"

,

2053 "objective value for reference purposes"

,

2057#ifdef WITH_DEBUG_SOLUTION 2060 "path to a debug solution"

,

2061

&(*set)->misc_debugsol,

FALSE

, SCIP_DEFAULT_MISC_DEBUGSOLUTION,

2066 "misc/usesymmetry"

,

2067 "bitset describing used symmetry handling technique: "

\

2069 "1: constraint-based (orbitopes and/or symresacks); "

\

2070 "2: orbital fixing; "

\

2071 "3: orbitopes and orbital fixing; "

\

2072 "4: Schreier Sims cuts; "

\

2073 "5: Schreier Sims cuts and orbitopes; "

\

2074 "6: Schreier Sims cuts and orbital fixing; "

\

2075 "7: Schreier Sims cuts, orbitopes, and orbital fixing) "

\

2076 "See type_symmetry.h."

,

2078

paramChgdUsesymmetry,

NULL

) );

2082 "randomization/randomseedshift"

,

2083 "global shift of all random seeds in the plugins and the LP random seed"

,

2088 "randomization/permutationseed"

,

2089 "seed value for permuting the problem after reading/transformation (0: no permutation)"

,

2094 "randomization/permuteconss"

,

2095 "should order of constraints be permuted (depends on permutationseed)?"

,

2100 "randomization/permutevars"

,

2101 "should order of variables be permuted (depends on permutationseed)?"

,

2106 "randomization/lpseed"

,

2107 "random seed for LP solver, e.g. for perturbations in the simplex (0: LP default)"

,

2113 "nodeselection/childsel"

,

2114 "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)"

,

2120 "numerics/infinity"

,

2121 "values larger than this are considered infinity"

,

2123

paramChgdInfinity,

NULL

) );

2125 "numerics/epsilon"

,

2126 "absolute values smaller than this are considered zero"

,

2130 "numerics/sumepsilon"

,

2131 "absolute values of sums smaller than this are considered zero"

,

2135 "numerics/feastol"

,

2136 "feasibility tolerance for constraints"

,

2138

paramChgdFeastol,

NULL

) );

2140 "numerics/checkfeastolfac"

,

2141 "feasibility tolerance factor; for checking the feasibility of the best solution"

,

2145 "numerics/lpfeastolfactor"

,

2146 "factor w.r.t. primal feasibility tolerance that determines default (and maximal) primal feasibility tolerance of LP solver"

,

2148

paramChgdLPFeastolFactor,

NULL

) );

2150 "numerics/dualfeastol"

,

2151 "feasibility tolerance for reduced costs in LP solution"

,

2153

paramChgdDualfeastol,

NULL

) );

2155 "numerics/barrierconvtol"

,

2156 "LP convergence tolerance used in barrier algorithm"

,

2158

paramChgdBarrierconvtol,

NULL

) );

2160 "numerics/boundstreps"

,

2161 "minimal relative improve for strengthening bounds"

,

2165 "numerics/pseudocosteps"

,

2166 "minimal variable distance value to use for branching pseudo cost updates"

,

2170 "numerics/pseudocostdelta"

,

2171 "minimal objective distance value to use for branching pseudo cost updates"

,

2175 "numerics/recomputefac"

,

2176 "minimal decrease factor that causes the recomputation of a value (e.g., pseudo objective) instead of an update"

,

2180 "numerics/hugeval"

,

2181 "values larger than this are considered huge and should be handled separately (e.g., in activity computation)"

,

2187 "presolving/maxrounds"

,

2188 "maximal number of presolving rounds (-1: unlimited, 0: off)"

,

2192 "presolving/abortfac"

,

2193 "abort presolve, if at most this fraction of the problem was changed in last presolve round"

,

2197 "presolving/maxrestarts"

,

2198 "maximal number of restarts (-1: unlimited)"

,

2202 "presolving/restartfac"

,

2203 "fraction of integer variables that were fixed in the root node triggering a restart with preprocessing after root node evaluation"

,

2207 "presolving/clqtablefac"

,

2208 "limit on number of entries in clique table relative to number of problem nonzeros"

,

2212 "presolving/immrestartfac"

,

2213 "fraction of integer variables that were fixed in the root node triggering an immediate restart with preprocessing"

,

2217 "presolving/subrestartfac"

,

2218 "fraction of integer variables that were globally fixed during the solving process triggering a restart with preprocessing"

,

2222 "presolving/restartminred"

,

2223 "minimal fraction of integer variables removed after restart to allow for an additional restart"

,

2227 "presolving/donotmultaggr"

,

2228 "should multi-aggregation of variables be forbidden?"

,

2232 "presolving/donotaggr"

,

2233 "should aggregation of variables be forbidden?"

,

2240 "maximal number of variables priced in per pricing round"

,

2244 "pricing/maxvarsroot"

,

2245 "maximal number of priced variables at the root node"

,

2249 "pricing/abortfac"

,

2250 "pricing is aborted, if fac * pricing/maxvars pricing candidates were found"

,

2255 "should variables created at the current node be deleted when the node is solved in case they are not present in the LP anymore?"

,

2259 "pricing/delvarsroot"

,

2260 "should variables created at the root node be deleted when the root is solved in case they are not present in the LP anymore?"

,

2266 "decomposition/benderslabels"

,

2267 "should the variables be labelled for the application of Benders' decomposition?"

,

2271 "decomposition/applybenders"

,

2272 "if a decomposition exists, should Benders' decomposition be applied?"

,

2276 "decomposition/maxgraphedge"

,

2277 "maximum number of edges in block graph computation (-1: no limit, 0: disable block graph computation)"

,

2281 "decomposition/disablemeasures"

,

2282 "disable expensive measures"

,

2288 "benders/solutiontol"

,

2289 "the tolerance used for checking optimality in Benders' decomposition. tol where optimality is given by LB + tol > UB."

,

2293 "benders/cutlpsol"

,

2294 "should Benders' cuts be generated from the solution to the LP relaxation?"

,

2298 "benders/copybenders"

,

2299 "should Benders' decomposition be copied for use in sub-SCIPs?"

,

2305 "propagating/maxrounds"

,

2306 "maximal number of propagation rounds per node (-1: unlimited)"

,

2310 "propagating/maxroundsroot"

,

2311 "maximal number of propagation rounds in the root node (-1: unlimited)"

,

2315 "propagating/abortoncutoff"

,

2316 "should propagation be aborted immediately? setting this to FALSE could help conflict analysis to produce more conflict constraints"

,

2322 "reoptimization/enable"

,

2323 "should reoptimization used?"

,

2325

paramChgdEnableReopt,

NULL

) );

2327 "reoptimization/maxsavednodes"

,

2328 "maximal number of saved nodes"

,

2332 "reoptimization/maxdiffofnodes"

,

2333 "maximal number of bound changes between two stored nodes on one path"

,

2337 "reoptimization/globalcons/sepainfsubtrees"

,

2338 "save global constraints to separate infeasible subtrees."

,

2342 "reoptimization/sepabestsol"

,

2343 "separate the optimal solution, i.e., for constrained shortest path"

,

2347 "reoptimization/storevarhistory"

,

2348 "use variable history of the previous solve if the objctive function has changed only slightly"

,

2352 "reoptimization/usepscost"

,

2353 "re-use pseudo costs if the objective function changed only slightly "

,

2357 "reoptimization/solvelp"

,

2358 "at which reopttype should the LP be solved? (1: transit, 3: strong branched, 4: w/ added logicor, 5: only leafs)."

,

2362 "reoptimization/solvelpdiff"

,

2363 "maximal number of bound changes at node to skip solving the LP"

,

2367 "reoptimization/savesols"

,

2368 "number of best solutions which should be saved for the following runs. (-1: save all)"

,

2372 "reoptimization/objsimrootLP"

,

2373 "similarity of two sequential objective function to disable solving the root LP."

,

2377 "reoptimization/objsimsol"

,

2378 "similarity of two objective functions to re-use stored solutions"

,

2382 "reoptimization/delay"

,

2383 "minimum similarity for using reoptimization of the search tree."

,

2387 "reoptimization/commontimelimit"

,

2388 "time limit over all reoptimization rounds?."

,

2392 "reoptimization/shrinkinner"

,

2393 "replace branched inner nodes by their child nodes, if the number of bound changes is not to large"

,

2397 "reoptimization/strongbranchinginit"

,

2398 "try to fix variables at the root node before reoptimizing by probing like strong branching"

,

2402 "reoptimization/reducetofrontier"

,

2403 "delete stored nodes which were not reoptimized"

,

2407 "reoptimization/forceheurrestart"

,

2408 "force a restart if the last n optimal solutions were found by heuristic reoptsols"

,

2412 "reoptimization/saveconsprop"

,

2413 "save constraint and propagator propagations"

,

2417 "reoptimization/usesplitcons"

,

"use constraints to reconstruct the subtree pruned be dual reduction when reactivating the node"

,

2421 "reoptimization/varorderinterdiction"

,

"use 'd'efault, 'r'andom or a variable ordering based on 'i'nference score for interdiction branching used during reoptimization"

,

2425 "reoptimization/usecuts"

,

2426 "reoptimize cuts found at the root node"

,

2430 "reoptimization/maxcutage"

,

2431 "maximal age of a cut to be use for reoptimization"

,

2437 "separating/maxbounddist"

,

2438 "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)"

,

2442 "separating/maxlocalbounddist"

,

2443 "maximal relative distance from current node's dual bound to primal bound compared to best node's dual bound for applying local separation (0.0: only on current best node, 1.0: on all nodes)"

,

2447 "separating/maxcoefratio"

,

2448 "maximal ratio between coefficients in strongcg, cmir, and flowcover cuts"

,

2452 "separating/maxcoefratiofacrowprep"

,

2453 "maximal ratio between coefficients (as factor of 1/feastol) to ensure in rowprep cleanup"

,

2457 "separating/minefficacy"

,

2458 "minimal efficacy for a cut to enter the LP"

,

2462 "separating/minefficacyroot"

,

2463 "minimal efficacy for a cut to enter the LP in the root node"

,

2467 "separating/minactivityquot"

,

2468 "minimum cut activity quotient to convert cuts into constraints during a restart (0.0: all cuts are converted)"

,

2472 "separating/maxcutsgenfactor"

,

2473 "factor w.r.t. maxcuts for maximal number of cuts generated per separation round (-1.0: no limit, >= 0.0: valid finite limit)"

,

2477 "separating/maxcutsrootgenfactor"

,

2478 "factor w.r.t. maxcutsroot for maximal number of generated cuts per separation round at the root node " 2479 "(-1.0: no limit, >= 0.0: valid finite limit)"

,

2483 "separating/orthofunc"

,

2484 "function used for calc. scalar prod. in orthogonality test ('e'uclidean, 'd'iscrete)"

,

2488 "separating/efficacynorm"

,

2489 "row norm to use for efficacy calculation ('e'uclidean, 'm'aximum, 's'um, 'd'iscrete)"

,

2493 "separating/cutselrestart"

,

2494 "cut selection during restart ('a'ge, activity 'q'uotient)"

,

2498 "separating/cutselsubscip"

,

2499 "cut selection for sub SCIPs ('a'ge, activity 'q'uotient)"

,

2503 "separating/filtercutpoolrel"

,

2504 "should cutpool separate only cuts with high relative efficacy?"

,

2508 "separating/maxruns"

,

2509 "maximal number of runs for which separation is enabled (-1: unlimited)"

,

2513 "separating/maxrounds"

,

2514 "maximal number of separation rounds per node (-1: unlimited)"

,

2518 "separating/maxroundsroot"

,

2519 "maximal number of separation rounds in the root node (-1: unlimited)"

,

2523 "separating/maxroundsrootsubrun"

,

2524 "maximal number of separation rounds in the root node of a subsequent run (-1: unlimited)"

,

2528 "separating/maxaddrounds"

,

2529 "maximal additional number of separation rounds in subsequent price-and-cut loops (-1: no additional restriction)"

,

2533 "separating/maxstallrounds"

,

2534 "maximal number of consecutive separation rounds without objective or integrality improvement in local nodes (-1: no additional restriction)"

,

2538 "separating/maxstallroundsroot"

,

2539 "maximal number of consecutive separation rounds without objective or integrality improvement in the root node (-1: no additional restriction)"

,

2543 "separating/maxcuts"

,

2544 "maximal number of cuts separated per separation round (0: disable local separation)"

,

2548 "separating/maxcutsroot"

,

2549 "maximal number of separated cuts per separation round at the root node (0: disable root node separation)"

,

2553 "separating/cutagelimit"

,

2554 "maximum age a cut can reach before it is deleted from the global cut pool, or -1 to keep all cuts"

,

2558 "separating/poolfreq"

,

2559 "separation frequency for the global cut pool (-1: disable global cut pool, 0: only separate pool at the root)"

,

2566 "parallel optimisation mode, 0: opportunistic or 1: deterministic."

,

2570 "parallel/minnthreads"

,

2571 "the minimum number of threads used during parallel solve"

,

2575 "parallel/maxnthreads"

,

2576 "the maximum number of threads used during parallel solve"

,

2582 "concurrent/changeseeds"

,

2583 "set different random seeds in each concurrent solver?"

,

2587 "concurrent/changechildsel"

,

2588 "use different child selection rules in each concurrent solver?"

,

2592 "concurrent/commvarbnds"

,

2593 "should the concurrent solvers communicate global variable bound changes?"

,

2597 "concurrent/presolvebefore"

,

2598 "should the problem be presolved before it is copied to the concurrent solvers?"

,

2602 "concurrent/initseed"

,

2603 "maximum number of solutions that will be shared in a one synchronization"

,

2607 "concurrent/sync/freqinit"

,

2608 "initial frequency of synchronization with other threads"

,

2612 "concurrent/sync/freqmax"

,

2613 "maximal frequency of synchronization with other threads"

,

2617 "concurrent/sync/freqfactor"

,

2618 "factor by which the frequency of synchronization is changed"

,

2622 "concurrent/sync/targetprogress"

,

2623 "when adapting the synchronization frequency this value is the targeted relative difference by which the absolute gap decreases per synchronization"

,

2627 "concurrent/sync/maxnsols"

,

2628 "maximum number of solutions that will be shared in a single synchronization"

,

2632 "concurrent/sync/maxnsyncdelay"

,

2633 "maximum number of synchronizations before reading is enforced regardless of delay"

,

2637 "concurrent/sync/minsyncdelay"

,

2638 "minimum delay before synchronization data is read"

,

2642 "concurrent/sync/nbestsols"

,

2643 "how many of the N best solutions should be considered for synchronization?"

,

2647 "concurrent/paramsetprefix"

,

2648 "path prefix for parameter setting files of concurrent solvers"

,

2655 "timing/clocktype"

,

2656 "default clock type (1: CPU user seconds, 2: wall clock time)"

,

2661 "is timing enabled?"

,

2666 "belongs reading time to solving time?"

,

2670 "timing/rareclockcheck"

,

2671 "should clock checks of solving time be performed less frequently (note: time limit could be exceeded slightly)"

,

2675 "timing/statistictiming"

,

2676 "should timing for statistic output be performed?"

,

2678

paramChgdStatistictiming,

NULL

) );

2681 "should time for evaluation in NLP solves be measured?"

,

2687 "visual/vbcfilename"

,

2688 "name of the VBC tool output file, or - if no VBC tool output should be created"

,

2692 "visual/bakfilename"

,

2693 "name of the BAK tool output file, or - if no BAK tool output should be created"

,

2698 "should the real solving time be used instead of a time step counter in visualization?"

,

2703 "should the node where solutions are found be visualized?"

,

2708 "should lower bound information be visualized?"

,

2712 "visual/objextern"

,

2713 "should be output the external value of the objective?"

,

2719 "reading/initialconss"

,

2720 "should model constraints be marked as initial?"

,

2724 "reading/dynamicconss"

,

2725 "should model constraints be subject to aging?"

,

2729 "reading/dynamiccols"

,

2730 "should columns be added and removed dynamically to the LP?"

,

2734 "reading/dynamicrows"

,

2735 "should rows be added and removed dynamically to the LP?"

,

2742 "should all constraints be written (including the redundant constraints)?"

,

2746 "write/printzeros"

,

2747 "should variables set to zero be printed?"

,

2751 "write/genericnamesoffset"

,

2752 "when writing a generic problem the index for the first variable should start with?"

,

2776 for

( i = 0; i < (*set)->nreaders; ++i )

2783 for

( i = 0; i < (*set)->npricers; ++i )

2790 for

( i = 0; i < (*set)->nbenders; ++i )

2797 for

( i = 0; i < (*set)->nconshdlrs; ++i )

2807 for

( i = 0; i < (*set)->nconflicthdlrs; ++i )

2814 for

( i = 0; i < (*set)->npresols; ++i )

2821 for

( i = 0; i < (*set)->nrelaxs; ++i )

2828 for

( i = 0; i < (*set)->nsepas; ++i )

2835 for

( i = 0; i < (*set)->ncutsels; ++i)

2842 for

( i = 0; i < (*set)->nprops; ++i )

2850 for

( i = 0; i < (*set)->nheurs; ++i )

2857 for

( i = 0; i < (*set)->ncomprs; ++i )

2864 for

( i = 0; i < (*set)->neventhdlrs; ++i )

2871 for

( i = 0; i < (*set)->nnodesels; ++i )

2878 for

( i = 0; i < (*set)->nbranchrules; ++i )

2885 for

( i = 0; i < (*set)->ntables; ++i )

2892 for

( i = 0; i < (*set)->ndisps; ++i )

2902 for

( i = 0; i < (*set)->nexprhdlrs; ++i )

2907

(*set)->exprhdlrvar =

NULL

;

2908

(*set)->exprhdlrval =

NULL

;

2909

(*set)->exprhdlrsum =

NULL

;

2910

(*set)->exprhdlrproduct =

NULL

;

2911

(*set)->exprhdlrpow =

NULL

;

2914 for

( i = 0; i < (*set)->nnlpis; ++i )

2924 for

( i = 0; i < (*set)->nconcsolvertypes; ++i )

2931 for

( i = 0; i < (*set)->nextcodes; ++i )

2940 for

( i = 0; i < (*set)->nbanditvtables; ++i )

2981

defaultvalue, paramchgd, paramdata) );

3005

defaultvalue, minvalue, maxvalue, paramchgd, paramdata) );

3029

defaultvalue, minvalue, maxvalue, paramchgd, paramdata) );

3053

defaultvalue, minvalue, maxvalue, paramchgd, paramdata) );

3068 const char

* allowedvalues,

3076

defaultvalue, allowedvalues, paramchgd, paramdata) );

3090 const char

* defaultvalue,

3098

defaultvalue, paramchgd, paramdata) );

3286

assert(param !=

NULL

);

3338

assert(param !=

NULL

);

3376

assert(param !=

NULL

);

3414

assert(param !=

NULL

);

3452

assert(param !=

NULL

);

3498 const char

* filename

3512 const char

* filename,

3667

assert(reader !=

NULL

);

3669 if

(

set

->nreaders >=

set

->readerssize )

3674

assert(

set

->nreaders <

set

->readerssize);

3676 set

->readers[

set

->nreaders] = reader;

3691

assert(name !=

NULL

);

3693 for

( i = 0; i <

set

->nreaders; ++i )

3696 return set

->readers[i];

3709

assert(pricer !=

NULL

);

3711 if

(

set

->npricers >=

set

->pricerssize )

3716

assert(

set

->npricers <

set

->pricerssize);

3718 set

->pricers[

set

->npricers] = pricer;

3734

assert(name !=

NULL

);

3736 for

( i = 0; i <

set

->npricers; ++i )

3739 return set

->pricers[i];

3752 if

( !

set

->pricerssorted )

3767 if

( !

set

->pricersnamesorted )

3771 set

->pricersnamesorted =

TRUE

;

3782

assert(benders !=

NULL

);

3784 if

(

set

->nbenders >=

set

->benderssize )

3789

assert(

set

->nbenders <

set

->benderssize);

3791 set

->benders[

set

->nbenders] = benders;

3807

assert(name !=

NULL

);

3809 for

( i = 0; i <

set

->nbenders; ++i )

3812 return set

->benders[i];

3825 if

( !

set

->benderssorted )

3840 if

( !

set

->bendersnamesorted )

3844 set

->bendersnamesorted =

TRUE

;

3858

assert(conshdlr !=

NULL

);

3862 if

(

set

->nconshdlrs >=

set

->conshdlrssize )

3870

assert(

set

->nconshdlrs <

set

->conshdlrssize);

3876 set

->conshdlrs[i] =

set

->conshdlrs[i-1];

3878 set

->conshdlrs[i] = conshdlr;

3884 set

->conshdlrs_sepa[i] =

set

->conshdlrs_sepa[i-1];

3886 set

->conshdlrs_sepa[i] = conshdlr;

3892 set

->conshdlrs_enfo[i] =

set

->conshdlrs_enfo[i-1];

3894 set

->conshdlrs_enfo[i] = conshdlr;

3897 set

->conshdlrs_include[

set

->nconshdlrs] = conshdlr;

3915

assert(conshdlr !=

NULL

);

3921 if

( newpriority > oldpriority )

3924 while

( i < set->nconshdlrs &&

3930

assert(priorityatpos >= oldpriority);

3933 if

( newpriority > priorityatpos && newpos == -1 )

3938

assert(i < set->nconshdlrs);

3944 for

( ; i > newpos; --i )

3946 set

->conshdlrs_sepa[i] =

set

->conshdlrs_sepa[i-1];

3948 set

->conshdlrs_sepa[newpos] = conshdlr;

3951 else if

( newpriority < oldpriority )

3953

i =

set

->nconshdlrs - 1;

3959

assert(priorityatpos <= oldpriority);

3962 if

( newpriority < priorityatpos && newpos == -1 )

3973 for

(; i < newpos; ++i )

3975 set

->conshdlrs_sepa[i] =

set

->conshdlrs_sepa[i + 1];

3977 set

->conshdlrs_sepa[newpos] = conshdlr;

3980 for

( i = 0; i <

set

->nconshdlrs - 1; ++i )

3996

assert(name !=

NULL

);

3998 for

( i = 0; i <

set

->nconshdlrs; ++i )

4001 return set

->conshdlrs[i];

4014

assert(conflicthdlr !=

NULL

);

4017 if

(

set

->nconflicthdlrs >=

set

->conflicthdlrssize )

4022

assert(

set

->nconflicthdlrs <

set

->conflicthdlrssize);

4024 set

->conflicthdlrs[

set

->nconflicthdlrs] = conflicthdlr;

4025 set

->nconflicthdlrs++;

4026 set

->conflicthdlrssorted =

FALSE

;

4040

assert(name !=

NULL

);

4042 for

( i = 0; i <

set

->nconflicthdlrs; ++i )

4045 return set

->conflicthdlrs[i];

4058 if

( !

set

->conflicthdlrssorted )

4060 SCIPsortPtr

((

void

**)

set

->conflicthdlrs, SCIPconflicthdlrComp,

set

->nconflicthdlrs);

4061 set

->conflicthdlrssorted =

TRUE

;

4062 set

->conflicthdlrsnamesorted =

FALSE

;

4073 if

( !

set

->conflicthdlrsnamesorted )

4075 SCIPsortPtr

((

void

**)

set

->conflicthdlrs, SCIPconflicthdlrCompName,

set

->nconflicthdlrs);

4076 set

->conflicthdlrssorted =

FALSE

;

4077 set

->conflicthdlrsnamesorted =

TRUE

;

4088

assert(presol !=

NULL

);

4090 if

(

set

->npresols >=

set

->presolssize )

4095

assert(

set

->npresols <

set

->presolssize);

4097 set

->presols[

set

->npresols] = presol;

4113

assert(name !=

NULL

);

4115 for

( i = 0; i <

set

->npresols; ++i )

4118 return set

->presols[i];

4131 if

( !

set

->presolssorted )

4146 if

( !

set

->presolsnamesorted )

4150 set

->presolsnamesorted =

TRUE

;

4161

assert(relax !=

NULL

);

4164 if

(

set

->nrelaxs >=

set

->relaxssize )

4169

assert(

set

->nrelaxs <

set

->relaxssize);

4171 set

->relaxs[

set

->nrelaxs] = relax;

4187

assert(name !=

NULL

);

4189 for

( i = 0; i <

set

->nrelaxs; ++i )

4192 return set

->relaxs[i];

4205 if

( !

set

->relaxssorted )

4220 if

( !

set

->relaxsnamesorted )

4224 set

->relaxsnamesorted =

TRUE

;

4235

assert(sepa !=

NULL

);

4238 if

(

set

->nsepas >=

set

->sepassize )

4243

assert(

set

->nsepas <

set

->sepassize);

4245 set

->sepas[

set

->nsepas] = sepa;

4261

assert(name !=

NULL

);

4263 for

( i = 0; i <

set

->nsepas; ++i )

4266 return set

->sepas[i];

4279 if

( !

set

->sepassorted )

4294 if

( !

set

->sepasnamesorted )

4298 set

->sepasnamesorted =

TRUE

;

4309

assert(cutsel !=

NULL

);

4312 if

(

set

->ncutsels >=

set

->cutselssize )

4317

assert(

set

->ncutsels <

set

->cutselssize);

4319 set

->cutsels[

set

->ncutsels] = cutsel;

4335

assert(name !=

NULL

);

4337 for

( i = 0; i <

set

->ncutsels; ++i )

4340 return set

->cutsels[i];

4353 if

( !

set

->cutselssorted )

4367

assert(prop !=

NULL

);

4370 if

(

set

->nprops >=

set

->propssize )

4376

assert(

set

->nprops <

set

->propssize);

4378 set

->props[

set

->nprops] = prop;

4379 set

->props_presol[

set

->nprops] = prop;

4396

assert(name !=

NULL

);

4398 for

( i = 0; i <

set

->nprops; ++i )

4401 return set

->props[i];

4414 if

( !

set

->propssorted )

4429 if

( !

set

->propspresolsorted )

4432 set

->propspresolsorted =

TRUE

;

4444 if

( !

set

->propsnamesorted )

4448 set

->propsnamesorted =

TRUE

;

4459

assert(banditvtable !=

NULL

);

4461 if

(

set

->nbanditvtables >=

set

->banditvtablessize )

4465 set

->banditvtablessize = newsize;

4468

assert(

set

->nbanditvtables <

set

->banditvtablessize);

4469 set

->banditvtables[

set

->nbanditvtables++] = banditvtable;

4483

assert(name !=

NULL

);

4486 for

(

b

= 0;

b

<

set

->nbanditvtables; ++

b

)

4489 return set

->banditvtables[

b

];

4502

assert(concsolvertype !=

NULL

);

4504 if

(

set

->nconcsolvertypes >=

set

->concsolvertypessize )

4509

assert(

set

->nconcsolvertypes <

set

->concsolvertypessize);

4511 set

->concsolvertypes[

set

->nconcsolvertypes] = concsolvertype;

4512 set

->nconcsolvertypes++;

4526

assert(name !=

NULL

);

4528 for

( i = 0; i <

set

->nconcsolvertypes; ++i )

4531 return set

->concsolvertypes[i];

4544

assert(concsolver !=

NULL

);

4546 if

(

set

->nconcsolvers >=

set

->concsolverssize )

4551

assert(

set

->nconcsolvers <

set

->concsolverssize);

4553 set

->concsolvers[

set

->nconcsolvers] = concsolver;

4556 set

->nconcsolvers++;

4570 for

( i = 0; i <

set

->nconcsolvers; ++i )

4576 set

->nconcsolvers = 0;

4577 set

->concsolverssize = 0;

4590

assert(heur !=

NULL

);

4593 if

(

set

->nheurs >=

set

->heurssize )

4598

assert(

set

->nheurs <

set

->heurssize);

4600 set

->heurs[

set

->nheurs] = heur;

4616

assert(name !=

NULL

);

4618 for

( i = 0; i <

set

->nheurs; ++i )

4621 return set

->heurs[i];

4634 if

( !

set

->heurssorted )

4649 if

( !

set

->heursnamesorted )

4653 set

->heursnamesorted =

TRUE

;

4664

assert(compr !=

NULL

);

4667 if

(

set

->ncomprs >=

set

->comprssize )

4672

assert(

set

->ncomprs <

set

->comprssize);

4674 set

->comprs[

set

->ncomprs] = compr;

4690

assert(name !=

NULL

);

4692 for

( i = 0; i <

set

->ncomprs; ++i )

4695 return set

->comprs[i];

4708 if

( !

set

->comprssorted )

4723 if

( !

set

->comprsnamesorted )

4727 set

->comprsnamesorted =

TRUE

;

4738

assert(eventhdlr !=

NULL

);

4741 if

(

set

->neventhdlrs >=

set

->eventhdlrssize )

4746

assert(

set

->neventhdlrs <

set

->eventhdlrssize);

4748 set

->eventhdlrs[

set

->neventhdlrs] = eventhdlr;

4749 set

->neventhdlrs++;

4763

assert(name !=

NULL

);

4765 for

( i = 0; i <

set

->neventhdlrs; ++i )

4768 return set

->eventhdlrs[i];

4784

assert(nodesel !=

NULL

);

4787 if

(

set

->nnodesels >=

set

->nodeselssize )

4792

assert(

set

->nnodesels <

set

->nodeselssize);

4797 set

->nodesels[i] =

set

->nodesels[i-1];

4799 set

->nodesels[i] = nodesel;

4814

assert(name !=

NULL

);

4816 for

( i = 0; i <

set

->nnodesels; ++i )

4819 return set

->nodesels[i];

4832

assert(stat !=

NULL

);

4835 if

(

set

->nodesel ==

NULL

&&

set

->nnodesels > 0 )

4839 set

->nodesel =

set

->nodesels[0];

4844 for

( i = 1; i <

set

->nnodesels; ++i )

4847 set

->nodesel =

set

->nodesels[i];

4852 for

( i = 1; i <

set

->nnodesels; ++i )

4855 set

->nodesel =

set

->nodesels[i];

4860 return set

->nodesel;

4870

assert(branchrule !=

NULL

);

4873 if

(

set

->nbranchrules >=

set

->branchrulessize )

4878

assert(

set

->nbranchrules <

set

->branchrulessize);

4880 set

->branchrules[

set

->nbranchrules] = branchrule;

4881 set

->nbranchrules++;

4896

assert(name !=

NULL

);

4898 for

( i = 0; i <

set

->nbranchrules; ++i )

4901 return set

->branchrules[i];

4914 if

( !

set

->branchrulessorted )

4916 SCIPsortPtr

((

void

**)

set

->branchrules, SCIPbranchruleComp,

set

->nbranchrules);

4917 set

->branchrulessorted =

TRUE

;

4918 set

->branchrulesnamesorted =

FALSE

;

4929 if

( !

set

->branchrulesnamesorted )

4931 SCIPsortPtr

((

void

**)

set

->branchrules, SCIPbranchruleCompName,

set

->nbranchrules);

4933 set

->branchrulesnamesorted =

TRUE

;

4947

assert(disp !=

NULL

);

4950 if

(

set

->ndisps >=

set

->dispssize )

4955

assert(

set

->ndisps <

set

->dispssize);

4961 set

->disps[i] =

set

->disps[i-1];

4963 set

->disps[i] = disp;

4978

assert(name !=

NULL

);

4980 for

( i = 0; i <

set

->ndisps; ++i )

4983 return set

->disps[i];

4996

assert(table !=

NULL

);

4999 if

(

set

->ntables >=

set

->tablessize )

5004

assert(

set

->ntables <

set

->tablessize);

5007 set

->tables[

set

->ntables] = table;

5023

assert(name !=

NULL

);

5025 for

( i = 0; i <

set

->ntables; ++i )

5028 return set

->tables[i];

5041

assert(dialog !=

NULL

);

5043 if

(

set

->ndialogs >=

set

->dialogssize )

5048

assert(

set

->ndialogs <

set

->dialogssize);

5050 set

->dialogs[

set

->ndialogs] = dialog;

5066 if

( dialog ==

NULL

)

5069 for

( i = 0; i <

set

->ndialogs; ++i )

5071 if

(

set

->dialogs[i] == dialog )

5085

assert(exprhdlr !=

NULL

);

5087 if

(

set

->nexprhdlrs >=

set

->exprhdlrssize )

5092

assert(

set

->nexprhdlrs <

set

->exprhdlrssize);

5094 set

->exprhdlrs[

set

->nexprhdlrs] = exprhdlr;

5099 set

->exprhdlrvar = exprhdlr;

5101 set

->exprhdlrval = exprhdlr;

5103 set

->exprhdlrsum = exprhdlr;

5105 set

->exprhdlrproduct = exprhdlr;

5107 set

->exprhdlrpow = exprhdlr;

5121

assert(name !=

NULL

);

5123 for

( i = 0; i <

set

->nexprhdlrs; ++i )

5125 return set

->exprhdlrs[i];

5137 if

( !

set

->exprhdlrssorted )

5140 set

->exprhdlrssorted =

TRUE

;

5151

assert(nlpi !=

NULL

);

5153 if

(

set

->nnlpis >=

set

->nlpissize )

5158

assert(

set

->nnlpis <

set

->nlpissize);

5160 set

->nlpis[

set

->nnlpis] = nlpi;

5176

assert(name !=

NULL

);

5178 for

( i = 0; i <

set

->nnlpis; ++i )

5181 return set

->nlpis[i];

5194 if

( !

set

->nlpissorted )

5209

assert(nlpi !=

NULL

);

5219 const char

* description

5223

assert(name !=

NULL

);

5225 if

(

set

->nextcodes >=

set

->extcodessize )

5231

assert(

set

->nextcodes <

set

->extcodessize);

5234 if

( description !=

NULL

)

5240 set

->extcodedescs[

set

->nextcodes] =

NULL

;

5260 for

( i = 0; i <

set

->nactivepricers; ++i )

5267 for

( i = 0; i <

set

->nactivebenders; ++i )

5273 for

( i = 0; i <

set

->nconshdlrs; ++i )

5279 for

( i = 0; i <

set

->nconflicthdlrs; ++i )

5285 for

( i = 0; i <

set

->npresols; ++i )

5291 for

( i = 0; i <

set

->nrelaxs; ++i )

5297 for

( i = 0; i <

set

->nsepas; ++i )

5303 for

( i = 0; i <

set

->ncutsels; ++i )

5309 for

( i = 0; i <

set

->nprops; ++i )

5315 for

( i = 0; i <

set

->nheurs; ++i )

5321 for

( i = 0; i <

set

->ncomprs; ++i )

5327 for

( i = 0; i <

set

->neventhdlrs; ++i )

5333 for

( i = 0; i <

set

->nnodesels; ++i )

5339 for

( i = 0; i <

set

->nbranchrules; ++i )

5345 for

( i = 0; i <

set

->ndisps; ++i )

5352 for

( i = 0; i <

set

->ntables; ++i )

5358 for

( i = 0; i <

set

->nexprhdlrs; ++i )

5362 for

( i = 0; i <

set

->nnlpis; ++i )

5381 for

( i = 0; i <

set

->nactivepricers; ++i )

5388 for

( i = 0; i <

set

->nactivebenders; ++i )

5394 for

( i = 0; i <

set

->nconshdlrs; ++i )

5400 for

( i = 0; i <

set

->nconflicthdlrs; ++i )

5406 for

( i = 0; i <

set

->npresols; ++i )

5412 for

( i = 0; i <

set

->nrelaxs; ++i )

5418 for

( i = 0; i <

set

->nsepas; ++i )

5424 for

( i = 0; i <

set

->ncutsels; ++i )

5430 for

( i = 0; i <

set

->nprops; ++i )

5436 for

( i = 0; i <

set

->nheurs; ++i )

5442 for

( i = 0; i <

set

->ncomprs; ++i )

5448 for

( i = 0; i <

set

->neventhdlrs; ++i )

5454 for

( i = 0; i <

set

->nnodesels; ++i )

5460 for

( i = 0; i <

set

->nbranchrules; ++i )

5466 for

( i = 0; i <

set

->ndisps; ++i )

5472 for

( i = 0; i <

set

->ntables; ++i )

5492 for

( i = 0; i <

set

->npresols; ++i )

5498 for

( i = 0; i <

set

->nprops; ++i )

5504 for

( i = 0; i <

set

->nconshdlrs; ++i )

5510 for

( i = 0; i <

set

->nactivebenders; ++i )

5530 for

( i = 0; i <

set

->npresols; ++i )

5536 for

( i = 0; i <

set

->nprops; ++i )

5542 for

( i = 0; i <

set

->nconshdlrs; ++i )

5548 for

( i = 0; i <

set

->nactivebenders; ++i )

5578 for

( i = 0; i <

set

->nactivepricers; ++i )

5585 for

( i = 0; i <

set

->nactivebenders; ++i )

5591 for

( i = 0; i <

set

->nconshdlrs; ++i )

5597 for

( i = 0; i <

set

->nconflicthdlrs; ++i )

5603 for

( i = 0; i <

set

->nrelaxs; ++i )

5609 for

( i = 0; i <

set

->nsepas; ++i )

5615 for

( i =0; i <

set

->ncutsels; ++i )

5621 for

( i = 0; i <

set

->nprops; ++i )

5627 for

( i = 0; i <

set

->nheurs; ++i )

5633 for

( i = 0; i <

set

->neventhdlrs; ++i )

5639 for

( i = 0; i <

set

->nnodesels; ++i )

5645 for

( i = 0; i <

set

->nbranchrules; ++i )

5651 for

( i = 0; i <

set

->ndisps; ++i )

5657 for

( i = 0; i <

set

->ntables; ++i )

5679 for

( i = 0; i <

set

->nactivepricers; ++i )

5686 for

( i = 0; i <

set

->nactivebenders; ++i )

5692 for

( i = 0; i <

set

->nconshdlrs; ++i )

5698 for

( i = 0; i <

set

->nconflicthdlrs; ++i )

5704 for

( i = 0; i <

set

->nrelaxs; ++i )

5710 for

( i = 0; i <

set

->nsepas; ++i )

5716 for

( i = 0; i <

set

->ncutsels; ++i )

5722 for

( i = 0; i <

set

->nprops; ++i )

5728 for

( i = 0; i <

set

->nheurs; ++i )

5734 for

( i = 0; i <

set

->neventhdlrs; ++i )

5740 for

( i = 0; i <

set

->nnodesels; ++i )

5746 for

( i = 0; i <

set

->nbranchrules; ++i )

5752 for

( i = 0; i <

set

->ndisps; ++i )

5758 for

( i = 0; i <

set

->ntables; ++i )

5807 set

->disp_verblevel = verblevel;

5821 set

->num_feastol = feastol;

5841 set

->num_dualfeastol = dualfeastol;

5854 set

->num_barrierconvtol = barrierconvtol;

5873

assert(relaxfeastol >= 0.0);

5875

oldval =

set

->num_relaxfeastol;

5876 set

->num_relaxfeastol = relaxfeastol;

5900 return set

->price_maxvarsroot;

5902 return set

->price_maxvars;

5914 return set

->sepa_maxcutsrootgenfactor;

5916 return set

->sepa_maxcutsgenfactor;

5928 return set

->sepa_maxcutsroot;

5930 return set

->sepa_maxcuts;

5940

maxcoefrange =

set

->sepa_maxcoefratiofacrowprep /

set

->num_feastol;

5941 if

( maxcoefrange < 1.0 )

5944 return

maxcoefrange;

5954 return set

->misc_referencevalue;

5965 return set

->debugsoldata;

5979#undef SCIPsetInfinity 5980#undef SCIPsetEpsilon 5981#undef SCIPsetSumepsilon 5982#undef SCIPsetFeastol 5983#undef SCIPsetDualfeastol 5984#undef SCIPsetBarrierconvtol 5985#undef SCIPsetPseudocosteps 5986#undef SCIPsetPseudocostdelta 5987#undef SCIPsetCutoffbounddelta 5988#undef SCIPsetLPFeastolFactor 5989#undef SCIPsetRelaxfeastol 5990#undef SCIPsetRecompfac 5996#undef SCIPsetIsInfinity 5998#undef SCIPsetIsPositive 5999#undef SCIPsetIsNegative 6000#undef SCIPsetIsIntegral 6001#undef SCIPsetIsScalingIntegral 6002#undef SCIPsetIsFracIntegral 6007#undef SCIPsetIsSumEQ 6008#undef SCIPsetIsSumLT 6009#undef SCIPsetIsSumLE 6010#undef SCIPsetIsSumGT 6011#undef SCIPsetIsSumGE 6012#undef SCIPsetIsSumZero 6013#undef SCIPsetIsSumPositive 6014#undef SCIPsetIsSumNegative 6015#undef SCIPsetSumFloor 6016#undef SCIPsetSumCeil 6017#undef SCIPsetSumRound 6018#undef SCIPsetSumFrac 6019#undef SCIPsetIsFeasEQ 6020#undef SCIPsetIsFeasLT 6021#undef SCIPsetIsFeasLE 6022#undef SCIPsetIsFeasGT 6023#undef SCIPsetIsFeasGE 6024#undef SCIPsetIsFeasZero 6025#undef SCIPsetIsFeasPositive 6026#undef SCIPsetIsFeasNegative 6027#undef SCIPsetIsFeasIntegral 6028#undef SCIPsetIsFeasFracIntegral 6029#undef SCIPsetFeasFloor 6030#undef SCIPsetFeasCeil 6031#undef SCIPsetFeasRound 6032#undef SCIPsetFeasFrac 6033#undef SCIPsetIsDualfeasEQ 6034#undef SCIPsetIsDualfeasLT 6035#undef SCIPsetIsDualfeasLE 6036#undef SCIPsetIsDualfeasGT 6037#undef SCIPsetIsDualfeasGE 6038#undef SCIPsetIsDualfeasZero 6039#undef SCIPsetIsDualfeasPositive 6040#undef SCIPsetIsDualfeasNegative 6041#undef SCIPsetIsDualfeasIntegral 6042#undef SCIPsetIsDualfeasFracIntegral 6043#undef SCIPsetDualfeasFloor 6044#undef SCIPsetDualfeasCeil 6045#undef SCIPsetDualfeasRound 6046#undef SCIPsetDualfeasFrac 6047#undef SCIPsetIsLbBetter 6048#undef SCIPsetIsUbBetter 6049#undef SCIPsetIsEfficacious 6050#undef SCIPsetIsRelEQ 6051#undef SCIPsetIsRelLT 6052#undef SCIPsetIsRelLE 6053#undef SCIPsetIsRelGT 6054#undef SCIPsetIsRelGE 6055#undef SCIPsetIsSumRelEQ 6056#undef SCIPsetIsSumRelLT 6057#undef SCIPsetIsSumRelLE 6058#undef SCIPsetIsSumRelGT 6059#undef SCIPsetIsSumRelGE 6060#undef SCIPsetIsUpdateUnreliable 6061#undef SCIPsetInitializeRandomSeed 6062#undef SCIPsetIsHugeValue 6063#undef SCIPsetGetHugeValue 6064#undef SCIPsetGetSubscipsOff 6073 return set

->num_infinity;

6085 return set

->num_hugeval;

6095 return set

->num_epsilon;

6105 return set

->num_sumepsilon;

6115 return set

->num_feastol;

6125 return set

->num_dualfeastol;

6133 return set

->num_lpfeastolfactor;

6143 return set

->num_barrierconvtol;

6153 return set

->num_pseudocosteps;

6163 return set

->num_pseudocostdelta;

6177 return MIN

(100.0 * feastol, 0.0001);

6187 return set

->num_relaxfeastol;

6198 return set

->num_recompfac;

6209 return

(val >=

set

->num_infinity);

6220 return

(val >=

set

->num_hugeval);

6238 return EPSEQ

(val1, val2,

set

->num_epsilon);

6256 return EPSLT

(val1, val2,

set

->num_epsilon);

6274 return EPSLE

(val1, val2,

set

->num_epsilon);

6292 return EPSGT

(val1, val2,

set

->num_epsilon);

6310 return EPSGE

(val1, val2,

set

->num_epsilon);

6321 return EPSZ

(val,

set

->num_epsilon);

6332 return EPSP

(val,

set

->num_epsilon);

6343 return EPSN

(val,

set

->num_epsilon);

6369

scaledeps =

MAX

(scaledeps, 1.0);

6370

scaledeps *=

set

->num_epsilon;

6372 return EPSISINT

(scalar*val, scaledeps);

6385 return

(val <= set->num_epsilon);

6447 return EPSEQ

(val1, val2,

set

->num_sumepsilon);

6465 return EPSLT

(val1, val2,

set

->num_sumepsilon);

6483 return EPSLE

(val1, val2,

set

->num_sumepsilon);

6501 return EPSGT

(val1, val2,

set

->num_sumepsilon);

6519 return EPSGE

(val1, val2,

set

->num_sumepsilon);

6530 return EPSZ

(val,

set

->num_sumepsilon);

6541 return EPSP

(val,

set

->num_sumepsilon);

6552 return EPSN

(val,

set

->num_sumepsilon);

6618 return EPSZ

(diff,

set

->num_feastol);

6640 return EPSN

(diff,

set

->num_feastol);

6662 return

!

EPSP

(diff,

set

->num_feastol);

6684 return EPSP

(diff,

set

->num_feastol);

6706 return

!

EPSN

(diff,

set

->num_feastol);

6717 return EPSZ

(val,

set

->num_feastol);

6728 return EPSP

(val,

set

->num_feastol);

6739 return EPSN

(val,

set

->num_feastol);

6763 return

(val <= set->num_feastol);

6829 return EPSZ

(diff,

set

->num_dualfeastol);

6851 return EPSN

(diff,

set

->num_dualfeastol);

6873 return

!

EPSP

(diff,

set

->num_dualfeastol);

6895 return EPSP

(diff,

set

->num_dualfeastol);

6917 return

!

EPSN

(diff,

set

->num_dualfeastol);

6928 return EPSZ

(val,

set

->num_dualfeastol);

6939 return EPSP

(val,

set

->num_dualfeastol);

6950 return EPSN

(val,

set

->num_dualfeastol);

6974 return

(val <= set->num_dualfeastol);

7036 if

( oldlb < 0.0 && newlb >= 0.0 )

7039 return EPSGT

(newlb, oldlb,

set

->num_boundstreps *

MAX

(

MIN

(oldub - oldlb,

REALABS

(oldlb)), 1e-3));

7057 if

( oldub > 0.0 && newub <= 0.0 )

7060 return EPSLT

(newub, oldub,

set

->num_boundstreps *

MAX

(

MIN

(oldub - oldlb,

REALABS

(oldub)), 1e-3));

7073 return EPSP

(efficacy,

set

->sepa_minefficacyroot);

7075 return EPSP

(efficacy,

set

->sepa_minefficacy);

7097 return EPSZ

(diff,

set

->num_epsilon);

7119 return EPSN

(diff,

set

->num_epsilon);

7141 return

!

EPSP

(diff,

set

->num_epsilon);

7163 return EPSP

(diff,

set

->num_epsilon);

7185 return

!

EPSN

(diff,

set

->num_epsilon);

7207 return EPSZ

(diff,

set

->num_sumepsilon);

7229 return EPSN

(diff,

set

->num_sumepsilon);

7251 return

!

EPSP

(diff,

set

->num_sumepsilon);

7273 return EPSP

(diff,

set

->num_sumepsilon);

7295 return

!

EPSN

(diff,

set

->num_sumepsilon);

7305 return set

->subscipsoff;

7329

quotient =

ABS

(oldvalue) /

MAX

(

ABS

(newvalue),

set

->num_epsilon);

7331 return

quotient >=

set

->num_recompfac;

7337 const char

* sourcefile,

7339 const char

* formatstr,

7343 const char

* filename;

7344 int

subscipdepth = 0;

7348

assert( sourcefile !=

NULL

);

7355#if defined(_WIN32) || defined(_WIN64) 7356

filename = strrchr(sourcefile,

'\\'

);

7358

filename = strrchr(sourcefile,

'/'

);

7360 if

( filename ==

NULL

)

7361

filename = sourcefile;

7366

subscipdepth =

scip

->stat->subscipdepth;

7368 if

( subscipdepth > 0 )

7373

va_start(ap, formatstr);

7381 const char

* formatstr,

7390

va_start(ap, formatstr);

7398 unsigned int

initialseedvalue

7403 return

(

unsigned int

)(initialseedvalue + (unsigned)

set

->random_randomseedshift);

void SCIPbanditvtableFree(SCIP_BANDITVTABLE **banditvtable)

internal methods for bandit algorithms

SCIP_RETCODE SCIPbranchruleExit(SCIP_BRANCHRULE *branchrule, SCIP_SET *set)

SCIP_RETCODE SCIPbranchruleFree(SCIP_BRANCHRULE **branchrule, SCIP_SET *set)

SCIP_RETCODE SCIPbranchruleInitsol(SCIP_BRANCHRULE *branchrule, SCIP_SET *set)

SCIP_RETCODE SCIPbranchruleExitsol(SCIP_BRANCHRULE *branchrule, SCIP_SET *set)

void SCIPbranchruleEnableOrDisableClocks(SCIP_BRANCHRULE *branchrule, SCIP_Bool enable)

SCIP_RETCODE SCIPbranchruleCopyInclude(SCIP_BRANCHRULE *branchrule, SCIP_SET *set)

SCIP_RETCODE SCIPbranchruleInit(SCIP_BRANCHRULE *branchrule, SCIP_SET *set)

internal methods for branching rules and branching candidate storage

internal methods for clocks and timing issues

SCIP_RETCODE SCIPcomprFree(SCIP_COMPR **compr, SCIP_SET *set)

SCIP_RETCODE SCIPcomprExit(SCIP_COMPR *compr, SCIP_SET *set)

SCIP_RETCODE SCIPcomprInit(SCIP_COMPR *compr, SCIP_SET *set)

internal methods for tree compressions

SCIP_RETCODE SCIPconcsolverDestroyInstance(SCIP_SET *set, SCIP_CONCSOLVER **concsolver)

int SCIPconcsolverGetIdx(SCIP_CONCSOLVER *concsolver)

char * SCIPconcsolverTypeGetName(SCIP_CONCSOLVERTYPE *concsolvertype)

void SCIPconcsolverTypeFree(SCIP_CONCSOLVERTYPE **concsolvertype)

datastructures for concurrent solvers

internal methods for conflict analysis

void SCIPconflicthdlrEnableOrDisableClocks(SCIP_CONFLICTHDLR *conflicthdlr, SCIP_Bool enable)

SCIP_RETCODE SCIPconflicthdlrExit(SCIP_CONFLICTHDLR *conflicthdlr, SCIP_SET *set)

SCIP_RETCODE SCIPconflicthdlrFree(SCIP_CONFLICTHDLR **conflicthdlr, SCIP_SET *set)

SCIP_RETCODE SCIPconflicthdlrExitsol(SCIP_CONFLICTHDLR *conflicthdlr, SCIP_SET *set)

SCIP_RETCODE SCIPconflicthdlrCopyInclude(SCIP_CONFLICTHDLR *conflicthdlr, SCIP_SET *set)

SCIP_RETCODE SCIPconflicthdlrInitsol(SCIP_CONFLICTHDLR *conflicthdlr, SCIP_SET *set)

SCIP_RETCODE SCIPconflicthdlrInit(SCIP_CONFLICTHDLR *conflicthdlr, SCIP_SET *set)

SCIP_RETCODE SCIPconshdlrInit(SCIP_CONSHDLR *conshdlr, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat)

SCIP_RETCODE SCIPconshdlrExitsol(SCIP_CONSHDLR *conshdlr, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_Bool restart)

void SCIPconshdlrEnableOrDisableClocks(SCIP_CONSHDLR *conshdlr, SCIP_Bool enable)

SCIP_RETCODE SCIPconshdlrInitpre(SCIP_CONSHDLR *conshdlr, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat)

SCIP_RETCODE SCIPconshdlrCopyInclude(SCIP_CONSHDLR *conshdlr, SCIP_SET *set, SCIP_Bool *valid)

SCIP_RETCODE SCIPconshdlrExitpre(SCIP_CONSHDLR *conshdlr, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat)

SCIP_RETCODE SCIPconshdlrInitsol(SCIP_CONSHDLR *conshdlr, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat)

SCIP_RETCODE SCIPconshdlrExit(SCIP_CONSHDLR *conshdlr, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat)

SCIP_RETCODE SCIPconshdlrFree(SCIP_CONSHDLR **conshdlr, SCIP_SET *set)

internal methods for constraints and constraint handlers

SCIP_RETCODE SCIPcutselInitsol(SCIP_CUTSEL *cutsel, SCIP_SET *set)

SCIP_RETCODE SCIPcutselExitsol(SCIP_CUTSEL *cutsel, SCIP_SET *set)

SCIP_RETCODE SCIPcutselExit(SCIP_CUTSEL *cutsel, SCIP_SET *set)

SCIP_RETCODE SCIPcutselCopyInclude(SCIP_CUTSEL *cutsel, SCIP_SET *set)

void SCIPcutselEnableOrDisableClocks(SCIP_CUTSEL *cutsel, SCIP_Bool enable)

SCIP_RETCODE SCIPcutselFree(SCIP_CUTSEL **cutsel, SCIP_SET *set)

SCIP_RETCODE SCIPcutselInit(SCIP_CUTSEL *cutsel, SCIP_SET *set)

internal methods for cut selectors

#define SCIPdebugFree(set)

struct SCIP_DebugSolData SCIP_DEBUGSOLDATA

#define SCIPdebugSolDataCreate(debugsoldata)

common defines and data types used in all packages of SCIP

#define SCIP_DEFAULT_INFINITY

#define SCIP_DEFAULT_HUGEVAL

#define SCIP_DEFAULT_MEM_ARRAYGROWINIT

#define SCIP_MAXTREEDEPTH

#define SCIP_DEFAULT_LPFEASTOLFACTOR

#define SCIP_DEFAULT_SUMEPSILON

#define SCIP_DEFAULT_PSEUDOCOSTEPS

#define SCIP_DEFAULT_RECOMPFAC

#define SCIP_DEFAULT_EPSILON

#define SCIP_DEFAULT_PSEUDOCOSTDELTA

#define SCIP_DEFAULT_CHECKFEASTOLFAC

#define SCIP_DEFAULT_DUALFEASTOL

#define SCIP_DEFAULT_BOUNDSTREPS

#define SCIP_DEFAULT_MEM_ARRAYGROWFAC

#define SCIP_DEFAULT_BARRIERCONVTOL

#define SCIP_DEFAULT_FEASTOL

SCIP_RETCODE SCIPdialogCopyInclude(SCIP_DIALOG *dialog, SCIP_SET *set)

internal methods for user interface dialog

SCIP_RETCODE SCIPdispInit(SCIP_DISP *disp, SCIP_SET *set)

SCIP_RETCODE SCIPdispCopyInclude(SCIP_DISP *disp, SCIP_SET *set)

SCIP_RETCODE SCIPdispInitsol(SCIP_DISP *disp, SCIP_SET *set)

SCIP_RETCODE SCIPdispAutoActivate(SCIP_SET *set)

SCIP_RETCODE SCIPdispFree(SCIP_DISP **disp, SCIP_SET *set)

SCIP_RETCODE SCIPdispExitsol(SCIP_DISP *disp, SCIP_SET *set)

SCIP_RETCODE SCIPdispExit(SCIP_DISP *disp, SCIP_SET *set)

internal methods for displaying runtime statistics

SCIP_RETCODE SCIPeventhdlrCopyInclude(SCIP_EVENTHDLR *eventhdlr, SCIP_SET *set)

SCIP_RETCODE SCIPeventhdlrInitsol(SCIP_EVENTHDLR *eventhdlr, SCIP_SET *set)

SCIP_RETCODE SCIPeventhdlrExitsol(SCIP_EVENTHDLR *eventhdlr, SCIP_SET *set)

void SCIPeventhdlrEnableOrDisableClocks(SCIP_EVENTHDLR *eventhdlr, SCIP_Bool enable)

SCIP_RETCODE SCIPeventhdlrExit(SCIP_EVENTHDLR *eventhdlr, SCIP_SET *set)

SCIP_RETCODE SCIPeventhdlrFree(SCIP_EVENTHDLR **eventhdlr, SCIP_SET *set)

SCIP_RETCODE SCIPeventhdlrInit(SCIP_EVENTHDLR *eventhdlr, SCIP_SET *set)

internal methods for managing events

SCIP_RETCODE SCIPexprhdlrFree(SCIP_EXPRHDLR **exprhdlr, SCIP_SET *set, BMS_BLKMEM *blkmem)

void SCIPexprhdlrInit(SCIP_EXPRHDLR *exprhdlr, SCIP_SET *set)

SCIP_RETCODE SCIPexprhdlrCopyInclude(SCIP_EXPRHDLR *exprhdlr, SCIP_SET *targetset)

private functions to work with algebraic expressions

SCIP_STAGE SCIPgetStage(SCIP *scip)

SCIP_Real SCIPlpiInfinity(SCIP_LPI *lpi)

SCIP_Real SCIPrelDiff(SCIP_Real val1, SCIP_Real val2)

const char * SCIPbanditvtableGetName(SCIP_BANDITVTABLE *banditvtable)

const char * SCIPbendersGetName(SCIP_BENDERS *benders)

SCIP_Bool SCIPbranchruleIsInitialized(SCIP_BRANCHRULE *branchrule)

const char * SCIPbranchruleGetName(SCIP_BRANCHRULE *branchrule)

SCIP_Bool SCIPcomprIsInitialized(SCIP_COMPR *compr)

const char * SCIPcomprGetName(SCIP_COMPR *compr)

const char * SCIPconflicthdlrGetName(SCIP_CONFLICTHDLR *conflicthdlr)

SCIP_Bool SCIPconflicthdlrIsInitialized(SCIP_CONFLICTHDLR *conflicthdlr)

int SCIPconshdlrGetSepaPriority(SCIP_CONSHDLR *conshdlr)

const char * SCIPconshdlrGetName(SCIP_CONSHDLR *conshdlr)

SCIP_Bool SCIPconshdlrNeedsCons(SCIP_CONSHDLR *conshdlr)

SCIP_Bool SCIPconshdlrIsInitialized(SCIP_CONSHDLR *conshdlr)

int SCIPconshdlrGetCheckPriority(SCIP_CONSHDLR *conshdlr)

int SCIPconshdlrGetEnfoPriority(SCIP_CONSHDLR *conshdlr)

SCIP_Bool SCIPconshdlrIsClonable(SCIP_CONSHDLR *conshdlr)

const char * SCIPcutselGetName(SCIP_CUTSEL *cutsel)

SCIP_Bool SCIPcutselIsInitialized(SCIP_CUTSEL *cutsel)

SCIP_Bool SCIPdispIsInitialized(SCIP_DISP *disp)

const char * SCIPdispGetName(SCIP_DISP *disp)

int SCIPdispGetPosition(SCIP_DISP *disp)

SCIP_RETCODE SCIPautoselectDisps(SCIP *scip)

SCIP_Bool SCIPeventhdlrIsInitialized(SCIP_EVENTHDLR *eventhdlr)

const char * SCIPeventhdlrGetName(SCIP_EVENTHDLR *eventhdlr)

const char * SCIPexprhdlrGetName(SCIP_EXPRHDLR *exprhdlr)

const char * SCIPheurGetName(SCIP_HEUR *heur)

SCIP_Bool SCIPheurIsInitialized(SCIP_HEUR *heur)

void SCIPresetLPFeastol(SCIP *scip)

SCIP_Real SCIPgetLPFeastol(SCIP *scip)

BMS_BUFMEM * SCIPcleanbuffer(SCIP *scip)

BMS_BUFMEM * SCIPbuffer(SCIP *scip)

const char * SCIPnlpiGetName(SCIP_NLPI *nlpi)

SCIP_Bool SCIPnodeselIsInitialized(SCIP_NODESEL *nodesel)

int SCIPnodeselGetMemsavePriority(SCIP_NODESEL *nodesel)

int SCIPnodeselGetStdPriority(SCIP_NODESEL *nodesel)

const char * SCIPnodeselGetName(SCIP_NODESEL *nodesel)

const char * SCIPpresolGetName(SCIP_PRESOL *presol)

SCIP_Bool SCIPpricerIsActive(SCIP_PRICER *pricer)

const char * SCIPpricerGetName(SCIP_PRICER *pricer)

const char * SCIPpropGetName(SCIP_PROP *prop)

SCIP_Bool SCIPpropIsInitialized(SCIP_PROP *prop)

const char * SCIPreaderGetName(SCIP_READER *reader)

SCIP_Bool SCIPrelaxIsInitialized(SCIP_RELAX *relax)

const char * SCIPrelaxGetName(SCIP_RELAX *relax)

SCIP_RETCODE SCIPenableReoptimization(SCIP *scip, SCIP_Bool enable)

const char * SCIPsepaGetName(SCIP_SEPA *sepa)

SCIP_Bool SCIPsepaIsInitialized(SCIP_SEPA *sepa)

SCIP_Bool SCIPtableIsInitialized(SCIP_TABLE *table)

const char * SCIPtableGetName(SCIP_TABLE *table)

SCIP_RETCODE SCIPenableOrDisableStatisticTiming(SCIP *scip)

SCIP_RETCODE SCIPchgFeastol(SCIP *scip, SCIP_Real feastol)

SCIP_Real SCIPfeastol(SCIP *scip)

SCIP_RETCODE SCIPchgBarrierconvtol(SCIP *scip, SCIP_Real barrierconvtol)

void SCIPmarkLimitChanged(SCIP *scip)

SCIP_RETCODE SCIPchgDualfeastol(SCIP *scip, SCIP_Real dualfeastol)

void SCIPsortPtr(void **ptrarray, SCIP_DECL_SORTPTRCOMP((*ptrcomp)), int len)

void SCIPheurEnableOrDisableClocks(SCIP_HEUR *heur, SCIP_Bool enable)

SCIP_RETCODE SCIPheurInit(SCIP_HEUR *heur, SCIP_SET *set)

SCIP_RETCODE SCIPheurCopyInclude(SCIP_HEUR *heur, SCIP_SET *set)

SCIP_RETCODE SCIPheurInitsol(SCIP_HEUR *heur, SCIP_SET *set)

SCIP_RETCODE SCIPheurExitsol(SCIP_HEUR *heur, SCIP_SET *set)

SCIP_RETCODE SCIPheurFree(SCIP_HEUR **heur, SCIP_SET *set, BMS_BLKMEM *blkmem)

SCIP_RETCODE SCIPheurExit(SCIP_HEUR *heur, SCIP_SET *set)

internal methods for primal heuristics

SCIP_Real SCIPlpGetFeastol(SCIP_LP *lp)

void SCIPlpResetFeastol(SCIP_LP *lp, SCIP_SET *set)

internal methods for LP management

void BMSsetBufferMemoryArraygrowinit(BMS_BUFMEM *buffer, int arraygrowinit)

void BMSsetBufferMemoryArraygrowfac(BMS_BUFMEM *buffer, double arraygrowfac)

#define BMSfreeMemory(ptr)

#define BMSreallocMemoryArray(ptr, num)

#define BMSduplicateMemoryArray(ptr, source, num)

struct BMS_BlkMem BMS_BLKMEM

#define BMSfreeMemoryArrayNull(ptr)

#define BMSallocMemory(ptr)

void SCIPmessageFPrintInfo(SCIP_MESSAGEHDLR *messagehdlr, FILE *file, const char *formatstr,...)

void SCIPmessageVFPrintInfo(SCIP_MESSAGEHDLR *messagehdlr, FILE *file, const char *formatstr, va_list ap)

SCIP_RETCODE SCIPnlpiFree(SCIP_NLPI **nlpi, SCIP_SET *set)

void SCIPnlpiSetPriority(SCIP_NLPI *nlpi, int priority)

SCIP_RETCODE SCIPnlpiCopyInclude(SCIP_NLPI *sourcenlpi, SCIP_SET *targetset)

void SCIPnlpiInit(SCIP_NLPI *nlpi)

internal methods for NLP solver interfaces

SCIP_RETCODE SCIPnodeselExit(SCIP_NODESEL *nodesel, SCIP_SET *set)

void SCIPnodeselEnableOrDisableClocks(SCIP_NODESEL *nodesel, SCIP_Bool enable)

SCIP_RETCODE SCIPnodeselFree(SCIP_NODESEL **nodesel, SCIP_SET *set)

SCIP_RETCODE SCIPnodeselCopyInclude(SCIP_NODESEL *nodesel, SCIP_SET *set)

SCIP_RETCODE SCIPnodeselExitsol(SCIP_NODESEL *nodesel, SCIP_SET *set)

SCIP_RETCODE SCIPnodeselInitsol(SCIP_NODESEL *nodesel, SCIP_SET *set)

SCIP_RETCODE SCIPnodeselInit(SCIP_NODESEL *nodesel, SCIP_SET *set)

internal methods for node selectors and node priority queues

SCIP_RETCODE SCIPparamsetGetBool(SCIP_PARAMSET *paramset, const char *name, SCIP_Bool *value)

SCIP_RETCODE SCIPparamsetCreate(SCIP_PARAMSET **paramset, BMS_BLKMEM *blkmem)

SCIP_RETCODE SCIPparamSetString(SCIP_PARAM *param, SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, const char *value, SCIP_Bool initialize, SCIP_Bool quiet)

SCIP_RETCODE SCIPparamsetSetReal(SCIP_PARAMSET *paramset, SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, const char *name, SCIP_Real value)

SCIP_RETCODE SCIPparamsetGetString(SCIP_PARAMSET *paramset, const char *name, char **value)

SCIP_RETCODE SCIPparamSetLongint(SCIP_PARAM *param, SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, SCIP_Longint value, SCIP_Bool initialize, SCIP_Bool quiet)

SCIP_RETCODE SCIPparamSetReal(SCIP_PARAM *param, SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, SCIP_Real value, SCIP_Bool initialize, SCIP_Bool quiet)

int SCIPparamsetGetNParams(SCIP_PARAMSET *paramset)

SCIP_RETCODE SCIPparamsetSetInt(SCIP_PARAMSET *paramset, SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, const char *name, int value)

SCIP_RETCODE SCIPparamsetAddString(SCIP_PARAMSET *paramset, SCIP_MESSAGEHDLR *messagehdlr, BMS_BLKMEM *blkmem, const char *name, const char *desc, char **valueptr, SCIP_Bool isadvanced, const char *defaultvalue, SCIP_DECL_PARAMCHGD((*paramchgd)), SCIP_PARAMDATA *paramdata)

SCIP_RETCODE SCIPparamsetGetInt(SCIP_PARAMSET *paramset, const char *name, int *value)

SCIP_RETCODE SCIPparamsetGetLongint(SCIP_PARAMSET *paramset, const char *name, SCIP_Longint *value)

SCIP_RETCODE SCIPparamsetAddChar(SCIP_PARAMSET *paramset, SCIP_MESSAGEHDLR *messagehdlr, BMS_BLKMEM *blkmem, const char *name, const char *desc, char *valueptr, SCIP_Bool isadvanced, char defaultvalue, const char *allowedvalues, SCIP_DECL_PARAMCHGD((*paramchgd)), SCIP_PARAMDATA *paramdata)

SCIP_RETCODE SCIPparamsetSetPresolving(SCIP_PARAMSET *paramset, SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, SCIP_PARAMSETTING paramsetting, SCIP_Bool quiet)

void SCIPparamsetFree(SCIP_PARAMSET **paramset, BMS_BLKMEM *blkmem)

SCIP_RETCODE SCIPparamsetAddInt(SCIP_PARAMSET *paramset, SCIP_MESSAGEHDLR *messagehdlr, BMS_BLKMEM *blkmem, const char *name, const char *desc, int *valueptr, SCIP_Bool isadvanced, int defaultvalue, int minvalue, int maxvalue, SCIP_DECL_PARAMCHGD((*paramchgd)), SCIP_PARAMDATA *paramdata)

SCIP_PARAM * SCIPparamsetGetParam(SCIP_PARAMSET *paramset, const char *name)

SCIP_RETCODE SCIPparamsetRead(SCIP_PARAMSET *paramset, SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, const char *filename)

SCIP_RETCODE SCIPparamsetSetChar(SCIP_PARAMSET *paramset, SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, const char *name, char value)

SCIP_Bool SCIPparamGetBool(SCIP_PARAM *param)

SCIP_RETCODE SCIPparamsetSetDefaultBool(SCIP_PARAMSET *paramset, const char *name, SCIP_Bool defaultvalue)

SCIP_RETCODE SCIPparamsetGetChar(SCIP_PARAMSET *paramset, const char *name, char *value)

int SCIPparamGetInt(SCIP_PARAM *param)

SCIP_RETCODE SCIPparamsetSetToSubscipsOff(SCIP_PARAMSET *paramset, SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, SCIP_Bool quiet)

SCIP_RETCODE SCIPparamsetSetToDefaults(SCIP_PARAMSET *paramset, SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr)

SCIP_Real SCIPparamGetReal(SCIP_PARAM *param)

SCIP_Bool SCIPparamsetIsFixed(SCIP_PARAMSET *paramset, const char *name)

SCIP_RETCODE SCIPparamsetAddBool(SCIP_PARAMSET *paramset, SCIP_MESSAGEHDLR *messagehdlr, BMS_BLKMEM *blkmem, const char *name, const char *desc, SCIP_Bool *valueptr, SCIP_Bool isadvanced, SCIP_Bool defaultvalue, SCIP_DECL_PARAMCHGD((*paramchgd)), SCIP_PARAMDATA *paramdata)

SCIP_RETCODE SCIPparamsetWrite(SCIP_PARAMSET *paramset, SCIP_MESSAGEHDLR *messagehdlr, const char *filename, SCIP_Bool comments, SCIP_Bool onlychanged)

SCIP_RETCODE SCIPparamsetSetString(SCIP_PARAMSET *paramset, SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, const char *name, const char *value)

SCIP_RETCODE SCIPparamsetSetToDefault(SCIP_PARAMSET *paramset, SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, const char *paramname)

SCIP_RETCODE SCIPparamsetSetDefaultInt(SCIP_PARAMSET *paramset, const char *name, int defaultvalue)

SCIP_RETCODE SCIPparamsetAddReal(SCIP_PARAMSET *paramset, SCIP_MESSAGEHDLR *messagehdlr, BMS_BLKMEM *blkmem, const char *name, const char *desc, SCIP_Real *valueptr, SCIP_Bool isadvanced, SCIP_Real defaultvalue, SCIP_Real minvalue, SCIP_Real maxvalue, SCIP_DECL_PARAMCHGD((*paramchgd)), SCIP_PARAMDATA *paramdata)

SCIP_RETCODE SCIPparamsetCopyParams(SCIP_PARAMSET *sourceparamset, SCIP_PARAMSET *targetparamset, SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr)

SCIP_RETCODE SCIPparamSetBool(SCIP_PARAM *param, SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, SCIP_Bool value, SCIP_Bool initialize, SCIP_Bool quiet)

SCIP_RETCODE SCIPparamsetSetHeuristics(SCIP_PARAMSET *paramset, SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, SCIP_PARAMSETTING paramsetting, SCIP_Bool quiet)

SCIP_RETCODE SCIPparamsetSetSeparating(SCIP_PARAMSET *paramset, SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, SCIP_PARAMSETTING paramsetting, SCIP_Bool quiet)

SCIP_RETCODE SCIPparamsetSetLongint(SCIP_PARAMSET *paramset, SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, const char *name, SCIP_Longint value)

SCIP_RETCODE SCIPparamsetSetEmphasis(SCIP_PARAMSET *paramset, SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, SCIP_PARAMEMPHASIS paramemphasis, SCIP_Bool quiet)

SCIP_RETCODE SCIPparamsetGetReal(SCIP_PARAMSET *paramset, const char *name, SCIP_Real *value)

SCIP_PARAM ** SCIPparamsetGetParams(SCIP_PARAMSET *paramset)

SCIP_RETCODE SCIPparamsetSet(SCIP_PARAMSET *paramset, SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, const char *name, const char *value, SCIP_Bool fix)

SCIP_RETCODE SCIPparamsetAddLongint(SCIP_PARAMSET *paramset, SCIP_MESSAGEHDLR *messagehdlr, BMS_BLKMEM *blkmem, const char *name, const char *desc, SCIP_Longint *valueptr, SCIP_Bool isadvanced, SCIP_Longint defaultvalue, SCIP_Longint minvalue, SCIP_Longint maxvalue, SCIP_DECL_PARAMCHGD((*paramchgd)), SCIP_PARAMDATA *paramdata)

SCIP_RETCODE SCIPparamsetFix(SCIP_PARAMSET *paramset, const char *name, SCIP_Bool fixed)

SCIP_RETCODE SCIPparamSetChar(SCIP_PARAM *param, SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, char value, SCIP_Bool initialize, SCIP_Bool quiet)

SCIP_RETCODE SCIPparamsetSetBool(SCIP_PARAMSET *paramset, SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, const char *name, SCIP_Bool value)

SCIP_RETCODE SCIPparamSetInt(SCIP_PARAM *param, SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, int value, SCIP_Bool initialize, SCIP_Bool quiet)

internal methods for handling parameter settings

SCIP_RETCODE SCIPpresolFree(SCIP_PRESOL **presol, SCIP_SET *set)

void SCIPpresolEnableOrDisableClocks(SCIP_PRESOL *presol, SCIP_Bool enable)

SCIP_RETCODE SCIPpresolExitpre(SCIP_PRESOL *presol, SCIP_SET *set)

SCIP_RETCODE SCIPpresolExit(SCIP_PRESOL *presol, SCIP_SET *set)

SCIP_RETCODE SCIPpresolInit(SCIP_PRESOL *presol, SCIP_SET *set)

SCIP_RETCODE SCIPpresolCopyInclude(SCIP_PRESOL *presol, SCIP_SET *set)

SCIP_RETCODE SCIPpresolInitpre(SCIP_PRESOL *presol, SCIP_SET *set)

internal methods for presolvers

SCIP_RETCODE SCIPpricerInitsol(SCIP_PRICER *pricer, SCIP_SET *set)

SCIP_RETCODE SCIPpricerActivate(SCIP_PRICER *pricer, SCIP_SET *set)

SCIP_RETCODE SCIPpricerCopyInclude(SCIP_PRICER *pricer, SCIP_SET *set, SCIP_Bool *valid)

SCIP_RETCODE SCIPpricerExit(SCIP_PRICER *pricer, SCIP_SET *set)

void SCIPpricerEnableOrDisableClocks(SCIP_PRICER *pricer, SCIP_Bool enable)

SCIP_RETCODE SCIPpricerExitsol(SCIP_PRICER *pricer, SCIP_SET *set)

SCIP_RETCODE SCIPpricerInit(SCIP_PRICER *pricer, SCIP_SET *set)

SCIP_RETCODE SCIPpricerFree(SCIP_PRICER **pricer, SCIP_SET *set)

internal methods for variable pricers

SCIP_RETCODE SCIPpropInitsol(SCIP_PROP *prop, SCIP_SET *set)

SCIP_RETCODE SCIPpropInit(SCIP_PROP *prop, SCIP_SET *set)

SCIP_RETCODE SCIPpropCopyInclude(SCIP_PROP *prop, SCIP_SET *set)

SCIP_RETCODE SCIPpropExitpre(SCIP_PROP *prop, SCIP_SET *set)

SCIP_RETCODE SCIPpropExit(SCIP_PROP *prop, SCIP_SET *set)

void SCIPpropEnableOrDisableClocks(SCIP_PROP *prop, SCIP_Bool enable)

SCIP_RETCODE SCIPpropExitsol(SCIP_PROP *prop, SCIP_SET *set, SCIP_Bool restart)

SCIP_RETCODE SCIPpropInitpre(SCIP_PROP *prop, SCIP_SET *set)

SCIP_RETCODE SCIPpropFree(SCIP_PROP **prop, SCIP_SET *set)

internal methods for propagators

public methods for NLP solver interfaces

SCIP_RETCODE SCIPreaderFree(SCIP_READER **reader, SCIP_SET *set)

SCIP_RETCODE SCIPreaderCopyInclude(SCIP_READER *reader, SCIP_SET *set)

void SCIPreaderEnableOrDisableClocks(SCIP_READER *reader, SCIP_Bool enable)

internal methods for input file readers

SCIP_RETCODE SCIPrelaxInit(SCIP_RELAX *relax, SCIP_SET *set)

SCIP_RETCODE SCIPrelaxExit(SCIP_RELAX *relax, SCIP_SET *set)

SCIP_RETCODE SCIPrelaxFree(SCIP_RELAX **relax, SCIP_SET *set)

SCIP_RETCODE SCIPrelaxCopyInclude(SCIP_RELAX *relax, SCIP_SET *set)

void SCIPrelaxEnableOrDisableClocks(SCIP_RELAX *relax, SCIP_Bool enable)

SCIP_RETCODE SCIPrelaxInitsol(SCIP_RELAX *relax, SCIP_SET *set)

SCIP_RETCODE SCIPrelaxExitsol(SCIP_RELAX *relax, SCIP_SET *set)

internal methods for relaxators

SCIP_RETCODE SCIPsepaExitsol(SCIP_SEPA *sepa, SCIP_SET *set)

SCIP_RETCODE SCIPsepaCopyInclude(SCIP_SEPA *sepa, SCIP_SET *set)

SCIP_RETCODE SCIPsepaInitsol(SCIP_SEPA *sepa, SCIP_SET *set)

SCIP_RETCODE SCIPsepaExit(SCIP_SEPA *sepa, SCIP_SET *set)

SCIP_RETCODE SCIPsepaInit(SCIP_SEPA *sepa, SCIP_SET *set)

SCIP_RETCODE SCIPsepaFree(SCIP_SEPA **sepa, SCIP_SET *set)

void SCIPsepaEnableOrDisableClocks(SCIP_SEPA *sepa, SCIP_Bool enable)

internal methods for separators

#define SCIP_DEFAULT_CONCURRENT_FREQFACTOR

#define SCIP_DEFAULT_BRANCH_MIDPULL

#define SCIP_DEFAULT_SEPA_CUTAGELIMIT

void SCIPsetSortCutsels(SCIP_SET *set)

SCIP_Bool SCIPsetIsDualfeasZero(SCIP_SET *set, SCIP_Real val)

SCIP_DISP * SCIPsetFindDisp(SCIP_SET *set, const char *name)

SCIP_Real SCIPsetFloor(SCIP_SET *set, SCIP_Real val)

#define SCIP_DEFAULT_LP_CLEANUPCOLSROOT

#define SCIP_DEFAULT_WRITE_GENNAMES_OFFSET

SCIP_RETCODE SCIPsetIncludeReader(SCIP_SET *set, SCIP_READER *reader)

#define SCIP_DEFAULT_LIMIT_SOLUTIONS

void SCIPsetSortBranchrules(SCIP_SET *set)

#define SCIP_DEFAULT_SEPA_MAXROUNDSROOT

SCIP_Bool SCIPsetIsDualfeasLE(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)

#define SCIP_DEFAULT_PRICE_MAXVARSROOT

#define SCIP_DEFAULT_CONF_PREFERBINARY

#define SCIP_DEFAULT_REOPT_OBJSIMSOL

#define SCIP_DEFAULT_MEM_TREEGROWFAC

#define SCIP_DEFAULT_LP_THREADS

SCIP_RETCODE SCIPsetSetSeparating(SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, SCIP_PARAMSETTING paramsetting, SCIP_Bool quiet)

#define SCIP_DEFAULT_CONF_MAXVARSFAC

#define SCIP_DEFAULT_SEPA_POOLFREQ

void SCIPsetSortBranchrulesName(SCIP_SET *set)

SCIP_RETCODE SCIPsetSetBarrierconvtol(SCIP_SET *set, SCIP_Real barrierconvtol)

#define SCIP_DEFAULT_SEPA_MAXBOUNDDIST

#define SCIP_DEFAULT_MISC_USESYMMETRY

#define SCIP_DEFAULT_VISUAL_OBJEXTERN

#define SCIP_DEFAULT_LIMIT_ABSGAP

#define SCIP_DEFAULT_LP_DISABLECUTOFF

SCIP_RETCODE SCIPsetAddIntParam(SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, BMS_BLKMEM *blkmem, const char *name, const char *desc, int *valueptr, SCIP_Bool isadvanced, int defaultvalue, int minvalue, int maxvalue, SCIP_DECL_PARAMCHGD((*paramchgd)), SCIP_PARAMDATA *paramdata)

#define SCIP_DEFAULT_PARALLEL_MODE

int SCIPsetCalcTreeGrowSize(SCIP_SET *set, int num)

void SCIPsetSortConflicthdlrsName(SCIP_SET *set)

SCIP_Bool SCIPsetIsLbBetter(SCIP_SET *set, SCIP_Real newlb, SCIP_Real oldlb, SCIP_Real oldub)

#define SCIP_DEFAULT_PARALLEL_MINNTHREADS

#define SCIP_DEFAULT_MISC_ESTIMEXTERNMEM

#define SCIP_DEFAULT_DECOMP_MAXGRAPHEDGE

#define SCIP_DEFAULT_CONCURRENT_PRESOLVEBEFORE

#define SCIP_DEFAULT_CONS_DISABLEENFOPS

#define SCIP_DEFAULT_LIMIT_MEMORY

void SCIPsetSortPresolsName(SCIP_SET *set)

#define SCIP_DEFAULT_COMPR_ENABLE

SCIP_RETCODE SCIPsetResetParam(SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, const char *name)

SCIP_EXPRHDLR * SCIPsetFindExprhdlr(SCIP_SET *set, const char *name)

#define SCIP_DEFAULT_BENDERS_SOLTOL

SCIP_Bool SCIPsetIsRelLT(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)

#define SCIP_DEFAULT_DISP_FREQ

SCIP_Bool SCIPsetIsEfficacious(SCIP_SET *set, SCIP_Bool root, SCIP_Real efficacy)

SCIP_NODESEL * SCIPsetFindNodesel(SCIP_SET *set, const char *name)

#define SCIP_DEFAULT_LP_ITERLIM

#define SCIP_DEFAULT_CONF_FULLSHORTENCONFLICT

#define SCIP_DEFAULT_MISC_CALCINTEGRAL

#define SCIP_DEFAULT_BRANCH_DELAYPSCOST

SCIP_Bool SCIPsetExistsDialog(SCIP_SET *set, SCIP_DIALOG *dialog)

#define SCIP_DEFAULT_HISTORY_ALLOWMERGE

SCIP_RETCODE SCIPsetSetFeastol(SCIP_SET *set, SCIP_LP *lp, SCIP_Real feastol)

#define SCIP_DEFAULT_PRICE_ABORTFAC

#define SCIP_DEFAULT_READ_INITIALCONSS

void SCIPsetSortPresols(SCIP_SET *set)

#define SCIP_DEFAULT_CONCURRENT_MAXNSOLS

SCIP_PRICER * SCIPsetFindPricer(SCIP_SET *set, const char *name)

#define SCIP_DEFAULT_PROP_MAXROUNDS

#define SCIP_DEFAULT_NODESEL_CHILDSEL

SCIP_RETCODE SCIPsetSetRealParam(SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, const char *name, SCIP_Real value)

#define SCIP_DEFAULT_READ_DYNAMICCOLS

#define SCIP_DEFAULT_MISC_SCALEOBJ

#define SCIP_DEFAULT_SEPA_FILTERCUTPOOLREL

#define SCIP_DEFAULT_BRANCH_SUMADJUSTSCORE

SCIP_RETCODE SCIPsetWriteParams(SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, const char *filename, SCIP_Bool comments, SCIP_Bool onlychanged)

#define SCIP_DEFAULT_REOPT_REDUCETOFRONTIER

#define SCIP_DEFAULT_CONF_MAXLPLOOPS

SCIP_Bool SCIPsetIsFeasPositive(SCIP_SET *set, SCIP_Real val)

SCIP_TABLE * SCIPsetFindTable(SCIP_SET *set, const char *name)

SCIP_RETCODE SCIPsetAddStringParam(SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, BMS_BLKMEM *blkmem, const char *name, const char *desc, char **valueptr, SCIP_Bool isadvanced, const char *defaultvalue, SCIP_DECL_PARAMCHGD((*paramchgd)), SCIP_PARAMDATA *paramdata)

SCIP_Bool SCIPsetIsHugeValue(SCIP_SET *set, SCIP_Real val)

#define SCIP_DEFAULT_REOPT_USESPLITCONS

#define SCIP_DEFAULT_CONCURRENT_INITSEED

#define SCIP_DEFAULT_CONF_DOWNLOCKSCOREFAC

#define SCIP_DEFAULT_CONF_SEPAALTPROOFS

SCIP_Bool SCIPsetIsDualfeasFracIntegral(SCIP_SET *set, SCIP_Real val)

SCIP_RETCODE SCIPsetIncludeBenders(SCIP_SET *set, SCIP_BENDERS *benders)

SCIP_Real SCIPsetDualfeasCeil(SCIP_SET *set, SCIP_Real val)

SCIP_Bool SCIPsetIsGE(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)

SCIP_RETCODE SCIPsetSetStringParam(SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, const char *name, const char *value)

#define SCIP_DEFAULT_DISP_VERBLEVEL

SCIP_Real SCIPsetSumRound(SCIP_SET *set, SCIP_Real val)

#define SCIP_DEFAULT_PRESOL_RESTARTFAC

#define SCIP_DEFAULT_VISUAL_BAKFILENAME

#define SCIP_DEFAULT_SEPA_MAXCOEFRATIO

SCIP_COMPR * SCIPsetFindCompr(SCIP_SET *set, const char *name)

#define SCIP_DEFAULT_LP_COLAGELIMIT

#define SCIP_DEFAULT_PRESOL_SUBRESTARTFAC

#define SCIP_DEFAULT_CONF_WEIGHTVALIDDEPTH

#define SCIP_DEFAULT_LP_CONDITIONLIMIT

#define SCIP_DEFAULT_LP_ROOTITERLIM

SCIP_Real SCIPsetFeasCeil(SCIP_SET *set, SCIP_Real val)

#define SCIP_DEFAULT_CONF_USEINFLP

SCIP_RETCODE SCIPsetGetCharParam(SCIP_SET *set, const char *name, char *value)

SCIP_Real SCIPsetSumFloor(SCIP_SET *set, SCIP_Real val)

SCIP_Bool SCIPsetIsFeasFracIntegral(SCIP_SET *set, SCIP_Real val)

#define SCIP_DEFAULT_MISC_PRINTREASON

#define SCIP_DEFAULT_LIMIT_TIME

#define SCIP_DEFAULT_CONF_USELOCALROWS

#define SCIP_DEFAULT_CONF_RESTARTNUM

SCIP_RETCODE SCIPsetIncludeBranchrule(SCIP_SET *set, SCIP_BRANCHRULE *branchrule)

SCIP_RETCODE SCIPsetSetDefaultIntParam(SCIP_SET *set, const char *name, int defaultvalue)

SCIP_Bool SCIPsetIsFeasNegative(SCIP_SET *set, SCIP_Real val)

#define SCIP_DEFAULT_NLP_DISABLE

SCIP_RETCODE SCIPsetAddLongintParam(SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, BMS_BLKMEM *blkmem, const char *name, const char *desc, SCIP_Longint *valueptr, SCIP_Bool isadvanced, SCIP_Longint defaultvalue, SCIP_Longint minvalue, SCIP_Longint maxvalue, SCIP_DECL_PARAMCHGD((*paramchgd)), SCIP_PARAMDATA *paramdata)

#define SCIP_DEFAULT_RANDOM_PERMUTECONSS

#define SCIP_DEFAULT_LIMIT_DUAL

SCIP_Bool SCIPsetGetSubscipsOff(SCIP_SET *set)

#define SCIP_DEFAULT_SEPA_MINEFFICACYROOT

SCIP_RETCODE SCIPsetIncludeRelax(SCIP_SET *set, SCIP_RELAX *relax)

SCIP_Real SCIPsetSetRelaxfeastol(SCIP_SET *set, SCIP_Real relaxfeastol)

#define SCIP_DEFAULT_LP_CLEANUPROWS

SCIP_Bool SCIPsetIsSumRelGE(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)

SCIP_RETCODE SCIPsetIncludeBanditvtable(SCIP_SET *set, SCIP_BANDITVTABLE *banditvtable)

SCIP_RETCODE SCIPsetIncludeConcsolverType(SCIP_SET *set, SCIP_CONCSOLVERTYPE *concsolvertype)

SCIP_Real SCIPsetFeastol(SCIP_SET *set)

#define SCIP_DEFAULT_MISC_EXACTSOLVE

#define SCIP_DEFAULT_MISC_IMPROVINGSOLS

SCIP_RETCODE SCIPsetInitsolPlugins(SCIP_SET *set, BMS_BLKMEM *blkmem, SCIP_STAT *stat)

#define SCIP_DEFAULT_CONF_ALLOWLOCAL

#define SCIP_DEFAULT_CONF_UPLOCKSCOREFAC

SCIP_RETCODE SCIPsetGetLongintParam(SCIP_SET *set, const char *name, SCIP_Longint *value)

SCIP_RETCODE SCIPsetIncludeSepa(SCIP_SET *set, SCIP_SEPA *sepa)

#define SCIP_DEFAULT_SEPA_ORTHOFUNC

#define SCIP_DEFAULT_REOPT_MAXDIFFOFNODES

#define SCIP_DEFAULT_BENDERS_COPYBENDERS

#define SCIP_DEFAULT_CONF_FUIPLEVELS

#define SCIP_DEFAULT_CONF_CLEANBNDDEPEND

#define SCIP_DEFAULT_MISC_USECONSTABLE

#define SCIP_DEFAULT_LP_LEXDUALMAXROUNDS

SCIP_RETCODE SCIPsetIncludeTable(SCIP_SET *set, SCIP_TABLE *table)

SCIP_Real SCIPsetPseudocosteps(SCIP_SET *set)

#define SCIP_DEFAULT_VISUAL_DISPSOLS

#define SCIP_DEFAULT_TIME_NLPIEVAL

#define SCIP_DEFAULT_BRANCH_CHECKSBSOL

SCIP_RETCODE SCIPsetGetStringParam(SCIP_SET *set, const char *name, char **value)

SCIP_RETCODE SCIPsetSetHeuristics(SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, SCIP_PARAMSETTING paramsetting, SCIP_Bool quiet)

#define SCIP_DEFAULT_CONF_USEPROP

SCIP_Bool SCIPsetIsSumGT(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)

#define SCIP_DEFAULT_LP_PRICING

SCIP_RETCODE SCIPsetInitPlugins(SCIP_SET *set, BMS_BLKMEM *blkmem, SCIP_STAT *stat)

#define SCIP_DEFAULT_PRESOL_IMMRESTARTFAC

#define SCIP_DEFAULT_BRANCH_FORCEALL

#define SCIP_DEFAULT_LIMIT_BESTSOL

SCIP_RETCODE SCIPsetSetDualfeastol(SCIP_SET *set, SCIP_Real dualfeastol)

#define SCIP_DEFAULT_REOPT_MAXSAVEDNODES

SCIP_RETCODE SCIPsetSetReoptimizationParams(SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr)

#define SCIP_DEFAULT_SEPA_MAXCUTSGENFACTOR

#define SCIP_DEFAULT_MISC_OUTPUTORIGSOL

#define SCIP_DEFAULT_RANDOM_RANDSEEDSHIFT

SCIP_RETCODE SCIPsetSetIntParam(SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, const char *name, int value)

SCIP_PARAM ** SCIPsetGetParams(SCIP_SET *set)

SCIP_RETCODE SCIPsetAddCharParam(SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, BMS_BLKMEM *blkmem, const char *name, const char *desc, char *valueptr, SCIP_Bool isadvanced, char defaultvalue, const char *allowedvalues, SCIP_DECL_PARAMCHGD((*paramchgd)), SCIP_PARAMDATA *paramdata)

SCIP_Real SCIPsetCeil(SCIP_SET *set, SCIP_Real val)

#define SCIP_DEFAULT_LP_RESOLVEITERFAC

#define SCIP_DEFAULT_PRINTZEROS

SCIP_RETCODE SCIPsetIncludeConflicthdlr(SCIP_SET *set, SCIP_CONFLICTHDLR *conflicthdlr)

int SCIPsetGetSepaMaxcuts(SCIP_SET *set, SCIP_Bool root)

SCIP_RETCODE SCIPsetFreeConcsolvers(SCIP_SET *set)

SCIP_Bool SCIPsetIsRelEQ(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)

SCIP_RETCODE SCIPsetAddBoolParam(SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, BMS_BLKMEM *blkmem, const char *name, const char *desc, SCIP_Bool *valueptr, SCIP_Bool isadvanced, SCIP_Bool defaultvalue, SCIP_DECL_PARAMCHGD((*paramchgd)), SCIP_PARAMDATA *paramdata)

#define SCIP_DEFAULT_LP_CLEANUPCOLS

#define SCIP_DEFAULT_SEPA_MAXSTALLROUNDS

SCIP_RETCODE SCIPsetIncludePricer(SCIP_SET *set, SCIP_PRICER *pricer)

SCIP_Bool SCIPsetIsDualfeasLT(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)

SCIP_Bool SCIPsetIsFeasGT(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)

#define SCIP_DEFAULT_SEPA_MINACTIVITYQUOT

SCIP_Bool SCIPsetIsFeasLE(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)

#define SCIP_DEFAULT_BRANCH_ROUNDSBSOL

#define SCIP_DEFAULT_PRESOL_DONOTMULTAGGR

#define SCIP_DEFAULT_REOPT_SEPABESTSOL

#define SCIP_DEFAULT_SEPA_MAXRUNS

#define SCIP_DEFAULT_BRANCH_SCOREFUNC

SCIP_Real SCIPsetFeasRound(SCIP_SET *set, SCIP_Real val)

#define SCIP_DEFAULT_PRESOL_RESTARTMINRED

#define SCIP_DEFAULT_CONF_MAXVARSDETECTIMPLIEDBOUNDS

SCIP_Bool SCIPsetIsFeasEQ(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)

#define SCIP_DEFAULT_HISTORY_ALLOWTRANSFER

void SCIPsetSortPropsPresol(SCIP_SET *set)

SCIP_Bool SCIPsetIsPositive(SCIP_SET *set, SCIP_Real val)

SCIP_Bool SCIPsetIsSumRelGT(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)

#define SCIP_DEFAULT_CONF_REPROPAGATE

#define SCIP_DEFAULT_CONCURRENT_COMMVARBNDS

#define SCIP_DEFAULT_CONCURRENT_PARAMSETPREFIX

#define SCIP_DEFAULT_DISP_LPINFO

#define SCIP_DEFAULT_TIME_CLOCKTYPE

#define SCIP_DEFAULT_HISTORY_VALUEBASED

SCIP_RELAX * SCIPsetFindRelax(SCIP_SET *set, const char *name)

#define SCIP_DEFAULT_TIME_RARECLOCKCHECK

SCIP_RETCODE SCIPsetSetDefaultBoolParam(SCIP_SET *set, const char *name, SCIP_Bool defaultvalue)

SCIP_HEUR * SCIPsetFindHeur(SCIP_SET *set, const char *name)

#define SCIP_DEFAULT_CONF_MINMAXVARS

SCIP_Bool SCIPsetIsLE(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)

void SCIPsetSortRelaxsName(SCIP_SET *set)

void SCIPsetDebugMessagePrint(SCIP_SET *set, const char *formatstr,...)

#define SCIP_DEFAULT_CONF_SETTLELOCAL

void SCIPsetSortPropsName(SCIP_SET *set)

#define SCIP_DEFAULT_CONF_CONFLITWEIGHT

SCIP_Bool SCIPsetIsScalingIntegral(SCIP_SET *set, SCIP_Real val, SCIP_Real scalar)

SCIP_Real SCIPsetFeasFloor(SCIP_SET *set, SCIP_Real val)

#define SCIP_DEFAULT_CONF_KEEPREPROP

SCIP_Real SCIPsetRelaxfeastol(SCIP_SET *set)

SCIP_Bool SCIPsetIsParamFixed(SCIP_SET *set, const char *name)

#define SCIP_DEFAULT_LP_CHECKPRIMFEAS

SCIP_RETCODE SCIPsetCopyPlugins(SCIP_SET *sourceset, SCIP_SET *targetset, SCIP_Bool copyreaders, SCIP_Bool copypricers, SCIP_Bool copyconshdlrs, SCIP_Bool copyconflicthdlrs, SCIP_Bool copypresolvers, SCIP_Bool copyrelaxators, SCIP_Bool copyseparators, SCIP_Bool copycutselectors, SCIP_Bool copypropagators, SCIP_Bool copyheuristics, SCIP_Bool copyeventhdlrs, SCIP_Bool copynodeselectors, SCIP_Bool copybranchrules, SCIP_Bool copydisplays, SCIP_Bool copydialogs, SCIP_Bool copytables, SCIP_Bool copyexprhdlrs, SCIP_Bool copynlpis, SCIP_Bool *allvalid)

SCIP_RETCODE SCIPsetIncludeDisp(SCIP_SET *set, SCIP_DISP *disp)

#define SCIP_DEFAULT_LP_CLEARINITIALPROBINGLP

#define SCIP_DEFAULT_CONCURRENT_CHANGECHILDSEL

SCIP_RETCODE SCIPsetSetLongintParam(SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, const char *name, SCIP_Longint value)

#define SCIP_DEFAULT_CONF_WEIGHTSIZE

#define SCIP_DEFAULT_PRICE_DELVARS

#define SCIP_DEFAULT_MISC_FINITESOLSTORE

#define SCIP_DEFAULT_LP_SCALING

void SCIPsetSortRelaxs(SCIP_SET *set)

SCIP_RETCODE SCIPsetAddRealParam(SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, BMS_BLKMEM *blkmem, const char *name, const char *desc, SCIP_Real *valueptr, SCIP_Bool isadvanced, SCIP_Real defaultvalue, SCIP_Real minvalue, SCIP_Real maxvalue, SCIP_DECL_PARAMCHGD((*paramchgd)), SCIP_PARAMDATA *paramdata)

SCIP_Bool SCIPsetIsSumLE(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)

void SCIPsetPrintDebugMessage(SCIP_SET *set, const char *sourcefile, int sourceline, const char *formatstr,...)

#define SCIP_DEFAULT_CONF_ENABLE

#define SCIP_DEFAULT_SEPA_MINEFFICACY

#define SCIP_DEFAULT_CONF_DEPTHSCOREFAC

#define SCIP_DEFAULT_TIME_STATISTICTIMING

#define SCIP_DEFAULT_LIMIT_NODES

SCIP_Bool SCIPsetIsDualfeasNegative(SCIP_SET *set, SCIP_Real val)

SCIP_CONCSOLVERTYPE * SCIPsetFindConcsolverType(SCIP_SET *set, const char *name)

#define SCIP_DEFAULT_BRANCH_FIRSTSBCHILD

SCIP_RETCODE SCIPsetSetVerbLevel(SCIP_SET *set, SCIP_VERBLEVEL verblevel)

#define SCIP_DEFAULT_REOPT_SAVESOLS

SCIP_RETCODE SCIPsetGetBoolParam(SCIP_SET *set, const char *name, SCIP_Bool *value)

SCIP_CONSHDLR * SCIPsetFindConshdlr(SCIP_SET *set, const char *name)

#define SCIP_DEFAULT_LP_FASTMIP

#define SCIP_DEFAULT_PARALLEL_MAXNTHREADS

#define SCIP_DEFAULT_CONF_MINIMPROVE

#define SCIP_DEFAULT_REOPT_VARORDERINTERDICTION

SCIP_Real SCIPsetDualfeastol(SCIP_SET *set)

#define SCIP_DEFAULT_WRITE_ALLCONSS

void SCIPsetSortComprs(SCIP_SET *set)

#define SCIP_DEFAULT_PRESOL_MAXROUNDS

SCIP_RETCODE SCIPsetIncludeConcsolver(SCIP_SET *set, SCIP_CONCSOLVER *concsolver)

#define SCIP_DEFAULT_LP_REFACTORINTERVAL

SCIP_Real SCIPsetEpsilon(SCIP_SET *set)

SCIP_RETCODE SCIPsetChgParamFixed(SCIP_SET *set, const char *name, SCIP_Bool fixed)

SCIP_BENDERS * SCIPsetFindBenders(SCIP_SET *set, const char *name)

#define SCIP_DEFAULT_REOPT_SOLVELPDIFF

SCIP_Bool SCIPsetIsSumRelEQ(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)

#define SCIP_DEFAULT_CONS_OBSOLETEAGE

SCIP_CUTSEL * SCIPsetFindCutsel(SCIP_SET *set, const char *name)

SCIP_RETCODE SCIPsetIncludeExprhdlr(SCIP_SET *set, SCIP_EXPRHDLR *exprhdlr)

void SCIPsetSortComprsName(SCIP_SET *set)

#define SCIP_DEFAULT_LIMIT_GAP

#define SCIP_DEFAULT_CONF_PROOFSCOREFAC

SCIP_RETCODE SCIPsetExitprePlugins(SCIP_SET *set, BMS_BLKMEM *blkmem, SCIP_STAT *stat)

SCIP_Bool SCIPsetIsSumGE(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)

#define SCIP_DEFAULT_LP_RESOLVEALGORITHM

#define SCIP_DEFAULT_CONF_WEIGHTREPROPDEPTH

void SCIPsetSortPricersName(SCIP_SET *set)

#define SCIP_DEFAULT_MEM_PATHGROWFAC

#define SCIP_DEFAULT_REOPT_OBJSIMDELAY

#define SCIP_DEFAULT_SEPA_MAXSTALLROUNDSROOT

#define SCIP_DEFAULT_PROP_MAXROUNDSROOT

SCIP_RETCODE SCIPsetChgRealParam(SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, SCIP_PARAM *param, SCIP_Real value)

SCIP_Bool SCIPsetIsEQ(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)

SCIP_Bool SCIPsetIsFeasZero(SCIP_SET *set, SCIP_Real val)

#define SCIP_DEFAULT_DECOMP_BENDERSLABELS

#define SCIP_DEFAULT_MISC_TRANSSOLSORIG

#define SCIP_DEFAULT_LIMIT_RESTARTS

SCIP_RETCODE SCIPsetChgBoolParam(SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, SCIP_PARAM *param, SCIP_Bool value)

#define SCIP_DEFAULT_BRANCH_LPGAINNORMALIZE

#define SCIP_DEFAULT_LP_CLEANUPROWSROOT

SCIP_Bool SCIPsetIsSumNegative(SCIP_SET *set, SCIP_Real val)

#define SCIP_DEFAULT_CONF_USEPSEUDO

#define SCIP_DEFAULT_LP_LEXDUALALGO

#define SCIP_DEFAULT_RANDOM_PERMUTATIONSEED

#define SCIP_DEFAULT_LP_RESOLVEITERMIN

#define SCIP_DEFAULT_REOPT_SEPAGLBINFSUBTREES

SCIP_STAGE SCIPsetGetStage(SCIP_SET *set)

SCIP_Bool SCIPsetIsSumLT(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)

#define SCIP_DEFAULT_PRESOL_CLQTABLEFAC

SCIP_RETCODE SCIPsetIncludeProp(SCIP_SET *set, SCIP_PROP *prop)

#define SCIP_DEFAULT_VISUAL_VBCFILENAME

SCIP_RETCODE SCIPsetIncludeCutsel(SCIP_SET *set, SCIP_CUTSEL *cutsel)

#define SCIP_DEFAULT_REOPT_SAVEPROP

SCIP_Real SCIPsetGetSepaMaxCoefRatioRowprep(SCIP_SET *set)

SCIP_Bool SCIPsetIsFeasLT(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)

#define SCIP_DEFAULT_SEPA_CUTSELSUBSCIP

SCIP_RETCODE SCIPsetIncludeConshdlr(SCIP_SET *set, SCIP_CONSHDLR *conshdlr)

void SCIPsetSortPricers(SCIP_SET *set)

#define SCIP_DEFAULT_DISP_HEADERFREQ

SCIP_Real SCIPsetFrac(SCIP_SET *set, SCIP_Real val)

SCIP_RETCODE SCIPsetSetCharParam(SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, const char *name, char value)

#define SCIP_DEFAULT_CONS_AGELIMIT

SCIP_RETCODE SCIPsetSetSubscipsOff(SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, SCIP_Bool quiet)

SCIP_Bool SCIPsetIsUbBetter(SCIP_SET *set, SCIP_Real newub, SCIP_Real oldlb, SCIP_Real oldub)

#define SCIP_DEFAULT_MEM_PATHGROWINIT

#define SCIP_DEFAULT_LP_MARKOWITZ

#define SCIP_DEFAULT_PRICE_DELVARSROOT

void SCIPsetSortSepas(SCIP_SET *set)

void SCIPsetReinsertConshdlrSepaPrio(SCIP_SET *set, SCIP_CONSHDLR *conshdlr, int oldpriority)

#define SCIP_DEFAULT_CONF_PREFINFPROOF

#define SCIP_DEFAULT_CONF_CONFLITGRAPHWEIGHT

#define SCIP_DEFAULT_LP_SOLUTIONPOLISHING

#define SCIP_DEFAULT_LP_FREESOLVALBUFFERS

#define SCIP_DEFAULT_BRANCH_MIDPULLRELDOMTRIG

SCIP_RETCODE SCIPsetIncludeHeur(SCIP_SET *set, SCIP_HEUR *heur)

#define SCIP_DEFAULT_MISC_RESETSTAT

#define SCIP_DEFAULT_LP_ROWREPSWITCH

#define SCIP_DEFAULT_LIMIT_AUTORESTARTNODES

#define SCIP_DEFAULT_SEPA_MAXLOCALBOUNDDIST

#define SCIP_DEFAULT_TIME_READING

#define SCIP_DEFAULT_REOPT_STOREVARHISTOTY

#define SCIP_DEFAULT_SEPA_EFFICACYNORM

#define SCIP_DEFAULT_REOPT_STRONGBRANCHINIT

SCIP_Real SCIPsetLPFeastolFactor(SCIP_SET *set)

#define SCIP_DEFAULT_LP_RESOLVERESTORE

#define SCIP_DEFAULT_VISUAL_REALTIME

static int calcGrowSize(int initsize, SCIP_Real growfac, int num)

#define SCIP_DEFAULT_LP_CHECKSTABILITY

#define SCIP_DEFAULT_MEM_TREEGROWINIT

SCIP_Real SCIPsetInfinity(SCIP_SET *set)

SCIP_RETCODE SCIPsetGetIntParam(SCIP_SET *set, const char *name, int *value)

#define SCIP_DEFAULT_REOPT_OBJSIMROOTLP

SCIP_RETCODE SCIPsetIncludeEventhdlr(SCIP_SET *set, SCIP_EVENTHDLR *eventhdlr)

#define SCIP_DEFAULT_MISC_REFERENCEVALUE

void SCIPsetSortProps(SCIP_SET *set)

SCIP_RETCODE SCIPsetCreate(SCIP_SET **set, SCIP_MESSAGEHDLR *messagehdlr, BMS_BLKMEM *blkmem, SCIP *scip)

SCIP_Real SCIPsetSumepsilon(SCIP_SET *set)

#define SCIP_DEFAULT_REOPT_USEPSCOST

SCIP_RETCODE SCIPsetSetPresolving(SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, SCIP_PARAMSETTING paramsetting, SCIP_Bool quiet)

SCIP_Bool SCIPsetIsLT(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)

#define SCIP_DEFAULT_LP_ALWAYSGETDUALS

SCIP_Bool SCIPsetIsInfinity(SCIP_SET *set, SCIP_Real val)

SCIP_RETCODE SCIPsetGetRealParam(SCIP_SET *set, const char *name, SCIP_Real *value)

void SCIPsetSortHeurs(SCIP_SET *set)

#define SCIP_DEFAULT_REOPT_FORCEHEURRESTART

#define SCIP_DEFAULT_CONF_REMOVEABLE

#define SCIP_DEFAULT_SEPA_MAXADDROUNDS

SCIP_Bool SCIPsetIsSumZero(SCIP_SET *set, SCIP_Real val)

SCIP_RETCODE SCIPsetIncludePresol(SCIP_SET *set, SCIP_PRESOL *presol)

#define SCIP_DEFAULT_BRANCH_PREFERBINARY

SCIP_Real SCIPsetDualfeasRound(SCIP_SET *set, SCIP_Real val)

#define SCIP_DEFAULT_CONCURRENT_FREQINIT

SCIP_RETCODE SCIPsetChgStringParam(SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, SCIP_PARAM *param, const char *value)

SCIP_Bool SCIPsetIsDualfeasIntegral(SCIP_SET *set, SCIP_Real val)

#define SCIP_DEFAULT_CONF_DYNAMIC

SCIP_Bool SCIPsetIsRelGE(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)

SCIP_RETCODE SCIPsetIncludeNodesel(SCIP_SET *set, SCIP_NODESEL *nodesel)

SCIP_SEPA * SCIPsetFindSepa(SCIP_SET *set, const char *name)

SCIP_RETCODE SCIPsetIncludeCompr(SCIP_SET *set, SCIP_COMPR *compr)

int SCIPsetCalcPathGrowSize(SCIP_SET *set, int num)

SCIP_Bool SCIPsetIsDualfeasPositive(SCIP_SET *set, SCIP_Real val)

void SCIPsetSortHeursName(SCIP_SET *set)

SCIP_RETCODE SCIPsetChgCharParam(SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, SCIP_PARAM *param, char value)

#define SCIP_DEFAULT_CONF_MAXCONSS

void SCIPsetSortNlpis(SCIP_SET *set)

SCIP_NLPI * SCIPsetFindNlpi(SCIP_SET *set, const char *name)

SCIP_RETCODE SCIPsetResetParams(SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr)

#define SCIP_DEFAULT_DECOMP_DISABLEMEASURES

#define SCIP_DEFAULT_HEUR_USEUCTSUBSCIP

void SCIPsetSortBenders(SCIP_SET *set)

#define SCIP_DEFAULT_LP_SOLVEDEPTH

void SCIPsetSortExprhdlrs(SCIP_SET *set)

SCIP_Real SCIPsetGetSepaMaxcutsGenFactor(SCIP_SET *set, SCIP_Bool root)

#define SCIP_DEFAULT_LP_LEXDUALROOTONLY

SCIP_Bool SCIPsetIsDualfeasEQ(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)

#define SCIP_DEFAULT_TIME_ENABLED

void SCIPsetEnableOrDisablePluginClocks(SCIP_SET *set, SCIP_Bool enabled)

int SCIPsetGetNParams(SCIP_SET *set)

#define SCIP_DEFAULT_MISC_USESMALLTABLES

#define SCIP_DEFAULT_MISC_SHOWDIVINGSTATS

#define SCIP_DEFAULT_CONF_RESTARTFAC

SCIP_Bool SCIPsetIsDualfeasGT(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)

SCIP_Bool SCIPsetIsSumRelLT(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)

#define SCIP_DEFAULT_LIMIT_MAXORIGSOL

#define SCIP_DEFAULT_MISC_TRANSORIGSOLS

SCIP_PARAM * SCIPsetGetParam(SCIP_SET *set, const char *name)

#define SCIP_DEFAULT_READ_DYNAMICROWS

#define SCIP_DEFAULT_SEPA_MAXROUNDS

SCIP_Bool SCIPsetIsRelGT(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)

#define SCIP_DEFAULT_MISC_USEVARTABLE

SCIP_RETCODE SCIPsetExitsolPlugins(SCIP_SET *set, BMS_BLKMEM *blkmem, SCIP_STAT *stat, SCIP_Bool restart)

#define SCIP_DEFAULT_BENDERS_CUTLPSOL

#define SCIP_DEFAULT_CONF_MAXSTORESIZE

#define SCIP_DEFAULT_LP_CHECKFARKAS

#define SCIP_DEFAULT_MISC_ALLOWWEAKDUALREDS

#define SCIP_DEFAULT_PRESOL_MAXRESTARTS

SCIP_Bool SCIPsetIsGT(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)

#define SCIP_DEFAULT_CONF_LPITERATIONS

void SCIPsetSortSepasName(SCIP_SET *set)

SCIP_Bool SCIPsetIsSumEQ(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)

#define SCIP_DEFAULT_LP_LEXDUALBASIC

SCIP_RETCODE SCIPsetChgIntParam(SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, SCIP_PARAM *param, int value)

#define SCIP_DEFAULT_REOPT_SHRINKINNER

SCIP_PROP * SCIPsetFindProp(SCIP_SET *set, const char *name)

#define SCIP_DEFAULT_CONF_USEBOUNDLP

#define SCIP_DEFAULT_MISC_CATCHCTRLC

#define SCIP_DEFAULT_RANDOM_PERMUTEVARS

#define SCIP_DEFAULT_CONF_RECONVLEVELS

SCIP_CONFLICTHDLR * SCIPsetFindConflicthdlr(SCIP_SET *set, const char *name)

#define SCIP_DEFAULT_BRANCH_SCOREFAC

SCIP_Bool SCIPsetIsIntegral(SCIP_SET *set, SCIP_Real val)

SCIP_Real SCIPsetDualfeasFrac(SCIP_SET *set, SCIP_Real val)

#define SCIP_DEFAULT_MISC_AVOIDMEMOUT

SCIP_Bool SCIPsetIsZero(SCIP_SET *set, SCIP_Real val)

#define SCIP_DEFAULT_LP_LEXDUALSTALLING

#define SCIP_DEFAULT_REOPT_SOLVELP

SCIP_Bool SCIPsetIsUpdateUnreliable(SCIP_SET *set, SCIP_Real newvalue, SCIP_Real oldvalue)

#define SCIP_DEFAULT_DECOMP_APPLYBENDERS

#define SCIP_DEFAULT_CONCURRENT_FREQMAX

#define SCIP_DEFAULT_CONF_SCOREFAC

SCIP_Real SCIPsetDualfeasFloor(SCIP_SET *set, SCIP_Real val)

SCIP_RETCODE SCIPsetSetBoolParam(SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, const char *name, SCIP_Bool value)

#define SCIP_DEFAULT_DISP_ALLVIOLS

SCIP_Bool SCIPsetIsFracIntegral(SCIP_SET *set, SCIP_Real val)

SCIP_RETCODE SCIPsetIncludeNlpi(SCIP_SET *set, SCIP_NLPI *nlpi)

int SCIPsetGetPriceMaxvars(SCIP_SET *set, SCIP_Bool root)

SCIP_Real SCIPsetPseudocostdelta(SCIP_SET *set)

SCIP_Real SCIPsetSumCeil(SCIP_SET *set, SCIP_Real val)

SCIP_Real SCIPsetSumFrac(SCIP_SET *set, SCIP_Real val)

#define SCIP_DEFAULT_LIMIT_STALLNODES

static SCIP_DECL_PARAMCHGD(paramChgdFeastol)

SCIP_Real SCIPsetFeasFrac(SCIP_SET *set, SCIP_Real val)

#define SCIP_DEFAULT_RANDOM_LPSEED

SCIP_RETCODE SCIPsetSetParam(SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, const char *name, const char *value)

#define SCIP_DEFAULT_REOPT_USECUTS

#define SCIP_DEFAULT_LIMIT_MAXSOL

#define SCIP_DEFAULT_CONCURRENT_CHANGESEEDS

SCIP_Real SCIPsetCutoffbounddelta(SCIP_SET *set)

SCIP_DEBUGSOLDATA * SCIPsetGetDebugSolData(SCIP_SET *set)

#define SCIP_DEFAULT_CONF_USESB

#define SCIP_DEFAULT_CONF_IGNORERELAXEDBD

SCIP_RETCODE SCIPsetExitPlugins(SCIP_SET *set, BMS_BLKMEM *blkmem, SCIP_STAT *stat)

SCIP_Bool SCIPsetIsSumRelLE(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)

SCIP_BRANCHRULE * SCIPsetFindBranchrule(SCIP_SET *set, const char *name)

SCIP_Bool SCIPsetIsDualfeasGE(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)

#define SCIP_DEFAULT_LP_ROWAGELIMIT

SCIP_Real SCIPsetGetReferencevalue(SCIP_SET *set)

#define SCIP_DEFAULT_PRICE_MAXVARS

#define SCIP_DEFAULT_DISP_RELEVANTSTATS

SCIP_READER * SCIPsetFindReader(SCIP_SET *set, const char *name)

#define SCIP_DEFAULT_SEPA_MAXCUTS

SCIP_Real SCIPsetRecompfac(SCIP_SET *set)

SCIP_Bool SCIPsetIsFeasGE(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)

SCIP_RETCODE SCIPsetIncludeDialog(SCIP_SET *set, SCIP_DIALOG *dialog)

#define SCIP_DEFAULT_LP_CHECKDUALFEAS

void SCIPsetSortBendersName(SCIP_SET *set)

#define SCIP_DEFAULT_READ_DYNAMICCONSS

#define SCIP_DEFAULT_MISC_ALLOWSTRONGDUALREDS

#define SCIP_DEFAULT_NLP_SOLVER

#define SCIP_DEFAULT_LP_SOLVEFREQ

SCIP_EVENTHDLR * SCIPsetFindEventhdlr(SCIP_SET *set, const char *name)

#define SCIP_DEFAULT_CONF_SEPARATE

#define SCIP_DEFAULT_CONF_INTERCONSS

SCIP_RETCODE SCIPsetInitprePlugins(SCIP_SET *set, BMS_BLKMEM *blkmem, SCIP_STAT *stat)

SCIP_Real SCIPsetGetHugeValue(SCIP_SET *set)

#define SCIP_DEFAULT_CONCURRENT_NBESTSOLS

SCIP_Bool SCIPsetIsRelLE(SCIP_SET *set, SCIP_Real val1, SCIP_Real val2)

#define SCIP_DEFAULT_REOPT_COMMONTIMELIMIT

SCIP_RETCODE SCIPsetReadParams(SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, const char *filename)

#define SCIP_DEFAULT_SEPA_MAXCOEFRATIOFACROWPREP

void SCIPsetSortConflicthdlrs(SCIP_SET *set)

void SCIPsetSetLimitChanged(SCIP_SET *set)

SCIP_Real SCIPsetBarrierconvtol(SCIP_SET *set)

SCIP_RETCODE SCIPsetFree(SCIP_SET **set, BMS_BLKMEM *blkmem)

SCIP_PRESOL * SCIPsetFindPresol(SCIP_SET *set, const char *name)

#define SCIP_DEFAULT_LP_PRESOLVING

#define SCIP_DEFAULT_SEPA_MAXCUTSROOT

#define SCIP_DEFAULT_REOPT_MAXCUTAGE

SCIP_RETCODE SCIPsetSetEmphasis(SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, SCIP_PARAMEMPHASIS paramemphasis, SCIP_Bool quiet)

#define SCIP_DEFAULT_CONCURRENT_TARGETPROGRESS

SCIP_Real SCIPsetRound(SCIP_SET *set, SCIP_Real val)

#define SCIP_DEFAULT_PRESOL_DONOTAGGR

#define SCIP_DEFAULT_REOPT_ENABLE

SCIP_RETCODE SCIPsetCopyParams(SCIP_SET *sourceset, SCIP_SET *targetset, SCIP_MESSAGEHDLR *messagehdlr)

#define SCIP_DEFAULT_PRESOL_ABORTFAC

SCIP_Bool SCIPsetIsSumPositive(SCIP_SET *set, SCIP_Real val)

#define SCIP_DEFAULT_PROP_ABORTONCUTOFF

int SCIPsetCalcMemGrowSize(SCIP_SET *set, int num)

#define SCIP_DEFAULT_CONCURRENT_MINSYNCDELAY

SCIP_RETCODE SCIPsetIncludeExternalCode(SCIP_SET *set, const char *name, const char *description)

#define SCIP_DEFAULT_SEPA_MAXROUNDSROOTSUBRUN

#define SCIP_DEFAULT_CONCURRENT_MAXNSYNCDELAY

SCIP_RETCODE SCIPsetChgLongintParam(SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, SCIP_PARAM *param, SCIP_Longint value)

#define SCIP_DEFAULT_VISUAL_DISPLB

#define SCIP_DEFAULT_LP_INITALGORITHM

#define SCIP_DEFAULT_DISP_WIDTH

SCIP_NODESEL * SCIPsetGetNodesel(SCIP_SET *set, SCIP_STAT *stat)

#define SCIP_DEFAULT_LIMIT_PRIMAL

#define SCIP_DEFAULT_BRANCH_DIVINGPSCOST

#define SCIP_DEFAULT_BRANCH_CLAMP

SCIP_Bool SCIPsetIsFeasIntegral(SCIP_SET *set, SCIP_Real val)

SCIP_Bool SCIPsetIsNegative(SCIP_SET *set, SCIP_Real val)

#define SCIP_DEFAULT_MEM_SAVEFAC

unsigned int SCIPsetInitializeRandomSeed(SCIP_SET *set, unsigned int initialseedvalue)

#define SCIP_DEFAULT_SEPA_MAXCUTSROOTGENFACTOR

void SCIPsetSetPriorityNlpi(SCIP_SET *set, SCIP_NLPI *nlpi, int priority)

#define SCIP_DEFAULT_SEPA_CUTSELRESTART

SCIP_BANDITVTABLE * SCIPsetFindBanditvtable(SCIP_SET *set, const char *name)

internal methods for global SCIP settings

SCIP_RETCODE SCIPbendersExit(SCIP_BENDERS *benders, SCIP_SET *set)

SCIP_RETCODE SCIPbendersFree(SCIP_BENDERS **benders, SCIP_SET *set)

SCIP_RETCODE SCIPbendersInitsol(SCIP_BENDERS *benders, SCIP_SET *set)

SCIP_RETCODE SCIPbendersInitpre(SCIP_BENDERS *benders, SCIP_SET *set, SCIP_STAT *stat)

SCIP_RETCODE SCIPbendersExitpre(SCIP_BENDERS *benders, SCIP_SET *set, SCIP_STAT *stat)

SCIP_RETCODE SCIPbendersExitsol(SCIP_BENDERS *benders, SCIP_SET *set)

SCIP_RETCODE SCIPbendersInit(SCIP_BENDERS *benders, SCIP_SET *set)

internal methods for Benders' decomposition

internal methods for problem statistics

SCIP_CONFLICTHDLR ** conflicthdlrs

SCIP_CONSHDLR ** conshdlrs_include

SCIP_EVENTHDLR ** eventhdlrs

SCIP_BRANCHRULE ** branchrules

SCIP_EXPRHDLR ** exprhdlrs

datastructures for handling parameter settings

SCIP main data structure.

SCIP_RETCODE SCIPtableCopyInclude(SCIP_TABLE *table, SCIP_SET *set)

SCIP_RETCODE SCIPtableFree(SCIP_TABLE **table, SCIP_SET *set)

SCIP_RETCODE SCIPtableExitsol(SCIP_TABLE *table, SCIP_SET *set)

SCIP_RETCODE SCIPtableInitsol(SCIP_TABLE *table, SCIP_SET *set)

SCIP_RETCODE SCIPtableInit(SCIP_TABLE *table, SCIP_SET *set)

SCIP_RETCODE SCIPtableExit(SCIP_TABLE *table, SCIP_SET *set)

internal methods for displaying statistics tables

enum SCIP_ClockType SCIP_CLOCKTYPE

enum SCIP_VerbLevel SCIP_VERBLEVEL

enum SCIP_ParamSetting SCIP_PARAMSETTING

struct SCIP_ParamData SCIP_PARAMDATA

enum SCIP_ParamEmphasis SCIP_PARAMEMPHASIS

enum SCIP_Retcode SCIP_RETCODE

@ SCIP_STAGE_INITPRESOLVE

enum SCIP_Stage SCIP_STAGE

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4