|
| | CbcTreeVariable () |
| |
| | CbcTreeVariable (CbcModel *model, const double *solution, int range=10, int typeCuts=0, int maxDiversification=0, int timeLimit=1000000, int nodeLimit=1000000, bool refine=true) |
| |
| | CbcTreeVariable (const CbcTreeVariable &rhs) |
| |
| CbcTreeVariable & | operator= (const CbcTreeVariable &rhs) |
| |
| virtual | ~CbcTreeVariable () |
| |
| virtual CbcTree * | clone () const |
| | Clone. More...
|
| |
| virtual void | generateCpp (FILE *fp) |
| | Create C++ lines to get to current state. More...
|
| |
|
| virtual CbcNode * | top () const |
| | Return the top node of the heap. More...
|
| |
| virtual void | push (CbcNode *x) |
| | Add a node to the heap. More...
|
| |
| virtual void | pop () |
| | Remove the top node from the heap. More...
|
| |
|
| int | createCut (const double *solution, OsiRowCut &cut) |
| | Create cut - return -1 if bad, 0 if okay and 1 if cut is everything. More...
|
| |
| virtual bool | empty () |
| | Test if empty *** note may be overridden. More...
|
| |
| virtual void | endSearch () |
| | We may have got an intelligent tree so give it one more chance. More...
|
| |
| void | reverseCut (int state, double bias=0.0) |
| | Other side of last cut branch (if bias==rhs_ will be weakest possible) More...
|
| |
| void | deleteCut (OsiRowCut &cut) |
| | Delete last cut branch. More...
|
| |
| void | passInSolution (const double *solution, double solutionValue) |
| | Pass in solution (so can be used after heuristic) More...
|
| |
| int | range () const |
| |
| void | setRange (int value) |
| |
| int | typeCuts () const |
| |
| void | setTypeCuts (int value) |
| |
| int | maxDiversification () const |
| |
| void | setMaxDiversification (int value) |
| |
| int | timeLimit () const |
| |
| void | setTimeLimit (int value) |
| |
| int | nodeLimit () const |
| |
| void | setNodeLimit (int value) |
| |
| bool | refine () const |
| |
| void | setRefine (bool yesNo) |
| |
| | CbcTree () |
| | Default Constructor. More...
|
| |
| | CbcTree (const CbcTree &rhs) |
| | Copy constructor. More...
|
| |
| CbcTree & | operator= (const CbcTree &rhs) |
| | = operator More...
|
| |
| virtual | ~CbcTree () |
| | Destructor. More...
|
| |
| void | setComparison (CbcCompareBase &compare) |
| | Set comparison function and resort heap. More...
|
| |
| virtual CbcNode * | bestNode (double cutoff) |
| | Gets best node and takes off heap. More...
|
| |
| virtual void | rebuild () |
| | Rebuild the heap. More...
|
| |
| virtual int | size () const |
| | Return size. More...
|
| |
| CbcNode * | operator[] (int i) const |
| | Return a node pointer. More...
|
| |
| CbcNode * | nodePointer (int i) const |
| | Return a node pointer. More...
|
| |
| void | realpop () |
| |
| void | fixTop () |
| | After changing data in the top node, fix the heap. More...
|
| |
| void | realpush (CbcNode *node) |
| |
| virtual void | cleanTree (CbcModel *model, double cutoff, double &bestPossibleObjective) |
| | Prune the tree using an objective function cutoff. More...
|
| |
| CbcNode * | bestAlternate () |
| | Get best on list using alternate method. More...
|
| |
| virtual double | getBestPossibleObjective () |
| | Get best possible objective function in the tree. More...
|
| |
| void | resetNodeNumbers () |
| | Reset maximum node number. More...
|
| |
| int | maximumNodeNumber () const |
| | Get maximum node number. More...
|
| |
| void | setNumberBranching (int value) |
| | Set number of branches. More...
|
| |
| int | getNumberBranching () const |
| | Get number of branches. More...
|
| |
| void | setMaximumBranching (int value) |
| | Set maximum branches. More...
|
| |
| int | getMaximumBranching () const |
| | Get maximum branches. More...
|
| |
| unsigned int * | branched () const |
| | Get branched variables. More...
|
| |
| int * | newBounds () const |
| | Get bounds. More...
|
| |
| double | lastObjective () const |
| | Last objective in branch-and-cut search tree. More...
|
| |
| int | lastDepth () const |
| | Last depth in branch-and-cut search tree. More...
|
| |
| int | lastUnsatisfied () const |
| | Last number of objects unsatisfied. More...
|
| |
| void | addBranchingInformation (const CbcModel *model, const CbcNodeInfo *nodeInfo, const double *currentLower, const double *currentUpper) |
| | Adds branching information to complete state. More...
|
| |
| void | increaseSpace () |
| | Increase space for data. More...
|
| |
Definition at line 206 of file CbcTreeLocal.hpp.