#include <CbcTreeLocal.hpp>
Inheritance diagram for CbcTreeLocal:
Public Member Functions | |
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 (const CbcTreeLocal &rhs) | |
CbcTreeLocal & | operator= (const CbcTreeLocal &rhs) |
virtual | ~CbcTreeLocal () |
virtual CbcTree * | clone () const |
Clone. | |
Heap access and maintenance methods | |
virtual CbcNode * | top () |
Return the top node of the heap. | |
virtual void | push (CbcNode *x) |
Add a node to the heap. | |
virtual void | pop () |
Remove the top node from the heap. | |
Other stuff | |
int | createCut (const double *solution, OsiRowCut &cut) |
Create cut - return -1 if bad, 0 if okay and 1 if cut is everything. | |
virtual bool | empty () |
Test if empty *** note may be overridden. | |
virtual void | endSearch () |
We may have got an intelligent tree so give it one more chance. | |
void | reverseCut (int state, double bias=0.0) |
Other side of last cut branch (if bias==rhs_ will be weakest possible). | |
void | deleteCut (OsiRowCut &cut) |
Delete last cut branch. | |
void | passInSolution (const double *solution, double solutionValue) |
Pass in solution (so can be used after heuristic). | |
Private Attributes | |
CbcNode * | localNode_ |
double * | bestSolution_ |
double * | savedSolution_ |
int | saveNumberSolutions_ |
OsiRowCut | cut_ |
OsiRowCut | fixedCut_ |
CbcModel * | model_ |
double * | originalLower_ |
double * | originalUpper_ |
int | range_ |
int | typeCuts_ |
int | maxDiversification_ |
int | diversification_ |
bool | nextStrong_ |
double | rhs_ |
double | savedGap_ |
double | bestCutoff_ |
int | timeLimit_ |
int | startTime_ |
int | nodeLimit_ |
int | startNode_ |
int | searchType_ |
bool | refine_ |
|
|
|
|
|
|
|
|
|
|
|
Clone.
Reimplemented from CbcTree. |
|
Return the top node of the heap.
Reimplemented from CbcTree. |
|
Add a node to the heap.
Reimplemented from CbcTree. |
|
Remove the top node from the heap.
Reimplemented from CbcTree. |
|
Create cut - return -1 if bad, 0 if okay and 1 if cut is everything.
|
|
Test if empty *** note may be overridden.
Reimplemented from CbcTree. |
|
We may have got an intelligent tree so give it one more chance.
Reimplemented from CbcTree. |
|
Other side of last cut branch (if bias==rhs_ will be weakest possible).
|
|
Delete last cut branch.
|
|
Pass in solution (so can be used after heuristic).
|
|
Definition at line 105 of file CbcTreeLocal.hpp. |
|
Definition at line 107 of file CbcTreeLocal.hpp. |
|
Definition at line 109 of file CbcTreeLocal.hpp. |
|
Definition at line 111 of file CbcTreeLocal.hpp. |
|
Definition at line 113 of file CbcTreeLocal.hpp. |
|
Definition at line 115 of file CbcTreeLocal.hpp. |
|
Definition at line 117 of file CbcTreeLocal.hpp. |
|
Definition at line 119 of file CbcTreeLocal.hpp. |
|
Definition at line 121 of file CbcTreeLocal.hpp. |
|
Definition at line 123 of file CbcTreeLocal.hpp. |
|
Definition at line 125 of file CbcTreeLocal.hpp. |
|
Definition at line 127 of file CbcTreeLocal.hpp. |
|
Definition at line 129 of file CbcTreeLocal.hpp. |
|
Definition at line 131 of file CbcTreeLocal.hpp. |
|
Definition at line 133 of file CbcTreeLocal.hpp. |
|
Definition at line 135 of file CbcTreeLocal.hpp. |
|
Definition at line 137 of file CbcTreeLocal.hpp. |
|
Definition at line 139 of file CbcTreeLocal.hpp. |
|
Definition at line 141 of file CbcTreeLocal.hpp. |
|
Definition at line 143 of file CbcTreeLocal.hpp. |
|
Definition at line 145 of file CbcTreeLocal.hpp. |
|
Definition at line 147 of file CbcTreeLocal.hpp. |
|
Definition at line 149 of file CbcTreeLocal.hpp. |