Dip  0.92.4
CbcTreeLocal Member List

This is the complete list of members for CbcTreeLocal, including all inherited members.

addBranchingInformation(const CbcModel *model, const CbcNodeInfo *nodeInfo, const double *currentLower, const double *currentUpper)CbcTree
bestAlternate()CbcTree
bestCutoff_CbcTreeLocalprivate
bestNode(double cutoff)CbcTreevirtual
bestSolution_CbcTreeLocalprivate
branched() const CbcTreeinline
branched_CbcTreeprotected
CbcTree()CbcTree
CbcTree(const CbcTree &rhs)CbcTree
CbcTreeLocal()CbcTreeLocal
CbcTreeLocal(CbcModel *model, const double *solution, int range=10, int typeCuts=0, int maxDiversification=0, int timeLimit=1000000, int nodeLimit=1000000, bool refine=true)CbcTreeLocal
CbcTreeLocal(const CbcTreeLocal &rhs)CbcTreeLocal
cleanTree(CbcModel *model, double cutoff, double &bestPossibleObjective)CbcTreevirtual
clone() const CbcTreeLocalvirtual
comparison_CbcTreeprotected
createCut(const double *solution, OsiRowCut &cut)CbcTreeLocal
cut_CbcTreeLocalprivate
deleteCut(OsiRowCut &cut)CbcTreeLocal
diversification_CbcTreeLocalprivate
empty()CbcTreeLocalvirtual
endSearch()CbcTreeLocalvirtual
fixedCut_CbcTreeLocalprivate
fixTop()CbcTree
generateCpp(FILE *fp)CbcTreeLocalvirtual
getBestPossibleObjective()CbcTreevirtual
getMaximumBranching() const CbcTreeinline
getNumberBranching() const CbcTreeinline
increaseSpace()CbcTree
lastDepth() const CbcTreeinline
lastDepth_CbcTreeprotected
lastObjective() const CbcTreeinline
lastObjective_CbcTreeprotected
lastUnsatisfied() const CbcTreeinline
lastUnsatisfied_CbcTreeprotected
localNode_CbcTreeLocalprivate
maxDiversification() const CbcTreeLocalinline
maxDiversification_CbcTreeLocalprivate
maximumBranching_CbcTreeprotected
maximumNodeNumber() const CbcTreeinline
maximumNodeNumber_CbcTreeprotected
model_CbcTreeLocalprivate
newBound_CbcTreeprotected
newBounds() const CbcTreeinline
nextStrong_CbcTreeLocalprivate
nodeLimit() const CbcTreeLocalinline
nodeLimit_CbcTreeLocalprivate
nodePointer(int i) const CbcTreeinline
nodes_CbcTreeprotected
numberBranching_CbcTreeprotected
operator=(const CbcTreeLocal &rhs)CbcTreeLocal
CbcTree::operator=(const CbcTree &rhs)CbcTree
operator[](int i) const CbcTreeinline
originalLower_CbcTreeLocalprivate
originalUpper_CbcTreeLocalprivate
passInSolution(const double *solution, double solutionValue)CbcTreeLocal
pop()CbcTreeLocalvirtual
push(CbcNode *x)CbcTreeLocalvirtual
range() const CbcTreeLocalinline
range_CbcTreeLocalprivate
realpop()CbcTree
realpush(CbcNode *node)CbcTree
rebuild()CbcTreevirtual
refine() const CbcTreeLocalinline
refine_CbcTreeLocalprivate
resetNodeNumbers()CbcTreeinline
reverseCut(int state, double bias=0.0)CbcTreeLocal
rhs_CbcTreeLocalprivate
savedGap_CbcTreeLocalprivate
savedSolution_CbcTreeLocalprivate
saveNumberSolutions_CbcTreeLocalprivate
searchType_CbcTreeLocalprivate
setComparison(CbcCompareBase &compare)CbcTree
setMaxDiversification(int value)CbcTreeLocalinline
setMaximumBranching(int value)CbcTreeinline
setNodeLimit(int value)CbcTreeLocalinline
setNumberBranching(int value)CbcTreeinline
setRange(int value)CbcTreeLocalinline
setRefine(bool yesNo)CbcTreeLocalinline
setTimeLimit(int value)CbcTreeLocalinline
setTypeCuts(int value)CbcTreeLocalinline
size() const CbcTreeinlinevirtual
startNode_CbcTreeLocalprivate
startTime_CbcTreeLocalprivate
timeLimit() const CbcTreeLocalinline
timeLimit_CbcTreeLocalprivate
top() const CbcTreeLocalvirtual
typeCuts() const CbcTreeLocalinline
typeCuts_CbcTreeLocalprivate
~CbcTree()CbcTreevirtual
~CbcTreeLocal()CbcTreeLocalvirtual