/dports/math/SCIP/scip-7.0.3/src/scip/ |
H A D | tree.c | 7599 SCIP_BOUNDCHG* boundchgs; in SCIPnodeGetNDualBndchgs() local 7610 boundchgs = node->domchg->domchgbound.boundchgs; in SCIPnodeGetNDualBndchgs() 7651 SCIP_BOUNDCHG* boundchgs; in SCIPnodeGetDualBoundchgs() local 7668 boundchgs = node->domchg->domchgbound.boundchgs; in SCIPnodeGetDualBoundchgs() 7739 SCIP_BOUNDCHG* boundchgs; in SCIPnodeGetParentBranchings() local 7756 boundchgs = node->domchg->domchgbound.boundchgs; in SCIPnodeGetParentBranchings() 7881 SCIP_BOUNDCHG* boundchgs; in SCIPnodeGetConsProps() local 7900 boundchgs = node->domchg->domchgbound.boundchgs; in SCIPnodeGetConsProps() 7970 SCIP_BOUNDCHG* boundchgs; in SCIPnodeGetBdChgsAfterDual() local 7988 boundchgs = node->domchg->domchgbound.boundchgs; in SCIPnodeGetBdChgsAfterDual() [all …]
|
H A D | struct_var.h | 125 SCIP_BOUNDCHG* boundchgs; /**< array with changes in bounds of variables */ member 133 SCIP_BOUNDCHG* boundchgs; /**< array with changes in bounds of variables */ member 143 SCIP_BOUNDCHG* boundchgs; /**< array with changes in bounds of variables */ member
|
H A D | debug.c | 627 SCIP_BOUNDCHG* boundchgs; in isSolutionInNode() local 631 boundchgs = domchgbound->boundchgs; in isSolutionInNode() 637 SCIP_CALL( getSolutionValue(set, boundchgs[i].var, &varsol) ); in isSolutionInNode() 642 if( SCIPboundchgGetBoundtype(&boundchgs[i]) == SCIP_BOUNDTYPE_LOWER ) in isSolutionInNode() 643 *solcontained = SCIPsetIsFeasGE(set, varsol, boundchgs[i].newbound); in isSolutionInNode() 645 *solcontained = SCIPsetIsFeasLE(set, varsol, boundchgs[i].newbound); in isSolutionInNode() 647 …if( !(*solcontained) && SCIPboundchgGetBoundchgtype(&boundchgs[i]) != SCIP_BOUNDCHGTYPE_BRANCHING ) in isSolutionInNode() 650 node, SCIPnodeGetDepth(node), SCIPvarGetName(boundchgs[i].var), varsol, in isSolutionInNode() 651 …SCIPboundchgGetBoundtype(&boundchgs[i]) == SCIP_BOUNDTYPE_LOWER ? ">=" : "<=", boundchgs[i].newbou… in isSolutionInNode() 655 else if( SCIPboundchgGetBoundchgtype(&boundchgs[i]) == SCIP_BOUNDCHGTYPE_BRANCHING ) in isSolutionInNode()
|
H A D | visual.c | 70 (*var) = domchgbound->boundchgs[0].var; in getBranchInfo() 71 (*bound) = domchgbound->boundchgs[0].newbound; in getBranchInfo() 72 (*boundtype) = (SCIP_BOUNDTYPE) domchgbound->boundchgs[0].boundtype; in getBranchInfo()
|
H A D | solve.c | 790 SCIP_BOUNDCHG* boundchgs; in updatePseudocost() local 793 boundchgs = node->domchg->domchgbound.boundchgs; in updatePseudocost() 797 var = boundchgs[i].var; in updatePseudocost() 807 if( (SCIP_BOUNDCHGTYPE)boundchgs[i].boundchgtype == SCIP_BOUNDCHGTYPE_BRANCHING && in updatePseudocost() 813 updates[nupdates] = &boundchgs[i]; in updatePseudocost() 818 …if( isPseudocostUpdateValid(var, set, boundchgs[i].data.branchingdata.lpsolval, updateintegers, up… in updatePseudocost() 819 …(SCIPvarGetType(var) != SCIP_VARTYPE_CONTINUOUS || !boundchgs[i].redundant || set->branch_lpgainno… in updatePseudocost()
|
H A D | var.c | 976 (*domchg)->domchgdyn.boundchgs = NULL; in domchgCreate() 1079 || EPSISINT((*domchg)->domchgbound.boundchgs[i].newbound, 1e-06)); in domchgMakeDynamic() 1134 SCIP_ALLOC( BMSreallocBlockMemoryArray(blkmem, &(*domchg)->domchgdyn.boundchgs, \ in SCIPdomchgMakeStatic() 1146 SCIP_ALLOC( BMSreallocBlockMemoryArray(blkmem, &(*domchg)->domchgdyn.boundchgs, \ in SCIPdomchgMakeStatic() 1166 || SCIPsetIsFeasIntegral(set, (*domchg)->domchgbound.boundchgs[i].newbound)); in SCIPdomchgMakeStatic() 1251 SCIP_CALL( SCIPboundchgApply(&domchg->domchgbound.boundchgs[i], blkmem, set, stat, lp, in SCIPdomchgApply() 1260 domchg->domchgbound.boundchgs[i].redundant = TRUE; in SCIPdomchgApply() 1335 SCIP_CALL( boundchgApplyGlobal(&domchg->domchgbound.boundchgs[i], blkmem, set, stat, lp, in SCIPdomchgApplyGlobal() 1396 boundchg = &(*domchg)->domchgdyn.boundchgs[(*domchg)->domchgdyn.nboundchgs]; in SCIPdomchgAddBoundchg() 1436 || SCIPsetIsFeasIntegral(set, (*domchg)->domchgbound.boundchgs[i].newbound)); in SCIPdomchgAddBoundchg() [all …]
|
H A D | pub_var.h | 1459 #define SCIPdomchgGetBoundchg(domchg, pos) (&(domchg)->domchgbound.boundchgs[pos])
|
H A D | conflict.c | 5457 … assert(tree->path[bdchgdepth]->domchg->domchgbound.boundchgs[SCIPbdchginfoGetPos(bdchginfo)].var in conflictAnalyze() 5459 …assert(tree->path[bdchgdepth]->domchg->domchgbound.boundchgs[SCIPbdchginfoGetPos(bdchginfo)].newbo… in conflictAnalyze() 5464 …assert((SCIP_BOUNDTYPE)tree->path[bdchgdepth]->domchg->domchgbound.boundchgs[SCIPbdchginfoGetPos(b… in conflictAnalyze()
|
/dports/math/highs/HiGHS-cfe064e/src/presolve/ |
H A D | HighsLpPropagator.h | 61 int ninfmin, HighsDomainChange* boundchgs); 65 int ninfmax, HighsDomainChange* boundchgs);
|
H A D | HighsLpPropagator.cpp | 119 HighsDomainChange* boundchgs) { in propagateRowUpper() argument 160 boundchgs[numchgs++] = {HighsBoundType::Upper, Rindex[i], bound}; in propagateRowUpper() 185 boundchgs[numchgs++] = {HighsBoundType::Lower, Rindex[i], bound}; in propagateRowUpper() 197 HighsDomainChange* boundchgs) { in propagateRowLower() argument 238 boundchgs[numchgs++] = {HighsBoundType::Upper, Rindex[i], bound}; in propagateRowLower() 261 boundchgs[numchgs++] = {HighsBoundType::Lower, Rindex[i], bound}; in propagateRowLower()
|
/dports/math/highs/HiGHS-cfe064e/src/mip/ |
H A D | HighsDomain.h | 63 int ninfmin, HighsDomainChange* boundchgs); 67 int ninfmax, HighsDomainChange* boundchgs);
|
H A D | HighsDomain.cpp | 103 HighsDomainChange* boundchgs) { in propagateRowUpper() argument 147 boundchgs[numchgs++] = {HighsBoundType::Upper, Rindex[i], bound}; in propagateRowUpper() 175 boundchgs[numchgs++] = {HighsBoundType::Lower, Rindex[i], bound}; in propagateRowUpper() 185 HighsDomainChange* boundchgs) { in propagateRowLower() argument 229 boundchgs[numchgs++] = {HighsBoundType::Upper, Rindex[i], bound}; in propagateRowLower() 256 boundchgs[numchgs++] = {HighsBoundType::Lower, Rindex[i], bound}; in propagateRowLower()
|