36 #include "OsiRowCut.hpp"
91 int createCut(
const double *solution, OsiRowCut &cut);
Simple Branch and bound class.
Information required while the node is live.
CbcTreeLocal(const CbcTreeLocal &rhs)
void setTypeCuts(int value)
void setRefine(bool yesNo)
virtual CbcNode * top() const
Return the top node of the heap.
virtual void generateCpp(FILE *fp)
Create C++ lines to get to current state.
void setTimeLimit(int value)
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 & operator=(const CbcTreeLocal &rhs)
int maxDiversification() const
virtual void push(CbcNode *x)
Add a node to the heap.
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 passInSolution(const double *solution, double solutionValue)
Pass in solution (so can be used after heuristic)
virtual bool empty()
Test if empty *** note may be overridden.
virtual CbcTree * clone() const
Clone.
void setMaxDiversification(int value)
void deleteCut(OsiRowCut &cut)
Delete last cut branch.
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 void pop()
Remove the top node from the heap.
int maxDiversification() const
virtual bool empty()
Test if empty *** note may be overridden.
CbcTreeVariable(const CbcTreeVariable &rhs)
virtual void push(CbcNode *x)
Add a node to the heap.
void setTypeCuts(int value)
void passInSolution(const double *solution, double solutionValue)
Pass in solution (so can be used after heuristic)
virtual void generateCpp(FILE *fp)
Create C++ lines to get to current state.
virtual void pop()
Remove the top node from the heap.
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.
virtual CbcTree * clone() const
Clone.
CbcTreeVariable & operator=(const CbcTreeVariable &rhs)
void reverseCut(int state, double bias=0.0)
Other side of last cut branch (if bias==rhs_ will be weakest possible)
virtual void endSearch()
We may have got an intelligent tree so give it one more chance.
void setRefine(bool yesNo)
virtual ~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)
void setMaxDiversification(int value)
void deleteCut(OsiRowCut &cut)
Delete last cut branch.
Using MS heap implementation.