;
/**< left bound of open interval defining the hole (left,right) */ 54 SCIP_Real right;
/**< right bound of open interval defining the hole (left,right) */ 57/** list of domain holes */ 64/** change in a hole list */ 72/** data for branching decision bound changes */ 73structSCIP_BranchingData
75 SCIP_Reallpsolval;
/**< sol val of var in last LP prior to bound change, or SCIP_INVALID if unknown */ 78/** data for inferred bound changes */ 79structSCIP_InferenceData
81 SCIP_VAR* var;
/**< variable that was changed (parent of var, or var itself) */ 84 SCIP_CONS* cons;
/**< constraint that inferred this bound change, or NULL */ 85 SCIP_PROP* prop;
/**< propagator that inferred this bound change, or NULL */ 87 intinfo;
/**< user information for inference to help resolving the conflict */ 90/** change in one bound of a variable */ 99 SCIP_VAR*
var;
/**< active variable to change the bounds for */ 100 unsigned int boundchgtype:2;
/**< bound change type: branching decision or inferred bound change */ 101 unsigned int boundtype:1;
/**< type of bound for var: lower or upper bound */ 102 unsigned int inferboundtype:1;
/**< type of bound for inference var (see inference data): lower or upper bound */ 103 unsigned int applied:1;
/**< was this bound change applied at least once? */ 104 unsigned int redundant:1;
/**< is this bound change redundant? */ 107/** bound change index representing the time of the bound change in path from root to current node */ 110 int depth;
/**< depth of node where the bound change was created */ 111 int pos;
/**< position of bound change in node's domchg array */ 114/** bound change information to track bound changes from root node to current node */ 122 unsigned int pos:27;
/**< position in the variable domain change array */ 123 unsigned int boundchgtype:2;
/**< bound change type: branching decision or inferred bound change */ 124 unsigned int boundtype:1;
/**< type of bound for var: lower or upper bound */ 125 unsigned int inferboundtype:1;
/**< type of bound for inference var (see inference data): lower or upper bound */ 126 unsigned int redundant:1;
/**< does the bound change info belong to a redundant bound change? */ 129/** tracks changes of the variables' domains (static arrays, bound changes only) */ 132 unsigned int nboundchgs:30;
/**< number of bound changes (must be first structure entry!) */ 133 unsigned int domchgtype:2;
/**< type of domain change data (must be first structure entry!) */ 137/** tracks changes of the variables' domains (static arrays, bound and hole changes) */ 140 unsigned int nboundchgs:30;
/**< number of bound changes (must be first structure entry!) */ 141 unsigned int domchgtype:2;
/**< type of domain change data (must be first structure entry!) */ 147/** tracks changes of the variables' domains (dynamic arrays) */ 150 unsigned int nboundchgs:30;
/**< number of bound changes (must be first structure entry!) */ 151 unsigned int domchgtype:2;
/**< type of domain change data (must be first structure entry!) */ 159/** tracks changes of the variables' domains */ 167/** domain of a variable */ 175/** original variable information */ 182/** aggregation information: x = a*y + c */ 190/** multiple aggregation information: x = a_1*y_1 + ... + a_k*y_k + c */ 196 int nvars;
/**< number of variables in aggregation */ 197 int varssize;
/**< size of vars and scalars arrays */ 200/** negation information: x' = c - x */ 206/** variable of the problem */ 209 SCIP_Real obj;
/**< objective function value of variable (might be changed temporarily in probing mode)*/ 210 SCIP_Real unchangedobj;
/**< unchanged objective function value of variable (ignoring temporary changes in probing mode) */ 213 SCIP_Real bestrootsol;
/**< best primal solution of variable in root node, or zero, w.r.t. root LP value and root reduced cost */ 214 SCIP_Real bestrootredcost;
/**< best reduced costs of variable in root node, or zero, w.r.t. root LP value and root solution value */ 216 SCIP_Real relaxsol;
/**< primal solution of variable in current relaxation solution, or SCIP_INVALID */ 217 SCIP_Real nlpsol;
/**< primal solution of variable in current NLP solution, or SCIP_INVALID */ 223 SCIP_Real lazylb;
/**< global lower bound that is ensured by constraints and has not to be added to the LP */ 224 SCIP_Real lazyub;
/**< global upper bound that is ensured by constraints and has not to be added to the LP */ 235 char*
name;
/**< name of the variable */ 238 SCIP_DECL_VARTRANS((*vartrans));
/**< creates transformed user data by transforming original user data */ 242 SCIP_VAR*
negatedvar;
/**< pointer to the variables negation: x' = lb + ub - x, or NULL if not created */ 245 SCIP_IMPLICS*
implics;
/**< implications y >=/<= b following from x <= 0 and x >= 1 (x binary), or NULL if x is not binary */ 254 int index;
/**< consecutively numbered variable identifier */ 255 int probindex;
/**< array position in problems vars array, or -1 if not assigned to a problem */ 256 int pseudocandindex;
/**< array position in pseudo branching candidates array, or -1 */ 258 int eventqueueindexlb;
/**< array position in event queue of lower bound change event, or -1 */ 259 int eventqueueindexub;
/**< array position in event queue of upper bound change event, or -1 */ 261 int nparentvars;
/**< number of parent variables in aggregation tree (used slots of parentvars) */ 262 int nuses;
/**< number of times, this variable is referenced */ 263 int nlocksdown[
NLOCKTYPES];
/**< array of variable locks for rounding down; if zero, rounding down is always feasible */ 264 int nlocksup[
NLOCKTYPES];
/**< array of variable locks for rounding up; if zero, rounding up is always feasible */ 267 int nlbchginfos;
/**< number of lower bound changes from root node to current node */ 269 int nubchginfos;
/**< number of upper bound changes from root node to current node */ 272 int closestvlbidx;
/**< index of closest VLB variable in current LP solution, or -1 */ 273 int closestvubidx;
/**< index of closest VUB variable in current LP solution, or -1 */ 274 unsigned int initial:1;
/**< TRUE iff var's column should be present in the initial root LP */ 275 unsigned int removable:1;
/**< TRUE iff var's column is removable from the LP (due to aging or cleanup) */ 276 unsigned int deletable:1;
/**< TRUE iff the variable is removable from the problem */ 277 unsigned int deleted:1;
/**< TRUE iff variable was marked for deletion from the problem */ 278 unsigned int donotaggr:1;
/**< TRUE iff variable is not allowed to be aggregated */ 279 unsigned int donotmultaggr:1;
/**< TRUE iff variable is not allowed to be multi-aggregated */ 280 unsigned int vartype:2;
/**< type of variable: binary, integer, implicit integer, continuous */ 281 unsigned int varstatus:3;
/**< status of variable: original, loose, column, fixed, aggregated, multiaggregated, negated */ 282 unsigned int pseudocostflag:2;
/**< temporary flag used in pseudo cost update */ 283 unsigned int branchdirection:2;
/**< preferred branching direction of the variable (downwards, upwards, auto) */ 284 unsigned int eventqueueimpl:1;
/**< is an IMPLADDED event on this variable currently in the event queue? */ 285 unsigned int delglobalstructs:1;
/**< is variable marked to be removed from global structures (cliques etc.)? */ 286 unsigned int relaxationonly:1;
/**< TRUE if variable has been introduced only to define a relaxation */common defines and data types used in all packages of SCIP
SCIP_INFERENCEDATA inferencedata
unsigned int boundchgtype
unsigned int inferboundtype
union SCIP_BoundChg::@21 data
SCIP_INFERENCEDATA inferencedata
SCIP_BRANCHINGDATA branchingdata
unsigned int inferboundtype
unsigned int boundchgtype
SCIP_BOUNDCHG * boundchgs
SCIP_BOUNDCHG * boundchgs
SCIP_BOUNDCHG * boundchgs
SCIP_EVENTFILTER * eventfilter
SCIP_BDCHGINFO * lbchginfos
SCIP_DECL_VARDELTRANS((*vardeltrans))
int nlocksdown[NLOCKTYPES]
SCIP_HISTORY * historycrun
unsigned int relaxationonly
unsigned int donotmultaggr
unsigned int eventqueueimpl
SCIP_Real conflictrelaxedub
SCIP_BDCHGINFO * ubchginfos
unsigned int pseudocostflag
SCIP_Real bestrootredcost
SCIP_DECL_VARTRANS((*vartrans))
SCIP_Real conflictrelaxedlb
SCIP_CLIQUELIST * cliquelist
unsigned int branchdirection
unsigned int delglobalstructs
SCIP_DECL_VARDELORIG((*vardelorig))
SCIP_DECL_VARCOPY((*varcopy))
SCIP_Longint closestvblpcount
SCIP_Real bestrootlpobjval
SCIP_VALUEHISTORY * valuehistory
type definitions for constraints and constraint handlers
type definitions for managing events
type definitions for branching and inference history
type definitions for implications, variable bounds, and cliques
type definitions for LP management
type definitions for propagators
type definitions for problem variables
struct SCIP_VarData SCIP_VARDATA
struct SCIP_BranchingData SCIP_BRANCHINGDATA
struct SCIP_InferenceData SCIP_INFERENCEDATA
SCIP_DOMCHGBOUND domchgbound
SCIP_DOMCHGBOTH domchgboth
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