All Data Structures Namespaces Files Functions Variables Typedefs Enumerations Enumerator Macros Groups Pages
SCIP_Set Struct Reference Detailed Descriptionglobal SCIP settings Definition at line 55 of file struct_set.h.
Field Documentation
SCIP operation stage Definition at line 57 of file struct_set.h. Referenced by checkStage(), copyProb(), displayRelevantStats(), exitPresolve(), freeSolve(), freeTransform(), getDualbound(), getLowerbound(), initPresolve(), initSolve(), presolve(), printSolutionStatistics(), SCIPaddCons(), SCIPaddSol(), SCIPaddSolFree(), SCIPaddVar(), SCIPaddVarLocks(), SCIPaddVarObj(), SCIPblkmem(), SCIPchgVarLb(), SCIPchgVarLbGlobal(), SCIPchgVarObj(), SCIPchgVarType(), SCIPchgVarUb(), SCIPchgVarUbGlobal(), SCIPconvertCutsToConss(), SCIPcopyCuts(), SCIPcreateCons(), SCIPcreateOrigSol(), SCIPcreateProb(), SCIPcreateSol(), SCIPcreateVar(), SCIPdelCons(), SCIPdelConsLocal(), SCIPdelConsNode(), SCIPdelVar(), SCIPfindCons(), SCIPfindOrigCons(), SCIPfindVar(), SCIPfixVar(), SCIPfreeProb(), SCIPfreeSol(), SCIPfreeSolve(), SCIPfreeTransform(), SCIPgetBestSol(), SCIPgetConss(), SCIPgetFixedVars(), SCIPgetNBinVars(), SCIPgetNConss(), SCIPgetNContVars(), SCIPgetNFixedVars(), SCIPgetNImplVars(), SCIPgetNIntVars(), SCIPgetNObjVars(), SCIPgetNSols(), SCIPgetNTotalVars(), SCIPgetNUpgrConss(), SCIPgetNVars(), SCIPgetProbData(), SCIPgetSols(), SCIPgetSolVarsData(), SCIPgetStage(), SCIPgetStatus(), SCIPgetVars(), SCIPgetVarsData(), SCIPinferBinvarCons(), SCIPinferBinvarProp(), SCIPinferVarLbCons(), SCIPinferVarLbProp(), SCIPinferVarUbCons(), SCIPinferVarUbProp(), SCIPisObjIntegral(), SCIPisTransformed(), SCIPlockVarCons(), SCIPparseVar(), SCIPpresolve(), SCIPprintBranchingStatistics(), SCIPprintLPSolutionQuality(), SCIPprintStage(), SCIPprintStatistics(), SCIPreleaseCons(), SCIPreleaseVar(), SCIPsetObjIntegral(), SCIPsetObjlimit(), SCIPsetProbData(), SCIPsolve(), SCIPstoreSolutionGap(), SCIPtightenVarLb(), SCIPtightenVarLbGlobal(), SCIPtightenVarUb(), SCIPtightenVarUbGlobal(), SCIPtransformProb(), SCIPtrySol(), SCIPtrySolFree(), SCIPunlockVarCons(), SCIPupdateLocalDualbound(), SCIPupdateLocalLowerbound(), and tightenBounds().
very ugly: pointer to scip main data structure for callback methods Definition at line 58 of file struct_set.h. Referenced by SCIPsetCopyParams(), and SCIPsetCopyPlugins().
memory buffers for short living temporary objects Definition at line 60 of file struct_set.h. Referenced by exitPresolve(), initPresolve(), presolve(), presolveRound(), and SCIPprintMemoryDiagnostic().
file readers Definition at line 61 of file struct_set.h. Referenced by printProblem(), SCIPfreeProb(), SCIPgetReaders(), SCIPgetReadingTime(), SCIPreadProb(), and SCIPsetCopyPlugins().
variable pricers Definition at line 62 of file struct_set.h. Referenced by printPricerStatistics(), SCIPfreeProb(), SCIPgetPricers(), and SCIPsetCopyPlugins().
constraint handlers (sorted by check priority) Definition at line 63 of file struct_set.h. Referenced by calcNonZeros(), checkSolOrig(), presolveRound(), printConstraintStatistics(), printConstraintTimingStatistics(), printPresolverStatistics(), SCIPgetConshdlrs(), SCIPpresolve(), SCIPreadProb(), and SCIPtransformProb().
constraint handlers (sorted by separation priority) Definition at line 64 of file struct_set.h.
constraint handlers (sorted by enforcement priority) Definition at line 65 of file struct_set.h.
constraint handlers (sorted by inclusion order) Definition at line 66 of file struct_set.h. Referenced by SCIPsetCopyPlugins().
conflict handlers Definition at line 67 of file struct_set.h. Referenced by SCIPgetConflicthdlrs(), and SCIPsetCopyPlugins().
presolvers Definition at line 68 of file struct_set.h. Referenced by presolveRound(), printPresolverStatistics(), SCIPgetPresols(), and SCIPsetCopyPlugins().
relaxators Definition at line 69 of file struct_set.h. Referenced by printRelaxatorStatistics(), SCIPgetRelaxs(), and SCIPsetCopyPlugins().
separators Definition at line 70 of file struct_set.h. Referenced by printSeparatorStatistics(), SCIPgetSepas(), and SCIPsetCopyPlugins().
propagators Definition at line 71 of file struct_set.h. Referenced by presolveRound(), printPresolverStatistics(), printPropagatorStatistics(), SCIPgetProps(), and SCIPsetCopyPlugins().
primal heuristics Definition at line 72 of file struct_set.h. Referenced by printHeuristicStatistics(), SCIPgetHeurs(), and SCIPsetCopyPlugins().
event handlers Definition at line 73 of file struct_set.h. Referenced by SCIPgetEventhdlrs(), and SCIPsetCopyPlugins().
node selectors Definition at line 74 of file struct_set.h. Referenced by SCIPgetNodesels(), and SCIPsetCopyPlugins().
currently used node selector, or NULL if invalid Definition at line 75 of file struct_set.h.
branching rules Definition at line 76 of file struct_set.h. Referenced by printBranchruleStatistics(), SCIPgetBranchrules(), and SCIPsetCopyPlugins().
display columns Definition at line 77 of file struct_set.h. Referenced by SCIPgetDisps(), and SCIPsetCopyPlugins().
interfaces to NLP solvers Definition at line 79 of file struct_set.h. Referenced by SCIPgetNlpis(), SCIPsetCopyPlugins(), and SCIPsetMessagehdlr().
names of externals codes Definition at line 80 of file struct_set.h. Referenced by SCIPgetExternalCodeNames(), and SCIPprintExternalCodes().
descriptions of external codes Definition at line 81 of file struct_set.h. Referenced by SCIPgetExternalCodeDescriptions(), and SCIPprintExternalCodes().
number of file readers Definition at line 82 of file struct_set.h. Referenced by printProblem(), SCIPfreeProb(), SCIPgetNReaders(), SCIPgetReadingTime(), SCIPreadProb(), and SCIPsetCopyPlugins().
size of readers array Definition at line 83 of file struct_set.h.
number of variable pricers Definition at line 84 of file struct_set.h. Referenced by SCIPgetNPricers(), and SCIPsetCopyPlugins().
number of variable pricers used in the current problem Definition at line 85 of file struct_set.h. Referenced by initSolve(), printPricerStatistics(), SCIPallVarsInProb(), SCIPfreeProb(), and SCIPgetNActivePricers().
size of pricers array Definition at line 86 of file struct_set.h.
number of constraint handlers Definition at line 87 of file struct_set.h. Referenced by calcNonZeros(), checkSolOrig(), presolveRound(), printConstraintStatistics(), printConstraintTimingStatistics(), printPresolverStatistics(), SCIPgetNConshdlrs(), SCIPpresolve(), SCIPreadProb(), SCIPsetCopyPlugins(), and SCIPtransformProb().
size of conshdlrs array Definition at line 88 of file struct_set.h.
number of conflict handlers Definition at line 89 of file struct_set.h. Referenced by analyzeStrongbranch(), SCIPgetNConflicthdlrs(), and SCIPsetCopyPlugins().
size of conflicthdlrs array Definition at line 90 of file struct_set.h.
number of presolvers Definition at line 91 of file struct_set.h. Referenced by presolveRound(), printPresolverStatistics(), SCIPgetNPresols(), and SCIPsetCopyPlugins().
size of presols array Definition at line 92 of file struct_set.h.
number of relaxators Definition at line 93 of file struct_set.h. Referenced by printRelaxatorStatistics(), SCIPgetNRelaxs(), and SCIPsetCopyPlugins().
size of relaxs array Definition at line 94 of file struct_set.h.
number of separators Definition at line 95 of file struct_set.h. Referenced by printSeparatorStatistics(), SCIPgetNSepas(), and SCIPsetCopyPlugins().
size of sepas array Definition at line 96 of file struct_set.h.
number of propagators Definition at line 97 of file struct_set.h. Referenced by presolveRound(), printPresolverStatistics(), printPropagatorStatistics(), SCIPgetNProps(), and SCIPsetCopyPlugins().
size of props array Definition at line 98 of file struct_set.h.
number of primal heuristics Definition at line 99 of file struct_set.h. Referenced by presolve(), presolveRound(), printHeuristicStatistics(), SCIPgetNHeurs(), and SCIPsetCopyPlugins().
size of heurs array Definition at line 100 of file struct_set.h.
number of event handlers Definition at line 101 of file struct_set.h. Referenced by SCIPgetNEventhdlrs(), and SCIPsetCopyPlugins().
size of eventhdlrs array Definition at line 102 of file struct_set.h.
number of node selectors Definition at line 103 of file struct_set.h. Referenced by SCIPgetNNodesels(), and SCIPsetCopyPlugins().
size of nodesels array Definition at line 104 of file struct_set.h.
number of branching rules Definition at line 105 of file struct_set.h. Referenced by printBranchruleStatistics(), SCIPgetNBranchrules(), and SCIPsetCopyPlugins().
size of branchrules array Definition at line 106 of file struct_set.h.
number of display columns Definition at line 107 of file struct_set.h. Referenced by SCIPgetNDisps(), and SCIPsetCopyPlugins().
size of disps array Definition at line 108 of file struct_set.h.
size of dialogs array Definition at line 110 of file struct_set.h.
number of NLPIs Definition at line 111 of file struct_set.h. Referenced by SCIPgetNNlpis(), SCIPsetCopyPlugins(), and SCIPsetMessagehdlr().
size of NLPIs array Definition at line 112 of file struct_set.h.
number of external codes Definition at line 113 of file struct_set.h. Referenced by SCIPgetNExternalCodes(), and SCIPprintExternalCodes().
size of external code arrays Definition at line 114 of file struct_set.h.
are the pricers sorted by activity and priority? Definition at line 115 of file struct_set.h.
are the pricers sorted by name? Definition at line 116 of file struct_set.h.
are the conflict handlers sorted by priority? Definition at line 117 of file struct_set.h.
are the conflict handlers sorted by name? Definition at line 118 of file struct_set.h.
are the presolvers sorted by priority? Definition at line 119 of file struct_set.h.
are the presolvers sorted by name? Definition at line 120 of file struct_set.h.
are the relaxators sorted by priority? Definition at line 121 of file struct_set.h.
are the relaxators sorted by name? Definition at line 122 of file struct_set.h.
are the separators sorted by priority? Definition at line 123 of file struct_set.h.
are the separators sorted by name? Definition at line 124 of file struct_set.h.
are the propagators sorted by priority? Definition at line 125 of file struct_set.h.
are the propagators sorted by priority for presolving? Definition at line 126 of file struct_set.h.
are the propagators sorted by name? Definition at line 127 of file struct_set.h.
are the heuristics sorted by priority? Definition at line 128 of file struct_set.h.
are the heuristics sorted by name? Definition at line 129 of file struct_set.h.
are the branching rules sorted by priority? Definition at line 130 of file struct_set.h.
are the branching rules sorted by name? Definition at line 131 of file struct_set.h.
are the NLPIs sorted by priority? Definition at line 132 of file struct_set.h.
marks whether any of the limit parameters was changed Definition at line 133 of file struct_set.h.
marks whether an NLP relaxation should be constructed Definition at line 134 of file struct_set.h. Referenced by freeSolve(), initSolve(), SCIPenableNLP(), and SCIPisNLPEnabled().
branching score function ('s'um, 'p'roduct, 'q'uotient) Definition at line 137 of file struct_set.h.
child node to be regarded first during strong branching (only with propagation): 'u'p child, 'd'own child, or 'a'utomatic Definition at line 138 of file struct_set.h. Referenced by SCIPgetVarStrongbranchWithPropagation().
branching score factor to weigh downward and upward gain prediction in sum score function Definition at line 139 of file struct_set.h.
should branching on binary variables be preferred? Definition at line 141 of file struct_set.h.
minimal fractional distance of branching point to a continuous variable' bounds; a value of 0.5 leads to branching always in the middle of a bounded domain Definition at line 142 of file struct_set.h.
strategy for normalizing LP gain when updating pseudo costs of continuous variables Definition at line 143 of file struct_set.h.
whether to delay pseudo costs updates for continuous variables to after separation Definition at line 144 of file struct_set.h.
should all strong branching children be regarded even if one is detected to be infeasible? (only with propagation) Definition at line 145 of file struct_set.h. Referenced by SCIPgetVarStrongbranchWithPropagation().
should LP solutions during strong branching with propagation be checked for feasibility? Definition at line 147 of file struct_set.h. Referenced by performStrongbranchWithPropagation().
should LP solutions during strong branching with propagation be rounded? (only when checksbsol=TRUE) Definition at line 148 of file struct_set.h. Referenced by performStrongbranchWithPropagation().
maximal fraction of variables involved in a conflict constraint Definition at line 151 of file struct_set.h.
minimal absolute maximum of variables involved in a conflict constraint Definition at line 152 of file struct_set.h.
maximal number of LP resolving loops during conflict analysis (-1: no limit) Definition at line 153 of file struct_set.h.
maximal number of LP iterations in each LP resolving loop (-1: no limit) Definition at line 155 of file struct_set.h.
number of depth levels up to which first UIP's are used in conflict analysis (-1: use All-FirstUIP rule) Definition at line 157 of file struct_set.h.
maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint) Definition at line 159 of file struct_set.h.
maximal number of conflict constraints accepted at an infeasible node (-1: use all generated conflict constraints) Definition at line 161 of file struct_set.h.
number of depth levels up to which UIP reconvergence constraints are generated (-1: generate reconvergence constraints in all depth levels) Definition at line 163 of file struct_set.h.
should conflict analysis be enabled? Definition at line 165 of file struct_set.h. Referenced by analyzeStrongbranch().
should propagation conflict analysis be used? Definition at line 166 of file struct_set.h.
should infeasible LP conflict analysis be used? Definition at line 167 of file struct_set.h.
should bound exceeding LP conflict analysis be used? Definition at line 168 of file struct_set.h.
should infeasible/bound exceeding strong branching conflict analysis be used? Definition at line 169 of file struct_set.h. Referenced by analyzeStrongbranch().
should pseudo solution conflict analysis be used? Definition at line 171 of file struct_set.h.
should binary conflicts be preferred? Definition at line 172 of file struct_set.h.
should conflict constraints be generated that are only valid locally? Definition at line 173 of file struct_set.h.
should conflict constraints be attached only to the local subtree where they can be useful? Definition at line 174 of file struct_set.h.
should earlier nodes be repropagated in order to replace branching decisions by deductions? Definition at line 176 of file struct_set.h.
should constraints be kept for repropagation even if they are too long? Definition at line 178 of file struct_set.h.
should the conflict constraints be separated? Definition at line 179 of file struct_set.h.
should the conflict constraints be subject to aging? Definition at line 180 of file struct_set.h.
should the conflict's relaxations be subject to LP aging and cleanup? Definition at line 181 of file struct_set.h.
score factor for depth level in bound relaxation heuristic of LP analysis Definition at line 182 of file struct_set.h.
factor to decrease importance of variables' earlier conflict scores Definition at line 183 of file struct_set.h.
number of successful conflict analysis calls that trigger a restart (0: disable conflict restarts) Definition at line 184 of file struct_set.h.
factor to increase restartnum with after each restart Definition at line 186 of file struct_set.h.
should relaxed bounds be ignored? Definition at line 187 of file struct_set.h.
maximal number of variables to try to detect global bound implications and shorten the whole conflict set (0: disabled ) Definition at line 188 of file struct_set.h.
try to shorten the whole conflict set or terminate early (depending on the 'maxvarsdetectimpliedbounds' parameter) Definition at line 192 of file struct_set.h.
the weight the VSIDS score is weight by updating the VSIDS for a variable if it is part of a conflict Definition at line 195 of file struct_set.h.
the weight the VSIDS score is weight by updating the VSIDS for a variable if it is part of a conflict graph Definition at line 198 of file struct_set.h.
maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: disable aging) Definition at line 203 of file struct_set.h.
age of a constraint after which it is marked obsolete (0: dynamic, -1: disable obsoletion) Definition at line 205 of file struct_set.h.
should enforcement of pseudo solution be disabled? Definition at line 207 of file struct_set.h.
verbosity level of output Definition at line 210 of file struct_set.h. Referenced by displayRelevantStats(), exitPresolve(), presolve(), presolveRound(), SCIPgetVerbLevel(), SCIPpresolve(), SCIPprintDisplayLine(), SCIPreadProb(), SCIPsolve(), SCIPtransformProb(), and SCIPverbMessage().
maximal number of characters in a node information line Definition at line 211 of file struct_set.h.
frequency for displaying node information lines Definition at line 212 of file struct_set.h.
frequency for displaying header lines (every n'th node information line) Definition at line 213 of file struct_set.h.
should the LP solver display status messages? Definition at line 214 of file struct_set.h.
should statistics be collected for variable domain value pairs? Definition at line 217 of file struct_set.h.
maximal time in seconds to run Definition at line 220 of file struct_set.h.
maximal memory usage in MB Definition at line 221 of file struct_set.h. Referenced by SCIPtransformProb().
solving stops, if the given gap is reached Definition at line 222 of file struct_set.h.
solving stops, if the absolute difference between primal and dual bound reaches this value Definition at line 223 of file struct_set.h.
maximal number of nodes to process (-1: no limit) Definition at line 225 of file struct_set.h.
maximal number of total nodes (incl. restarts) to process (-1: no limit) Definition at line 226 of file struct_set.h.
solving stops, if the given number of nodes was processed since the last improvement of the primal solution value (-1: no limit) Definition at line 227 of file struct_set.h.
solving stops, if the given number of solutions were found (-1: no limit) Definition at line 229 of file struct_set.h.
solving stops, if the given number of solution improvements were found (-1: no limit) Definition at line 230 of file struct_set.h.
maximal number of solutions to store in the solution storage Definition at line 232 of file struct_set.h.
maximal number of solutions candidates to store in the solution storage of the original problem Definition at line 233 of file struct_set.h. Referenced by freeTransform().
solving stops, if the given number of restarts was triggered (-1: no limit) Definition at line 234 of file struct_set.h. Referenced by SCIPsolve().
frequency for solving LP at the nodes (-1: never; 0: only root LP) Definition at line 237 of file struct_set.h.
iteration limit for each single LP solve; -1: no limit Definition at line 238 of file struct_set.h.
iteration limit for initial root LP solve; -1: no limit Definition at line 239 of file struct_set.h.
maximal depth for solving LP at the nodes (-1: no depth limit) Definition at line 240 of file struct_set.h.
LP algorithm for solving initial LP relaxations ('s'implex, 'b'arrier, barrier with 'c'rossover) Definition at line 241 of file struct_set.h.
LP algorithm for resolving LP relaxations if a starting basis exists ('s'implex, 'b'arrier, barrier with 'c'rossover) Definition at line 243 of file struct_set.h.
LP pricing strategy ('a'uto, 'f'ull pricing, 's'teepest edge pricing, 'q'uickstart steepest edge pricing, 'd'evex pricing) Definition at line 245 of file struct_set.h.
should lp state be cleared at the end of probing mode when LP was initially unsolved, e.g., when called right after presolving? Definition at line 247 of file struct_set.h.
should the LP be resolved to restore the state at start of diving (if FALSE we buffer the solution values)? Definition at line 249 of file struct_set.h.
should the buffers for storing LP solution values during diving be freed at end of diving? Definition at line 251 of file struct_set.h.
maximum age a column can reach before it is deleted from the SCIP_LP (-1: don't delete columns due to aging) Definition at line 253 of file struct_set.h.
maximum age a row can reach before it is deleted from the LP (-1: don't delete rows due to aging) Definition at line 255 of file struct_set.h.
should new non-basic columns be removed after LP solving? Definition at line 257 of file struct_set.h.
should new non-basic columns be removed after root LP solving? Definition at line 258 of file struct_set.h.
should new basic rows be removed after LP solving? Definition at line 259 of file struct_set.h.
should new basic rows be removed after root LP solving? Definition at line 260 of file struct_set.h.
should LP solver's return status be checked for stability? Definition at line 261 of file struct_set.h.
maximum condition number of LP basis counted as stable (-1.0: no check) Definition at line 262 of file struct_set.h.
should LP solutions be checked for primal feasibility, resolving LP when numerical troubles occur? Definition at line 263 of file struct_set.h.
should LP solutions be checked for dual feasibility, resolving LP when numerical troubles occur? Definition at line 264 of file struct_set.h.
which FASTMIP setting of LP solver should be used? 0: off, 1: medium, 2: full Definition at line 265 of file struct_set.h.
should scaling of LP solver be used? Definition at line 266 of file struct_set.h.
should presolving of LP solver be used? Definition at line 267 of file struct_set.h.
should the lexicographic dual algorithm be used? Definition at line 268 of file struct_set.h.
should the lexicographic dual algorithm be applied only at the root node Definition at line 269 of file struct_set.h.
maximum number of rounds in the lexicographic dual algorithm Definition at line 270 of file struct_set.h.
choose fractional basic variables in lexicographic dual algorithm Definition at line 271 of file struct_set.h.
turn on the lex dual algorithm only when stalling? Definition at line 272 of file struct_set.h.
disable the cutoff bound in the LP solver? (0: enabled, 1: disabled, 2: auto) Definition at line 273 of file struct_set.h.
simplex algorithm shall use row representation of the basis if number of rows divided by number of columns exceeds this value Definition at line 274 of file struct_set.h.
number of threads used for solving the LP (0: automatic) Definition at line 276 of file struct_set.h.
factor of average LP iterations that is used as LP iteration limit for LP resolve (-1: unlimited) Definition at line 277 of file struct_set.h.
minimum number of iterations that are allowed for LP resolve Definition at line 279 of file struct_set.h.
should the NLP be disabled even if a constraint handler enabled it? Definition at line 282 of file struct_set.h. Referenced by initSolve().
name of NLP solver to use Definition at line 283 of file struct_set.h.
estimation of external memory usage, e.g., by LP solver Definition at line 286 of file struct_set.h. Referenced by SCIPtransformProb().
fraction of maximal memory usage resulting in switch to memory saving mode Definition at line 287 of file struct_set.h.
memory growing factor for dynamically allocated arrays Definition at line 288 of file struct_set.h. Referenced by SCIPextendBoolarray(), SCIPextendIntarray(), SCIPextendPtrarray(), SCIPextendRealarray(), SCIPincIntarrayVal(), SCIPincRealarrayVal(), SCIPsetBoolarrayVal(), SCIPsetIntarrayVal(), SCIPsetPtrarrayVal(), and SCIPsetRealarrayVal().
memory growing factor for tree array Definition at line 289 of file struct_set.h.
memory growing factor for path array Definition at line 290 of file struct_set.h.
initial size of dynamically allocated arrays Definition at line 291 of file struct_set.h. Referenced by SCIPextendBoolarray(), SCIPextendIntarray(), SCIPextendPtrarray(), SCIPextendRealarray(), SCIPincIntarrayVal(), SCIPincRealarrayVal(), SCIPsetBoolarrayVal(), SCIPsetIntarrayVal(), SCIPsetPtrarrayVal(), and SCIPsetRealarrayVal().
initial size of tree array Definition at line 292 of file struct_set.h.
initial size of path array Definition at line 293 of file struct_set.h.
should the CTRL-C interrupt be caught by SCIP? Definition at line 296 of file struct_set.h. Referenced by SCIPpresolve(), and SCIPsolve().
should a hashtable be used to map from variable names to variables? Definition at line 297 of file struct_set.h.
should a hashtable be used to map from constraint names to constraints? Definition at line 298 of file struct_set.h.
should smaller hashtables be used? yields better performance for small problems with about 100 variables Definition at line 299 of file struct_set.h.
should the problem be solved exactly (with proven dual bounds)? Definition at line 300 of file struct_set.h. Referenced by SCIPcheckSol(), SCIPgetVarsStrongbranchesFrac(), SCIPgetVarsStrongbranchesInt(), SCIPgetVarStrongbranchFrac(), SCIPgetVarStrongbranchInt(), SCIPisExactSolve(), SCIPsolveDiveLP(), and solveProbingLP().
seed value for permuting the problem after the problem was tranformed (-1: no permutation) Definition at line 301 of file struct_set.h. Referenced by SCIPtransformProb().
should order of constraints be permuted (depends on permutationseed)? Definition at line 303 of file struct_set.h. Referenced by SCIPtransformProb().
should order of variables be permuted (depends on permutationseed)? Definition at line 304 of file struct_set.h. Referenced by SCIPtransformProb().
should the statistics be reset if the transformed problem is freed otherwise the statistics get reset after original problem is freed (in case of bender decomposition this parameter should be set to FALSE and therefore can be used to collect statistics over all runs) Definition at line 305 of file struct_set.h. Referenced by freeTransform().
should only solutions be checked which improve the primal bound Definition at line 309 of file struct_set.h.
should the reason be printed if a given start solution is infeasible? Definition at line 310 of file struct_set.h. Referenced by SCIPtransformProb().
should the usage of external memory be estimated? Definition at line 311 of file struct_set.h. Referenced by SCIPtransformProb().
should SCIP try to transfer original solutions to the extended space (after presolving)? Definition at line 312 of file struct_set.h. Referenced by initSolve().
should SCIP calculate the primal dual integral value which may require a large number of additional clock calls (and decrease the performance)? Definition at line 313 of file struct_set.h. Referenced by exitPresolve(), printSolutionStatistics(), and SCIPstoreSolutionGap().
should SCIP try to remove infinite fixings from solutions copied to the solution store? Definition at line 315 of file struct_set.h. Referenced by freeTransform().
child selection rule ('d'own, 'u'p, 'p'seudo costs, 'i'nference, 'l'p value, 'r'oot LP value difference, 'h'brid inference/root LP value difference) Definition at line 318 of file struct_set.h.
values larger than this are considered infinity Definition at line 322 of file struct_set.h.
absolute values smaller than this are considered zero Definition at line 323 of file struct_set.h.
absolute values of sums smaller than this are considered zero Definition at line 324 of file struct_set.h.
feasibility tolerance for constraints Definition at line 325 of file struct_set.h.
primal feasibility tolerance of LP solver Definition at line 326 of file struct_set.h.
feasibility tolerance for reduced costs Definition at line 327 of file struct_set.h.
convergence tolerance used in barrier algorithm Definition at line 328 of file struct_set.h.
minimal improve for strengthening bounds Definition at line 329 of file struct_set.h.
minimal variable distance value to use for pseudo cost updates Definition at line 330 of file struct_set.h.
minimal objective distance value to use for pseudo cost updates Definition at line 331 of file struct_set.h.
minimal decrease factor that causes the recomputation of a value (e.g., pseudo objective) instead of an update Definition at line 332 of file struct_set.h.
values larger than this are considered huge and should be handled separately (e.g., in activity computation) Definition at line 334 of file struct_set.h.
abort presolve, if l.t. this frac of the problem was changed in last round Definition at line 338 of file struct_set.h. Referenced by SCIPisPresolveFinished().
maximal number of presolving rounds (-1: unlimited) Definition at line 339 of file struct_set.h. Referenced by presolve(), and SCIPisPresolveFinished().
maximal number of restarts (-1: unlimited) Definition at line 340 of file struct_set.h.
fraction of integer variables that were fixed in the root node triggering a restart with preprocessing after root node evaluation Definition at line 341 of file struct_set.h.
fraction of integer variables that were fixed in the root node triggering an immediate restart with preprocessing Definition at line 343 of file struct_set.h.
fraction of integer variables that were globally fixed during the solving process triggering a restart with preprocessing Definition at line 345 of file struct_set.h.
minimal fraction of integer variables removed after restart to allow for an additional restart Definition at line 347 of file struct_set.h.
should multi-aggregation of variables be forbidden? Definition at line 349 of file struct_set.h. Referenced by SCIPdoNotMultaggr(), and SCIPdoNotMultaggrVar().
shouldaggregation of variables be forbidden? Definition at line 350 of file struct_set.h. Referenced by SCIPaggregateVars(), and SCIPdoNotAggr().
pricing is aborted, if fac * maxpricevars pricing candidates were found Definition at line 353 of file struct_set.h.
maximal number of variables priced in per pricing round Definition at line 354 of file struct_set.h.
maximal number of priced variables at the root node Definition at line 355 of file struct_set.h.
should variables created at the current node be deleted when the node is solved in case they are not present in the LP anymore? Definition at line 356 of file struct_set.h.
should variables created at the root node be deleted when the root is solved in case they are not present in the LP anymore? Definition at line 358 of file struct_set.h.
maximal number of propagation rounds per node (-1: unlimited) Definition at line 362 of file struct_set.h.
maximal number of propagation rounds in the root node (-1: unlimited) Definition at line 363 of file struct_set.h.
should propagation be aborted immediately? setting this to FALSE could help conflict analysis to produce more conflict constraints Definition at line 364 of file struct_set.h.
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) Definition at line 368 of file struct_set.h.
minimal efficacy for a cut to enter the LP Definition at line 371 of file struct_set.h.
minimal efficacy for a cut to enter the LP in the root node Definition at line 372 of file struct_set.h.
minimal orthogonality for a cut to enter the LP Definition at line 373 of file struct_set.h.
minimal orthogonality for a cut to enter the LP in the root node Definition at line 374 of file struct_set.h.
factor to scale objective parallelism of cut in separation score calc. Definition at line 375 of file struct_set.h.
factor to scale orthogonality of cut in separation score calculation Definition at line 376 of file struct_set.h.
factor on cut infeasibility to limit feasibility tolerance for relaxation solver (-1: off) Definition at line 377 of file struct_set.h. Referenced by SCIPgetRelaxFeastolFactor().
primal feasibility tolerance derived from cut feasibility (set by sepastore, not a parameter) Definition at line 378 of file struct_set.h.
function used for calc. scalar prod. in orthogonality test ('e'uclidean, 'd'iscrete) Definition at line 379 of file struct_set.h.
row norm to use for efficacy calculation ('e'uclidean, 'm'aximum, 's'um, 'd'iscrete) Definition at line 380 of file struct_set.h. Referenced by SCIPgetVectorEfficacyNorm().
maximal number of runs for which separation is enabled (-1: unlimited) Definition at line 382 of file struct_set.h.
maximal number of separation rounds per node (-1: unlimited) Definition at line 383 of file struct_set.h.
maximal number of separation rounds in the root node (-1: unlimited) Definition at line 384 of file struct_set.h.
maximal number of separation rounds in the root node of a subsequent run (-1: unlimited) Definition at line 385 of file struct_set.h.
maximal additional number of separation rounds in subsequent price-and-cut loops (-1: no additional restriction) Definition at line 386 of file struct_set.h.
maximal number of consecutive separation rounds without objective or integrality improvement (-1: no additional restriction) Definition at line 388 of file struct_set.h.
maximal number of cuts separated per separation round Definition at line 390 of file struct_set.h.
maximal number of separated cuts at the root node Definition at line 391 of file struct_set.h.
maximum age a cut can reach before it is deleted from the global cut pool Definition at line 392 of file struct_set.h. Referenced by initSolve().
separation frequency for the global cut pool Definition at line 393 of file struct_set.h.
default clock type to use Definition at line 396 of file struct_set.h.
is timing enabled? Definition at line 397 of file struct_set.h.
belongs reading time to solving time? Definition at line 398 of file struct_set.h. Referenced by printTimingStatistics(), and SCIPreadProb().
name of the VBC Tool output file, or - if no output should be created Definition at line 401 of file struct_set.h.
should the real solving time be used instead of time step counter in VBC output? Definition at line 402 of file struct_set.h.
should the node where solutions are found be visualized? Definition at line 403 of file struct_set.h.
should model constraints be marked as initial? Definition at line 406 of file struct_set.h.
should model constraints be subject to aging? Definition at line 407 of file struct_set.h.
should columns be added and removed dynamically to the LP? Definition at line 408 of file struct_set.h.
should rows be added and removed dynamically to the LP? Definition at line 409 of file struct_set.h.
should all constraints be written (including the redundant constraints)? Definition at line 412 of file struct_set.h.
when writing the problem with generic names, we start with index 0; using this parameter we can change the starting index to be different Definition at line 413 of file struct_set.h. |