Bonmin
1.7
|
bestNode(double cutoff) | Bonmin::CbcProbedDiver | [virtual] |
candidateChild_ | Bonmin::CbcProbedDiver | [private] |
CbcProbedDiver() | Bonmin::CbcProbedDiver | |
CbcProbedDiver(const CbcProbedDiver &rhs) | Bonmin::CbcProbedDiver | |
cleanTree(CbcModel *model, double cutoff, double &bestPossibleObjective) | Bonmin::CbcProbedDiver | [virtual] |
clone() const | Bonmin::CbcProbedDiver | [virtual] |
empty() | Bonmin::CbcProbedDiver | [virtual] |
endSearch() | Bonmin::CbcProbedDiver | [inline, virtual] |
getBestPossibleObjective() | Bonmin::CbcProbedDiver | [virtual] |
initialize(BabSetupBase &b) | Bonmin::CbcProbedDiver | |
nextOnBranch_ | Bonmin::CbcProbedDiver | [private] |
operator=(const CbcProbedDiver &rhs) | Bonmin::CbcProbedDiver | |
pop() | Bonmin::CbcProbedDiver | [virtual] |
push(CbcNode *x) | Bonmin::CbcProbedDiver | [virtual] |
size() | Bonmin::CbcProbedDiver | [inline, virtual] |
stop_diving_on_cutoff_ | Bonmin::CbcProbedDiver | [private] |
top() const | Bonmin::CbcProbedDiver | [virtual] |
treeCleaning_ | Bonmin::CbcProbedDiver | [private] |
~CbcProbedDiver() | Bonmin::CbcProbedDiver | [virtual] |