SCIP
Solving Constraint Integer Programs
Solving Constraint Integer Programs
|
var.h
Go to the documentation of this file.
21 /*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/ 111 /** converts a dynamic domain change data into a static one, using less memory than for a dynamic one */ 157 SCIP_Real lpsolval, /**< solval of variable in last LP on path to node, or SCIP_INVALID if unknown */ 221 SCIP_DECL_VARTRANS ((*vartrans)), /**< creates transformed user data by transforming original user data, or NULL */ 222 SCIP_DECL_VARDELTRANS ((*vardeltrans)), /**< frees user data of transformed variable, or NULL */ 227 /** creates and captures a loose variable belonging to the transformed problem; an integer variable with bounds 244 SCIP_DECL_VARTRANS ((*vartrans)), /**< creates transformed user data by transforming original user data, or NULL */ 245 SCIP_DECL_VARDELTRANS ((*vardeltrans)), /**< frees user data of transformed variable, or NULL */ 250 /** copies and captures a variable from source to target SCIP; an integer variable with bounds zero and one is 251 * automatically converted into a binary variable; in case the variable data cannot be copied the variable is not 264 SCIP_HASHMAP* consmap, /**< a hashmap to store the mapping of source constraints to the corresponding 269 /** parses variable information (in cip format) out of a string; if the parsing process was successful an original 270 * variable is created and captured; if variable is of integral type, fractional bounds are automatically rounded; an 285 SCIP_DECL_VARTRANS ((*vartrans)), /**< creates transformed user data by transforming original user data */ 292 /** parses variable information (in cip format) out of a string; if the parsing process was successful a loose variable 293 * belonging to the transformed problem is created and captured; if variable is of integral type, fractional bounds are 294 * automatically rounded; an integer variable with bounds zero and one is automatically converted into a binary 309 SCIP_DECL_VARTRANS ((*vartrans)), /**< creates transformed user data by transforming original user data */ 347 /** gets and captures transformed variable of a given variable; if the variable is not yet transformed, 356 SCIP_OBJSENSE objsense, /**< objective sense of original problem; transformed is always MINIMIZE */ 367 SCIP_VAR** transvar /**< pointer to store the transformed variable, or NULL if not existing yet */ 410 SCIP_Bool* fixed /**< pointer to store whether the fixing was performed (variable was unfixed) */ 413 /** transforms given variables, scalars and constant to the corresponding active variables, scalars and constant 415 * If the number of needed active variables is greater than the available slots in the variable array, nothing happens except 416 * that the required size is stored in the corresponding variable; hence, if afterwards the required size is greater than the 417 * available slots (varssize), nothing happens; otherwise, the active variable representation is stored in the arrays. 419 * The reason for this approach is that we cannot reallocate memory, since we do not know how the 431 SCIP_Bool mergemultiples /**< should multiple occurrences of a var be replaced by a single coeff? */ 436 * "scalar" will be 0.0 and the value of the sum will be stored in "constant"; a multi-aggregation 438 * is treated like an aggregation; if the multi-aggregation constant is infinite, "scalar" will be 0.0 449 /** flattens aggregation graph of multi-aggregated variable in order to avoid exponential recursion later-on */ 457 /** return for given variables all their active counterparts; all active variables will be pairwise different */ 472 * the variable to be aggregated is chosen among active problem variables x' and y', preferring a less strict variable 473 * type as aggregation variable (i.e. continuous variables are preferred over implicit integers, implicit integers 474 * or integers over binaries). If none of the variables is continuous, it is tried to find an integer 475 * aggregation (i.e. integral coefficients a'' and b'', such that a''*x' + b''*y' == c''). This can lead to 476 * the detection of infeasibility (e.g. if c'' is fractional), or to a rejection of the aggregation (denoted by 477 * aggregated == FALSE), if the resulting integer coefficients are too large and thus numerically instable. 559 * @note: this is not equivalent to marking the variable itself for deletion, this is done by using SCIPvarMarkDeletable() 565 /** returns whether the variable was flagged for deletion from global structures (cliques etc.) */ 570 /** gets negated variable x' = offset - x of problem variable x; the negated variable is created if not yet existing; 571 * the negation offset of binary variables is always 1, the offset of other variables is fixed to lb + ub when the 600 /** informs variable that it will be removed from the problem; adjusts probindex and removes variable from the 602 * If 'final' is TRUE, the thorough implication graph removal is not performed. Instead, only the 603 * variable bounds and implication data structures of the variable are freed. Since in the final removal 604 * of all variables from the transformed problem, this deletes the implication graph completely and is faster 736 SCIP_BRANCHCAND* branchcand, /**< branching candidate storage, may be NULL for original variables */ 752 SCIP_BRANCHCAND* branchcand, /**< branching candidate storage, may be NULL for original variables */ 768 SCIP_BRANCHCAND* branchcand, /**< branching candidate storage, may be NULL for original variables */ 775 /** changes current local lower bound of variable; if possible, adjusts bound to integral value; stores inference 785 SCIP_BRANCHCAND* branchcand, /**< branching candidate storage, may be NULL for original variables */ 790 /** changes current local upper bound of variable; if possible, adjusts bound to integral value; stores inference 800 SCIP_BRANCHCAND* branchcand, /**< branching candidate storage, may be NULL for original variables */ 805 /** changes current local bound of variable; if possible, adjusts bound to integral value; stores inference 815 SCIP_BRANCHCAND* branchcand, /**< branching candidate storage, may be NULL for original variables */ 821 /** changes lazy lower bound of the variable, this is only possible if the variable is not in the LP yet */ 829 /** changes lazy upper bound of the variable, this is only possible if the variable is not in the LP yet */ 836 /** changes lower bound of variable in current dive; if possible, adjusts bound to integral value */ 845 /** changes upper bound of variable in current dive; if possible, adjusts bound to integral value */ 854 /** for a multi-aggregated variable, gives the local lower bound computed by adding the local bounds from all aggregation variables 855 * this lower bound may be tighter than the one given by SCIPvarGetLbLocal, since the latter is not updated if bounds of aggregation variables are changing 864 /** for a multi-aggregated variable, gives the local upper bound computed by adding the local bounds from all aggregation variables 865 * this upper bound may be tighter than the one given by SCIPvarGetUbLocal, since the latter is not updated if bounds of aggregation variables are changing 874 /** for a multi-aggregated variable, gives the global lower bound computed by adding the global bounds from all aggregation variables 875 * this global bound may be tighter than the one given by SCIPvarGetLbGlobal, since the latter is not updated if bounds of aggregation variables are changing 884 /** for a multi-aggregated variable, gives the global upper bound computed by adding the global bounds from all aggregation variables 885 * this upper bound may be tighter than the one given by SCIPvarGetUbGlobal, since the latter is not updated if bounds of aggregation variables are changing 939 /** returns at which depth in the tree a bound change was applied to the variable that conflicts with the 940 * given bound; returns -1 if the bound does not conflict with the current local bounds of the variable 950 /** informs variable x about a globally valid variable lower bound x >= b*z + d with integer variable z; 976 /** informs variable x about a globally valid variable upper bound x <= b*z + d with integer variable z; 1002 /** informs binary variable x about a globally valid implication: x == 0 or x == 1 ==> y <= b or y >= b; 1005 * if the variable is already fixed to the given value, the implication is performed immediately; 1022 SCIP_Bool varfixing, /**< FALSE if y should be added in implications for x == 0, TRUE for x == 1 */ 1024 SCIP_BOUNDTYPE impltype, /**< type of implication y <= b (SCIP_BOUNDTYPE_UPPER) or y >= b (SCIP_BOUNDTYPE_LOWER) */ 1031 /** fixes the bounds of a binary variable to the given value, counting bound changes and detecting infeasibility */ 1051 /** adds the variable to the given clique and updates the list of cliques the binary variable is member of; 1052 * if the variable now appears twice in the clique with the same value, it is fixed to the opposite value; 1053 * if the variable now appears twice in the clique with opposite values, all other variables are fixed to 1087 /** deletes the variable from the given clique and updates the list of cliques the binary variable is member of */ 1097 /** adds a clique to the list of cliques of the given binary variable, but does not change the clique 1109 /** deletes a clique from the list of cliques the binary variable is member of, but does not change the clique 1120 /** sets the branch factor of the variable; this value can be used in the branching methods to scale the score 1121 * values of the variables; higher factor leads to a higher probability that this variable is chosen for branching 1130 /** sets the branch priority of the variable; variables with higher branch priority are always preferred to variables 1139 /** sets the branch direction of the variable; variables with higher branch direction are always preferred to variables 1145 SCIP_BRANCHDIR branchdirection /**< preferred branch direction of the variable (downwards, upwards, auto) */ 1148 /** gets objective value of variable in current SCIP_LP; the value can be different from the bound stored in the variable's own 1156 /** gets lower bound of variable in current SCIP_LP; the bound can be different from the bound stored in the variable's own 1157 * data due to diving or conflict analysis, that operate only on the LP without updating the variables 1165 /** gets upper bound of variable in current SCIP_LP; the bound can be different from the bound stored in the variable's own 1166 * data due to diving or conflict analysis, that operate only on the LP without updating the variables 1174 /** returns solution value and index of variable lower bound that is closest to the variable's value in the given primal solution 1175 * or current LP solution if no primal solution is given; returns an index of -1 if no variable lower bound is available 1187 /** returns solution value and index of variable upper bound that is closest to the variable's value in the given primal solution; 1188 * or current LP solution if no primal solution is given; returns an index of -1 if no variable upper bound is available 1207 /** updates the current solution as best root solution in the problem variables if it is better */ 1224 /** returns the solution value of the transformed problem variable in the relaxation solution */ 1240 /** returns for the given binary variable the reduced cost which are given by the variable itself and its implication if 1287 /** merge two variable histories together; a typical use case is that \p othervar is an image of the target variable 1288 * in a SCIP copy. Method should be applied with care, especially because no internal checks are performed whether 1291 * @note Do not use this method if the two variables originate from two SCIP's with different objective functions, since 1293 * @note Apply with care; no internal checks are performed if the two variables should be merged 1298 SCIP_VAR* othervar, /**< the variable whose history is to be merged with that of the target variable */ 1302 /** updates the pseudo costs of the given variable and the global pseudo costs after a change of 1303 * "solvaldelta" in the variable's solution value and resulting change of "objdelta" in the in the LP's objective value 1315 /** gets the variable's pseudo cost value for the given step size "solvaldelta" in the variable's LP solution value */ 1323 /** gets the variable's pseudo cost value for the given step size "solvaldelta" in the variable's LP solution value, 1333 /** gets the variable's (possible fractional) number of pseudo cost updates for the given direction */ 1340 /** gets the variable's (possible fractional) number of pseudo cost updates for the given direction, 1354 SCIP_Bool onlycurrentrun /**< return pseudo cost variance only for current branch and bound run */ 1357 /** calculates a confidence bound for this variable under the assumption of normally distributed pseudo costs 1359 * The confidence bound \f$ \theta \geq 0\f$ denotes the interval borders \f$ [X - \theta, \ X + \theta]\f$, which contains 1360 * the true pseudo costs of the variable, i.e., the expected value of the normal distribution, with a probability 1374 /** check if the current pseudo cost relative error in a direction violates the given threshold. The Relative 1386 /** check if variable pseudo-costs have a significant difference in location. The significance depends on 1387 * the choice of \p clevel and on the kind of tested hypothesis. The one-sided hypothesis, which 1391 * This method is applied best if variable x has a better pseudo-cost score than y. The method hypothesizes that y were actually 1392 * better than x (despite the current information), meaning that y can be expected to yield branching 1393 * decisions as least as good as x in the long run. If the method returns TRUE, the current history information is 1394 * sufficient to safely rely on the alternative hypothesis that x yields indeed a better branching score (on average) 1399 * @note set \p onesided to FALSE if you are not sure which variable is better. The hypothesis tested then reads 1417 /** tests at a given confidence level whether the variable pseudo-costs only have a small probability to 1418 * exceed a \p threshold. This is useful to determine if past observations provide enough evidence 1419 * to skip an expensive strong-branching step if there is already a candidate that has been proven to yield an improvement 1422 * @note use \p clevel to adjust the level of confidence. For SCIP_CONFIDENCELEVEL_MIN, the method returns TRUE if 1425 * @see SCIP_Confidencelevel for a list of available levels. The used probability limits refer to the one-sided levels 1428 * @return TRUE if the variable pseudo-cost probabilistic model is likely to be smaller than \p threshold 1461 /** increases the number of active conflicts by one and the overall length of the variable by the given length */ 1554 /** returns the average number of inferences found after branching on the variable in given direction */ 1562 /** returns the average number of inferences found after branching on the variable in given direction 1572 /** returns the average number of cutoffs found after branching on the variable in given direction */ 1580 /** returns the average number of cutoffs found after branching on the variable in given direction in the current run */ 1605 SCIP_EVENTDATA* eventdata, /**< event data to pass to the event handler for the event processing */ 1617 SCIP_EVENTDATA* eventdata, /**< event data to pass to the event handler for the event processing */ 1635 /** removes (redundant) cliques, implications and variable bounds of variable from all other variables' implications and variable 1645 SCIP_Bool onlyredundant, /**< should only the redundant implications and variable bounds be removed? */ 1646 SCIP_Bool removefromvar /**< should the implications and variable bounds be removed from the var itself? */ 1651 /* In optimized mode, the function calls are overwritten by defines to reduce the number of function calls and 1659 #define SCIPvarGetVSIDS(var, stat, dir) ((var)->varstatus == SCIP_VARSTATUS_LOOSE || (var)->varstatus == SCIP_VARSTATUS_COLUMN ? \ 1660 SCIPhistoryGetVSIDS(var->history, dir)/stat->vsidsweight : SCIPvarGetVSIDS_rec(var, stat, dir)) SCIP_Real SCIPvarGetRelaxSolTransVar(SCIP_VAR *var) Definition: var.c:13249 SCIP_RETCODE SCIPvarColumn(SCIP_VAR *var, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_PROB *prob, SCIP_LP *lp) Definition: var.c:3389 SCIP_RETCODE SCIPvarChgBdLocal(SCIP_VAR *var, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_LP *lp, SCIP_BRANCHCAND *branchcand, SCIP_EVENTQUEUE *eventqueue, SCIP_Real newbound, SCIP_BOUNDTYPE boundtype) Definition: var.c:7706 SCIP_RETCODE SCIPvarChgBdGlobal(SCIP_VAR *var, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_LP *lp, SCIP_BRANCHCAND *branchcand, SCIP_EVENTQUEUE *eventqueue, SCIP_CLIQUETABLE *cliquetable, SCIP_Real newbound, SCIP_BOUNDTYPE boundtype) Definition: var.c:7013 internal methods for managing events Definition: struct_var.h:97 SCIP_RETCODE SCIPvarAddVlb(SCIP_VAR *var, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_PROB *transprob, SCIP_PROB *origprob, SCIP_TREE *tree, SCIP_REOPT *reopt, SCIP_LP *lp, SCIP_CLIQUETABLE *cliquetable, SCIP_BRANCHCAND *branchcand, SCIP_EVENTQUEUE *eventqueue, SCIP_VAR *vlbvar, SCIP_Real vlbcoef, SCIP_Real vlbconstant, SCIP_Bool transitive, SCIP_Bool *infeasible, int *nbdchgs) Definition: var.c:9484 SCIP_Real SCIPvarGetPseudocostCurrentRun(SCIP_VAR *var, SCIP_STAT *stat, SCIP_Real solvaldelta) Definition: var.c:13757 SCIP_RETCODE SCIPdomchgApply(SCIP_DOMCHG *domchg, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_LP *lp, SCIP_BRANCHCAND *branchcand, SCIP_EVENTQUEUE *eventqueue, int depth, SCIP_Bool *cutoff) Definition: var.c:1225 SCIP_RETCODE SCIPvarChgLbLocal(SCIP_VAR *var, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_LP *lp, SCIP_BRANCHCAND *branchcand, SCIP_EVENTQUEUE *eventqueue, SCIP_Real newbound) Definition: var.c:7455 type definitions for miscellaneous datastructures Definition: struct_scip.h:53 SCIP_RETCODE SCIPvarsGetActiveVars(SCIP_SET *set, SCIP_VAR **vars, int *nvars, int varssize, int *requiredsize) Definition: var.c:11270 SCIP_RETCODE SCIPvarPrint(SCIP_VAR *var, SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, FILE *file) Definition: var.c:2873 SCIP_Real SCIPvarGetAvgCutoffs(SCIP_VAR *var, SCIP_STAT *stat, SCIP_BRANCHDIR dir) Definition: var.c:15461 SCIP_RETCODE SCIPvarCreateOriginal(SCIP_VAR **var, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, const char *name, SCIP_Real lb, SCIP_Real ub, SCIP_Real obj, SCIP_VARTYPE vartype, SCIP_Bool initial, SCIP_Bool removable, SCIP_DECL_VARDELORIG((*vardelorig)), SCIP_DECL_VARTRANS((*vartrans)), SCIP_DECL_VARDELTRANS((*vardeltrans)), SCIP_DECL_VARCOPY((*varcopy)), SCIP_VARDATA *vardata) Definition: var.c:1996 Definition: struct_var.h:149 SCIP_RETCODE SCIPdomchgMakeStatic(SCIP_DOMCHG **domchg, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_EVENTQUEUE *eventqueue, SCIP_LP *lp) Definition: var.c:1087 SCIP_RETCODE SCIPvarTryAggregateVars(SCIP_SET *set, BMS_BLKMEM *blkmem, SCIP_STAT *stat, SCIP_PROB *transprob, SCIP_PROB *origprob, SCIP_PRIMAL *primal, SCIP_TREE *tree, SCIP_REOPT *reopt, SCIP_LP *lp, SCIP_CLIQUETABLE *cliquetable, SCIP_BRANCHCAND *branchcand, SCIP_EVENTFILTER *eventfilter, SCIP_EVENTQUEUE *eventqueue, SCIP_VAR *varx, SCIP_VAR *vary, SCIP_Real scalarx, SCIP_Real scalary, SCIP_Real rhs, SCIP_Bool *infeasible, SCIP_Bool *aggregated) Definition: var.c:4914 SCIP_RETCODE SCIPvarChgBranchDirection(SCIP_VAR *var, SCIP_BRANCHDIR branchdirection) Definition: var.c:11083 SCIP_Real SCIPvarGetVSIDSCurrentRun(SCIP_VAR *var, SCIP_STAT *stat, SCIP_BRANCHDIR dir) Definition: var.c:15130 SCIP_RETCODE SCIPvarChgObj(SCIP_VAR *var, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_PROB *prob, SCIP_PRIMAL *primal, SCIP_LP *lp, SCIP_EVENTQUEUE *eventqueue, SCIP_Real newobj) Definition: var.c:5764 void SCIPbdchginfoFree(SCIP_BDCHGINFO **bdchginfo, BMS_BLKMEM *blkmem) Definition: var.c:15592 SCIP_RETCODE SCIPvarRelease(SCIP_VAR **var, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_EVENTQUEUE *eventqueue, SCIP_LP *lp) Definition: var.c:2752 SCIP_Longint SCIPvarGetNActiveConflictsCurrentRun(SCIP_VAR *var, SCIP_STAT *stat, SCIP_BRANCHDIR dir) Definition: var.c:14519 Definition: struct_var.h:196 Definition: struct_var.h:80 SCIP_RETCODE SCIPvarIncVSIDS(SCIP_VAR *var, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_BRANCHDIR dir, SCIP_Real value, SCIP_Real weight) Definition: var.c:14255 SCIP_RETCODE SCIPvarResetBounds(SCIP_VAR *var, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat) Definition: var.c:8714 SCIP_RETCODE SCIPvarAddHoleLocal(SCIP_VAR *var, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_EVENTQUEUE *eventqueue, SCIP_Real left, SCIP_Real right, SCIP_Bool *added) Definition: var.c:8605 SCIP_RETCODE SCIPboundchgApply(SCIP_BOUNDCHG *boundchg, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_LP *lp, SCIP_BRANCHCAND *branchcand, SCIP_EVENTQUEUE *eventqueue, int depth, int pos, SCIP_Bool *cutoff) Definition: var.c:553 void SCIPvarMarkDeleteGlobalStructures(SCIP_VAR *var) Definition: var.c:16700 Definition: struct_primal.h:36 SCIP_Bool SCIPvarIsMarkedDeleteGlobalStructures(SCIP_VAR *var) Definition: var.c:16710 Definition: struct_event.h:169 Definition: struct_message.h:35 SCIP_RETCODE SCIPvarCopy(SCIP_VAR **var, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP *sourcescip, SCIP_VAR *sourcevar, SCIP_HASHMAP *varmap, SCIP_HASHMAP *consmap, SCIP_Bool global) Definition: var.c:2081 type definitions for global SCIP settings SCIP_Real SCIPvarGetMultaggrUbGlobal(SCIP_VAR *var, SCIP_SET *set) Definition: var.c:8115 Definition: struct_prob.h:38 public methods for problem variables SCIP_Bool SCIPvarPscostThresholdProbabilityTest(SCIP_SET *set, SCIP_STAT *stat, SCIP_VAR *var, SCIP_Real frac, SCIP_Real threshold, SCIP_BRANCHDIR dir, SCIP_CONFIDENCELEVEL clevel) Definition: var.c:14131 SCIP_RETCODE SCIPvarChgType(SCIP_VAR *var, SCIP_VARTYPE vartype) Definition: var.c:5713 SCIP_Real SCIPvarGetImplRedcost(SCIP_VAR *var, SCIP_SET *set, SCIP_Bool varfixing, SCIP_STAT *stat, SCIP_PROB *prob, SCIP_LP *lp) Definition: var.c:12723 SCIP_Bool SCIPvarSignificantPscostDifference(SCIP_SET *set, SCIP_STAT *stat, SCIP_VAR *varx, SCIP_Real fracx, SCIP_VAR *vary, SCIP_Real fracy, SCIP_BRANCHDIR dir, SCIP_CONFIDENCELEVEL clevel, SCIP_Bool onesided) Definition: var.c:14064 type definitions for return codes for SCIP methods SCIP_Real SCIPvarGetMultaggrLbGlobal(SCIP_VAR *var, SCIP_SET *set) Definition: var.c:8049 SCIP_RETCODE SCIPvarCreateTransformed(SCIP_VAR **var, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, const char *name, SCIP_Real lb, SCIP_Real ub, SCIP_Real obj, SCIP_VARTYPE vartype, SCIP_Bool initial, SCIP_Bool removable, SCIP_DECL_VARDELORIG((*vardelorig)), SCIP_DECL_VARTRANS((*vartrans)), SCIP_DECL_VARDELTRANS((*vardeltrans)), SCIP_DECL_VARCOPY((*varcopy)), SCIP_VARDATA *vardata) Definition: var.c:2039 SCIP_RETCODE SCIPvarChgUbOriginal(SCIP_VAR *var, SCIP_SET *set, SCIP_Real newbound) Definition: var.c:6123 SCIP_RETCODE SCIPvarGetTransformed(SCIP_VAR *origvar, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_VAR **transvar) Definition: var.c:3358 type definitions for collecting reoptimization information SCIP_RETCODE SCIPvarDelCliqueFromList(SCIP_VAR *var, BMS_BLKMEM *blkmem, SCIP_Bool value, SCIP_CLIQUE *clique) Definition: var.c:10682 void SCIPvarAdjustUb(SCIP_VAR *var, SCIP_SET *set, SCIP_Real *ub) Definition: var.c:6031 type definitions for branching rules type definitions for problem statistics SCIP_RETCODE SCIPvarAddVub(SCIP_VAR *var, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_PROB *transprob, SCIP_PROB *origprob, SCIP_TREE *tree, SCIP_REOPT *reopt, SCIP_LP *lp, SCIP_CLIQUETABLE *cliquetable, SCIP_BRANCHCAND *branchcand, SCIP_EVENTQUEUE *eventqueue, SCIP_VAR *vubvar, SCIP_Real vubcoef, SCIP_Real vubconstant, SCIP_Bool transitive, SCIP_Bool *infeasible, int *nbdchgs) Definition: var.c:9858 SCIP_RETCODE SCIPvarSetNLPSol(SCIP_VAR *var, SCIP_SET *set, SCIP_Real solval) Definition: var.c:13260 SCIP_RETCODE SCIPvarRemove(SCIP_VAR *var, BMS_BLKMEM *blkmem, SCIP_CLIQUETABLE *cliquetable, SCIP_SET *set, SCIP_Bool final) Definition: var.c:5631 SCIP_RETCODE SCIPvarAddObj(SCIP_VAR *var, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_PROB *transprob, SCIP_PROB *origprob, SCIP_PRIMAL *primal, SCIP_TREE *tree, SCIP_REOPT *reopt, SCIP_LP *lp, SCIP_EVENTQUEUE *eventqueue, SCIP_Real addobj) Definition: var.c:5837 type definitions for LP management Definition: struct_sol.h:50 Definition: struct_set.h:56 SCIP_RETCODE SCIPvarIncInferenceSum(SCIP_VAR *var, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_BRANCHDIR dir, SCIP_Real value, SCIP_Real weight) Definition: var.c:14735 SCIP_Real SCIPbdchginfoGetRelaxedBound(SCIP_BDCHGINFO *bdchginfo) Definition: var.c:17777 SCIP_RETCODE SCIPdomchgAddBoundchg(SCIP_DOMCHG **domchg, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_VAR *var, SCIP_Real newbound, SCIP_BOUNDTYPE boundtype, SCIP_BOUNDCHGTYPE boundchgtype, SCIP_Real lpsolval, SCIP_VAR *infervar, SCIP_CONS *infercons, SCIP_PROP *inferprop, int inferinfo, SCIP_BOUNDTYPE inferboundtype) Definition: var.c:1348 Definition: struct_misc.h:101 SCIP_Real SCIPvarGetAvgInferences(SCIP_VAR *var, SCIP_STAT *stat, SCIP_BRANCHDIR dir) Definition: var.c:15263 SCIP_Real SCIPvarCalcPscostConfidenceBound(SCIP_VAR *var, SCIP_SET *set, SCIP_BRANCHDIR dir, SCIP_Bool onlycurrentrun, SCIP_CONFIDENCELEVEL clevel) Definition: var.c:13946 SCIP_Bool SCIPvarIsPscostRelerrorReliable(SCIP_VAR *var, SCIP_SET *set, SCIP_STAT *stat, SCIP_Real threshold, SCIP_CONFIDENCELEVEL clevel) Definition: var.c:13984 SCIP_RETCODE SCIPvarIncNActiveConflicts(SCIP_VAR *var, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_BRANCHDIR dir, SCIP_Real value, SCIP_Real length) Definition: var.c:14391 SCIP_Real SCIPvarGetPseudocostVariance(SCIP_VAR *var, SCIP_BRANCHDIR dir, SCIP_Bool onlycurrentrun) Definition: var.c:13892 void SCIPvarGetClosestVlb(SCIP_VAR *var, SCIP_SOL *sol, SCIP_SET *set, SCIP_STAT *stat, SCIP_Real *closestvlb, int *closestvlbidx) Definition: var.c:13376 SCIP_RETCODE SCIPvarChgUbLazy(SCIP_VAR *var, SCIP_SET *set, SCIP_Real lazylb) Definition: var.c:6987 SCIP_Real SCIPvarGetPseudocostCountCurrentRun(SCIP_VAR *var, SCIP_BRANCHDIR dir) Definition: var.c:13849 SCIP_RETCODE SCIPvarAggregate(SCIP_VAR *var, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_PROB *transprob, SCIP_PROB *origprob, SCIP_PRIMAL *primal, SCIP_TREE *tree, SCIP_REOPT *reopt, SCIP_LP *lp, SCIP_CLIQUETABLE *cliquetable, SCIP_BRANCHCAND *branchcand, SCIP_EVENTQUEUE *eventqueue, SCIP_VAR *aggvar, SCIP_Real scalar, SCIP_Real constant, SCIP_Bool *infeasible, SCIP_Bool *aggregated) Definition: var.c:4399 Definition: struct_cons.h:36 SCIP_RETCODE SCIPvarAddCliqueToList(SCIP_VAR *var, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_Bool value, SCIP_CLIQUE *clique) Definition: var.c:10660 SCIP_RETCODE SCIPvarParseOriginal(SCIP_VAR **var, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, SCIP_STAT *stat, const char *str, SCIP_Bool initial, SCIP_Bool removable, SCIP_DECL_VARCOPY((*varcopy)), SCIP_DECL_VARDELORIG((*vardelorig)), SCIP_DECL_VARTRANS((*vartrans)), SCIP_DECL_VARDELTRANS((*vardeltrans)), SCIP_VARDATA *vardata, char **endptr, SCIP_Bool *success) Definition: var.c:2391 SCIP_RETCODE SCIPvarGetProbvarSum(SCIP_VAR **var, SCIP_SET *set, SCIP_Real *scalar, SCIP_Real *constant) Definition: var.c:11906 SCIP_RETCODE SCIPvarCatchEvent(SCIP_VAR *var, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_EVENTTYPE eventtype, SCIP_EVENTHDLR *eventhdlr, SCIP_EVENTDATA *eventdata, int *filterpos) Definition: var.c:17537 void SCIPvarSetNamePointer(SCIP_VAR *var, const char *name) Definition: var.c:5613 SCIP_RETCODE SCIPvarUpdatePseudocost(SCIP_VAR *var, SCIP_SET *set, SCIP_STAT *stat, SCIP_Real solvaldelta, SCIP_Real objdelta, SCIP_Real weight) Definition: var.c:13630 SCIP_RETCODE SCIPvarMultiaggregate(SCIP_VAR *var, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_PROB *transprob, SCIP_PROB *origprob, SCIP_PRIMAL *primal, SCIP_TREE *tree, SCIP_REOPT *reopt, SCIP_LP *lp, SCIP_CLIQUETABLE *cliquetable, SCIP_BRANCHCAND *branchcand, SCIP_EVENTFILTER *eventfilter, SCIP_EVENTQUEUE *eventqueue, int naggvars, SCIP_VAR **aggvars, SCIP_Real *scalars, SCIP_Real constant, SCIP_Bool *infeasible, SCIP_Bool *aggregated) Definition: var.c:5063 SCIP_RETCODE SCIPvarDropEvent(SCIP_VAR *var, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_EVENTTYPE eventtype, SCIP_EVENTHDLR *eventhdlr, SCIP_EVENTDATA *eventdata, int filterpos) Definition: var.c:17564 SCIP_RETCODE SCIPbdchginfoCreate(SCIP_BDCHGINFO **bdchginfo, BMS_BLKMEM *blkmem, SCIP_VAR *var, SCIP_BOUNDTYPE boundtype, SCIP_Real oldbound, SCIP_Real newbound) Definition: var.c:15562 SCIP_Real SCIPvarGetVSIDS_rec(SCIP_VAR *var, SCIP_STAT *stat, SCIP_BRANCHDIR dir) Definition: var.c:15081 SCIP_RETCODE SCIPvarChgLbDive(SCIP_VAR *var, SCIP_SET *set, SCIP_LP *lp, SCIP_Real newbound) Definition: var.c:7732 SCIP_RETCODE SCIPvarChgBranchPriority(SCIP_VAR *var, int branchpriority) Definition: var.c:10953 SCIP_Real SCIPvarGetAvgConflictlength(SCIP_VAR *var, SCIP_BRANCHDIR dir) Definition: var.c:14564 type definitions for problem variables SCIP_Real SCIPvarGetAvgInferencesCurrentRun(SCIP_VAR *var, SCIP_STAT *stat, SCIP_BRANCHDIR dir) Definition: var.c:15320 type definitions for managing events Definition: struct_prop.h:36 SCIP_RETCODE SCIPvarChgLbGlobal(SCIP_VAR *var, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_LP *lp, SCIP_BRANCHCAND *branchcand, SCIP_EVENTQUEUE *eventqueue, SCIP_CLIQUETABLE *cliquetable, SCIP_Real newbound) Definition: var.c:6680 SCIP_Real SCIPvarGetMultaggrUbLocal(SCIP_VAR *var, SCIP_SET *set) Definition: var.c:7983 SCIP_Real SCIPvarGetPseudocost(SCIP_VAR *var, SCIP_STAT *stat, SCIP_Real solvaldelta) Definition: var.c:13708 SCIP_RETCODE SCIPdomchgAddHolechg(SCIP_DOMCHG **domchg, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_HOLELIST **ptr, SCIP_HOLELIST *newlist, SCIP_HOLELIST *oldlist) Definition: var.c:1446 void SCIPvarAdjustLb(SCIP_VAR *var, SCIP_SET *set, SCIP_Real *lb) Definition: var.c:6014 Definition: struct_var.h:104 public data structures and miscellaneous methods SCIP_RETCODE SCIPvarAddLocks(SCIP_VAR *var, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_EVENTQUEUE *eventqueue, int addnlocksdown, int addnlocksup) Definition: var.c:3034 Definition: struct_var.h:47 SCIP_Real SCIPvarGetAvgConflictlengthCurrentRun(SCIP_VAR *var, SCIP_BRANCHDIR dir) Definition: var.c:14608 SCIP_RETCODE SCIPdomchgUndo(SCIP_DOMCHG *domchg, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_LP *lp, SCIP_BRANCHCAND *branchcand, SCIP_EVENTQUEUE *eventqueue) Definition: var.c:1274 void SCIPvarGetClosestVub(SCIP_VAR *var, SCIP_SOL *sol, SCIP_SET *set, SCIP_STAT *stat, SCIP_Real *closestvub, int *closestvubidx) Definition: var.c:13451 SCIP_RETCODE SCIPvarFlattenAggregationGraph(SCIP_VAR *var, BMS_BLKMEM *blkmem, SCIP_SET *set) Definition: var.c:4133 SCIP_RETCODE SCIPvarChgObjDive(SCIP_VAR *var, SCIP_SET *set, SCIP_LP *lp, SCIP_Real newobj) Definition: var.c:5951 Definition: struct_lp.h:189 SCIP_Longint SCIPvarGetNActiveConflicts(SCIP_VAR *var, SCIP_STAT *stat, SCIP_BRANCHDIR dir) Definition: var.c:14472 SCIP_RETCODE SCIPvarsAddClique(SCIP_VAR **vars, SCIP_Bool *values, int nvars, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_CLIQUE *clique) Definition: var.c:10622 SCIP_Real SCIPvarGetAvgCutoffsCurrentRun(SCIP_VAR *var, SCIP_STAT *stat, SCIP_BRANCHDIR dir) Definition: var.c:15508 Definition: struct_reopt.h:113 type definitions for branch and bound tree SCIP_RETCODE SCIPvarNegate(SCIP_VAR *var, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_VAR **negvar) Definition: var.c:5490 SCIP_RETCODE SCIPvarChgName(SCIP_VAR *var, BMS_BLKMEM *blkmem, const char *name) Definition: var.c:2779 SCIP_Real SCIPvarGetRedcost(SCIP_VAR *var, SCIP_SET *set, SCIP_Bool varfixing, SCIP_STAT *stat, SCIP_LP *lp) Definition: var.c:12670 type definitions for storing and manipulating the main problem SCIP_Real SCIPvarGetMultaggrLbLocal(SCIP_VAR *var, SCIP_SET *set) Definition: var.c:7917 SCIP_RETCODE SCIPvarRemoveCliquesImplicsVbs(SCIP_VAR *var, BMS_BLKMEM *blkmem, SCIP_CLIQUETABLE *cliquetable, SCIP_SET *set, SCIP_Bool irrelevantvar, SCIP_Bool onlyredundant, SCIP_Bool removefromvar) Definition: var.c:1536 SCIP_RETCODE SCIPvarAddHoleOriginal(SCIP_VAR *var, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_Real left, SCIP_Real right) Definition: var.c:8176 SCIP_RETCODE SCIPvarParseTransformed(SCIP_VAR **var, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, SCIP_STAT *stat, const char *str, SCIP_Bool initial, SCIP_Bool removable, SCIP_DECL_VARCOPY((*varcopy)), SCIP_DECL_VARDELORIG((*vardelorig)), SCIP_DECL_VARTRANS((*vartrans)), SCIP_DECL_VARDELTRANS((*vardeltrans)), SCIP_VARDATA *vardata, char **endptr, SCIP_Bool *success) Definition: var.c:2455 void SCIPvarMergeHistories(SCIP_VAR *targetvar, SCIP_VAR *othervar, SCIP_STAT *stat) Definition: var.c:4191 SCIP_RETCODE SCIPvarAddClique(SCIP_VAR *var, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_PROB *transprob, SCIP_PROB *origprob, SCIP_TREE *tree, SCIP_REOPT *reopt, SCIP_LP *lp, SCIP_BRANCHCAND *branchcand, SCIP_EVENTQUEUE *eventqueue, SCIP_CLIQUETABLE *cliquetable, SCIP_Bool value, SCIP_CLIQUE *clique, SCIP_Bool *infeasible, int *nbdchgs) Definition: var.c:10537 void SCIPvarStoreRootSol(SCIP_VAR *var, SCIP_Bool roothaslp) Definition: var.c:12526 SCIP_RETCODE SCIPvarIncNBranchings(SCIP_VAR *var, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_BRANCHDIR dir, SCIP_Real value, int depth) Definition: var.c:14651 SCIP_Real SCIPvarGetPseudocostCount(SCIP_VAR *var, SCIP_BRANCHDIR dir) Definition: var.c:13804 SCIP_RETCODE SCIPvarChgUbLocal(SCIP_VAR *var, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_LP *lp, SCIP_BRANCHCAND *branchcand, SCIP_EVENTQUEUE *eventqueue, SCIP_Real newbound) Definition: var.c:7581 Definition: struct_lp.h:255 SCIP_RETCODE SCIPvarFix(SCIP_VAR *var, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_PROB *transprob, SCIP_PROB *origprob, SCIP_PRIMAL *primal, SCIP_TREE *tree, SCIP_REOPT *reopt, SCIP_LP *lp, SCIP_BRANCHCAND *branchcand, SCIP_EVENTQUEUE *eventqueue, SCIP_CLIQUETABLE *cliquetable, SCIP_Real fixedval, SCIP_Bool *infeasible, SCIP_Bool *fixed) Definition: var.c:3559 Definition: struct_implics.h:86 datastructures for problem variables SCIP_RETCODE SCIPvarChgLbLazy(SCIP_VAR *var, SCIP_SET *set, SCIP_Real lazylb) Definition: var.c:6964 type definitions for branching and inference history Definition: struct_implics.h:64 SCIP_RETCODE SCIPdomchgFree(SCIP_DOMCHG **domchg, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_EVENTQUEUE *eventqueue, SCIP_LP *lp) Definition: var.c:986 SCIP_RETCODE SCIPvarChgLbOriginal(SCIP_VAR *var, SCIP_SET *set, SCIP_Real newbound) Definition: var.c:6064 SCIP_RETCODE SCIPvarTransform(SCIP_VAR *origvar, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_OBJSENSE objsense, SCIP_VAR **transvar) Definition: var.c:3277 SCIP_RETCODE SCIPvarAddHoleGlobal(SCIP_VAR *var, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_EVENTQUEUE *eventqueue, SCIP_Real left, SCIP_Real right, SCIP_Bool *added) Definition: var.c:8357 SCIP_RETCODE SCIPvarLoose(SCIP_VAR *var, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_EVENTQUEUE *eventqueue, SCIP_PROB *prob, SCIP_LP *lp) Definition: var.c:3423 SCIP_RETCODE SCIPvarScaleVSIDS(SCIP_VAR *var, SCIP_Real scalar) Definition: var.c:14341 SCIP_RETCODE SCIPvarAddImplic(SCIP_VAR *var, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_PROB *transprob, SCIP_PROB *origprob, SCIP_TREE *tree, SCIP_REOPT *reopt, SCIP_LP *lp, SCIP_CLIQUETABLE *cliquetable, SCIP_BRANCHCAND *branchcand, SCIP_EVENTQUEUE *eventqueue, SCIP_Bool varfixing, SCIP_VAR *implvar, SCIP_BOUNDTYPE impltype, SCIP_Real implbound, SCIP_Bool transitive, SCIP_Bool *infeasible, int *nbdchgs) Definition: var.c:10214 void SCIPvarUpdateBestRootSol(SCIP_VAR *var, SCIP_SET *set, SCIP_Real rootsol, SCIP_Real rootredcost, SCIP_Real rootlpobjval) Definition: var.c:12537 int SCIPvarGetConflictingBdchgDepth(SCIP_VAR *var, SCIP_SET *set, SCIP_BOUNDTYPE boundtype, SCIP_Real bound) Definition: var.c:16073 Definition: struct_relax.h:58 SCIP_RETCODE SCIPvarIncCutoffSum(SCIP_VAR *var, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_BRANCHDIR dir, SCIP_Real value, SCIP_Real weight) Definition: var.c:14819 Definition: struct_stat.h:44 Definition: struct_tree.h:165 SCIP_RETCODE SCIPvarDelClique(SCIP_VAR *var, BMS_BLKMEM *blkmem, SCIP_CLIQUETABLE *cliquetable, SCIP_Bool value, SCIP_CLIQUE *clique) Definition: var.c:10699 type definitions for collecting primal CIP solutions and primal informations SCIP_RETCODE SCIPvarSetRelaxSol(SCIP_VAR *var, SCIP_SET *set, SCIP_RELAXATION *relaxation, SCIP_Real solval, SCIP_Bool updateobj) Definition: var.c:13116 SCIP_RETCODE SCIPvarAddToRow(SCIP_VAR *var, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_EVENTQUEUE *eventqueue, SCIP_PROB *prob, SCIP_LP *lp, SCIP_ROW *row, SCIP_Real val) Definition: var.c:13523 common defines and data types used in all packages of SCIP Definition: struct_event.h:204 SCIP_RETCODE SCIPvarGetActiveRepresentatives(SCIP_SET *set, SCIP_VAR **vars, SCIP_Real *scalars, int *nvars, int varssize, SCIP_Real *constant, int *requiredsize, SCIP_Bool mergemultiples) Definition: var.c:3729 SCIP_RETCODE SCIPboundchgUndo(SCIP_BOUNDCHG *boundchg, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_LP *lp, SCIP_BRANCHCAND *branchcand, SCIP_EVENTQUEUE *eventqueue) Definition: var.c:750 void SCIPvarAdjustBd(SCIP_VAR *var, SCIP_SET *set, SCIP_BOUNDTYPE boundtype, SCIP_Real *bd) Definition: var.c:6048 Definition: struct_branch.h:36 SCIP_RETCODE SCIPdomchgApplyGlobal(SCIP_DOMCHG *domchg, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_LP *lp, SCIP_BRANCHCAND *branchcand, SCIP_EVENTQUEUE *eventqueue, SCIP_CLIQUETABLE *cliquetable, SCIP_Bool *cutoff) Definition: var.c:1309 SCIP_RETCODE SCIPvarChgUbGlobal(SCIP_VAR *var, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_LP *lp, SCIP_BRANCHCAND *branchcand, SCIP_EVENTQUEUE *eventqueue, SCIP_CLIQUETABLE *cliquetable, SCIP_Real newbound) Definition: var.c:6823 SCIP_Real SCIPvarGetVSIDS(SCIP_VAR *var, SCIP_STAT *stat, SCIP_BRANCHDIR dir) Definition: var.c:17522 Definition: struct_event.h:185 type definitions for constraints and constraint handlers SCIP_RETCODE SCIPvarFixBinary(SCIP_VAR *var, BMS_BLKMEM *blkmem, SCIP_SET *set, SCIP_STAT *stat, SCIP_PROB *transprob, SCIP_PROB *origprob, SCIP_TREE *tree, SCIP_REOPT *reopt, SCIP_LP *lp, SCIP_BRANCHCAND *branchcand, SCIP_EVENTQUEUE *eventqueue, SCIP_CLIQUETABLE *cliquetable, SCIP_Bool value, SCIP_Bool *infeasible, int *nbdchgs) Definition: var.c:10446 SCIP_RETCODE SCIPvarChgBranchFactor(SCIP_VAR *var, SCIP_SET *set, SCIP_Real branchfactor) Definition: var.c:10827 SCIP_RETCODE SCIPvarChgUbDive(SCIP_VAR *var, SCIP_SET *set, SCIP_LP *lp, SCIP_Real newbound) Definition: var.c:7822 memory allocation routines |
