36 #include "OsiRowCut.hpp" 91 int createCut(
const double *solution, OsiRowCut &cut);
103 void passInSolution(
const double *solution,
double solutionValue);
127 return maxDiversification_;
132 maxDiversification_ = value;
170 double *bestSolution_;
172 double *savedSolution_;
174 int saveNumberSolutions_;
182 double *originalLower_;
184 double *originalUpper_;
190 int maxDiversification_;
192 int diversification_;
267 int createCut(
const double *solution, OsiRowCut &cut);
270 virtual bool empty();
275 void reverseCut(
int state,
double bias = 0.0);
279 void passInSolution(
const double *solution,
double solutionValue);
303 return maxDiversification_;
308 maxDiversification_ = value;
346 double *bestSolution_;
348 double *savedSolution_;
350 int saveNumberSolutions_;
358 double *originalLower_;
360 double *originalUpper_;
366 int maxDiversification_;
368 int diversification_;
void setTypeCuts(int value)
CbcTreeLocal & operator=(const CbcTreeLocal &rhs)
virtual void generateCpp(FILE *fp)
Create C++ lines to get to current state.
virtual CbcTree * clone() const
Clone.
void passInSolution(const double *solution, double solutionValue)
Pass in solution (so can be used after heuristic)
void setTimeLimit(int value)
void setMaxDiversification(int value)
void setRefine(bool yesNo)
int maxDiversification() const
virtual void pop()
Remove the top node from the heap.
void setNodeLimit(int value)
void deleteCut(OsiRowCut &cut)
Delete last cut branch.
virtual void push(CbcNode *x)
Add a node to the heap.
Using MS heap implementation.
void setMaxDiversification(int value)
virtual bool empty()
Test if empty *** note may be overridden.
Information required while the node is live.
void setTimeLimit(int value)
int createCut(const double *solution, OsiRowCut &cut)
Create cut - return -1 if bad, 0 if okay and 1 if cut is everything.
void setNodeLimit(int value)
virtual CbcNode * top() const
Return the top node of the heap.
int maxDiversification() const
void setRefine(bool yesNo)
void reverseCut(int state, double bias=0.0)
Other side of last cut branch (if bias==rhs_ will be weakest possible)
Simple Branch and bound class.
void setTypeCuts(int value)
virtual void endSearch()
We may have got an intelligent tree so give it one more chance.