addBranchingInformation(const CbcModel *model, const CbcNodeInfo *nodeInfo, const double *currentLower, const double *currentUpper) | CbcTree | |
bestAlternate() | CbcTree | |
bestNode(double cutoff) | CbcTreeArray | [virtual] |
branched() const | CbcTree | [inline] |
branched_ | CbcTree | [protected] |
CbcTree() | CbcTree | |
CbcTree(const CbcTree &rhs) | CbcTree | |
CbcTreeArray() | CbcTreeArray | |
CbcTreeArray(const CbcTreeArray &rhs) | CbcTreeArray | |
cleanTree(CbcModel *model, double cutoff, double &bestPossibleObjective) | CbcTreeArray | [virtual] |
clone() const | CbcTreeArray | [virtual] |
comparison_ | CbcTree | [protected] |
empty() | CbcTreeArray | [virtual] |
endSearch() | CbcTree | [inline, virtual] |
generateCpp(FILE *fp) | CbcTreeArray | [inline, virtual] |
getBestPossibleObjective() | CbcTreeArray | [virtual] |
getMaximumBranching() const | CbcTree | [inline] |
getNumberBranching() const | CbcTree | [inline] |
increaseSpace() | CbcTree | |
lastNode_ | CbcTreeArray | [protected] |
lastNodePopped_ | CbcTreeArray | [protected] |
maximumBranching_ | CbcTree | [protected] |
maximumNodeNumber_ | CbcTree | [protected] |
newBound_ | CbcTree | [protected] |
newBounds() const | CbcTree | [inline] |
nodePointer(int i) const | CbcTree | [inline] |
nodes_ | CbcTree | [protected] |
numberBranching_ | CbcTree | [protected] |
operator=(const CbcTreeArray &rhs) | CbcTreeArray | |
operator[](int i) const | CbcTree | [inline] |
pop() | CbcTree | [virtual] |
push(CbcNode *x) | CbcTreeArray | [virtual] |
resetNodeNumbers() | CbcTree | [inline] |
setComparison(CbcCompareBase &compare) | CbcTreeArray | |
setMaximumBranching(int value) | CbcTree | [inline] |
setNumberBranching(int value) | CbcTree | [inline] |
size() const | CbcTree | [inline, virtual] |
switches_ | CbcTreeArray | [protected] |
top() const | CbcTree | [virtual] |
~CbcTree() | CbcTree | [virtual] |
~CbcTreeArray() | CbcTreeArray | [virtual] |