bestAlternate() | CbcTree | |
bestCutoff_ | CbcTreeLocal | [private] |
bestNode(double cutoff) | CbcTree | [virtual] |
bestSolution_ | CbcTreeLocal | [private] |
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) | CbcTree | [virtual] |
clone() const | CbcTreeLocal | [virtual] |
comparison_ | CbcTree | [protected] |
createCut(const double *solution, OsiRowCut &cut) | CbcTreeLocal | |
cut_ | CbcTreeLocal | [private] |
deleteCut(OsiRowCut &cut) | CbcTreeLocal | |
diversification_ | CbcTreeLocal | [private] |
empty() | CbcTreeLocal | [virtual] |
endSearch() | CbcTreeLocal | [virtual] |
fixedCut_ | CbcTreeLocal | [private] |
generateCpp(FILE *fp) | CbcTreeLocal | [virtual] |
getBestPossibleObjective() | CbcTree | [virtual] |
localNode_ | CbcTreeLocal | [private] |
maxDiversification() const | CbcTreeLocal | [inline] |
maxDiversification_ | CbcTreeLocal | [private] |
maximumNodeNumber_ | CbcTree | [protected] |
model_ | CbcTreeLocal | [private] |
nextStrong_ | CbcTreeLocal | [private] |
nodeLimit() const | CbcTreeLocal | [inline] |
nodeLimit_ | CbcTreeLocal | [private] |
nodes_ | CbcTree | [protected] |
operator=(const CbcTreeLocal &rhs) | CbcTreeLocal | |
CbcTree::operator=(const CbcTree &rhs) | CbcTree | |
originalLower_ | CbcTreeLocal | [private] |
originalUpper_ | CbcTreeLocal | [private] |
passInSolution(const double *solution, double solutionValue) | CbcTreeLocal | |
pop() | CbcTreeLocal | [virtual] |
push(CbcNode *x) | CbcTreeLocal | [virtual] |
range() const | CbcTreeLocal | [inline] |
range_ | CbcTreeLocal | [private] |
refine() const | CbcTreeLocal | [inline] |
refine_ | CbcTreeLocal | [private] |
resetNodeNumbers() | CbcTree | [inline] |
reverseCut(int state, double bias=0.0) | CbcTreeLocal | |
rhs_ | CbcTreeLocal | [private] |
savedGap_ | CbcTreeLocal | [private] |
savedSolution_ | CbcTreeLocal | [private] |
saveNumberSolutions_ | CbcTreeLocal | [private] |
searchType_ | CbcTreeLocal | [private] |
setComparison(CbcCompareBase &compare) | CbcTree | |
setMaxDiversification(int value) | CbcTreeLocal | [inline] |
setNodeLimit(int value) | CbcTreeLocal | [inline] |
setRange(int value) | CbcTreeLocal | [inline] |
setRefine(bool yesNo) | CbcTreeLocal | [inline] |
setTimeLimit(int value) | CbcTreeLocal | [inline] |
setTypeCuts(int value) | CbcTreeLocal | [inline] |
size() const | CbcTree | [inline, virtual] |
startNode_ | CbcTreeLocal | [private] |
startTime_ | CbcTreeLocal | [private] |
timeLimit() const | CbcTreeLocal | [inline] |
timeLimit_ | CbcTreeLocal | [private] |
top() const | CbcTreeLocal | [virtual] |
typeCuts() const | CbcTreeLocal | [inline] |
typeCuts_ | CbcTreeLocal | [private] |
~CbcTree() | CbcTree | [virtual] |
~CbcTreeLocal() | CbcTreeLocal | [virtual] |