Cbc  2.8.12
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Pages
Public Member Functions | List of all members
CbcTreeVariable Class Reference

#include <CbcTreeLocal.hpp>

+ Inheritance diagram for CbcTreeVariable:
+ Collaboration diagram for CbcTreeVariable:

Public Member Functions

 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)
 
CbcTreeVariableoperator= (const CbcTreeVariable &rhs)
 
virtual ~CbcTreeVariable ()
 
virtual CbcTreeclone () const
 Clone. More...
 
virtual void generateCpp (FILE *fp)
 Create C++ lines to get to current state. More...
 
Heap access and maintenance methods
virtual CbcNodetop () 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...
 
Other stuff
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)
 
- Public Member Functions inherited from CbcTree
 CbcTree ()
 Default Constructor. More...
 
 CbcTree (const CbcTree &rhs)
 Copy constructor. More...
 
CbcTreeoperator= (const CbcTree &rhs)
 = operator More...
 
virtual ~CbcTree ()
 Destructor. More...
 
void setComparison (CbcCompareBase &compare)
 Set comparison function and resort heap. More...
 
virtual CbcNodebestNode (double cutoff)
 Gets best node and takes off heap. More...
 
virtual void rebuild ()
 Rebuild the heap. More...
 
virtual int size () const
 Return size. More...
 
CbcNodeoperator[] (int i) const
 Return a node pointer. More...
 
CbcNodenodePointer (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...
 
CbcNodebestAlternate ()
 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...
 
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...
 

Additional Inherited Members

- Protected Attributes inherited from CbcTree
std::vector< CbcNode * > nodes_
 Storage vector for the heap. More...
 
CbcCompare comparison_
 Sort predicate for heap ordering. More...
 
int maximumNodeNumber_
 Maximum "node" number so far to split ties. More...
 
int numberBranching_
 Size of variable list. More...
 
int maximumBranching_
 Maximum size of variable list. More...
 
unsigned int * branched_
 Integer variables branched or bounded top bit set if new upper bound next bit set if a branch. More...
 
int * newBound_
 New bound. More...
 

Detailed Description

Definition at line 206 of file CbcTreeLocal.hpp.

Constructor & Destructor Documentation

CbcTreeVariable::CbcTreeVariable ( )
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::CbcTreeVariable ( const CbcTreeVariable rhs)
virtual CbcTreeVariable::~CbcTreeVariable ( )
virtual

Member Function Documentation

CbcTreeVariable& CbcTreeVariable::operator= ( const CbcTreeVariable rhs)
virtual CbcTree* CbcTreeVariable::clone ( ) const
virtual

Clone.

Reimplemented from CbcTree.

virtual void CbcTreeVariable::generateCpp ( FILE *  fp)
virtual

Create C++ lines to get to current state.

Reimplemented from CbcTree.

virtual CbcNode* CbcTreeVariable::top ( ) const
virtual

Return the top node of the heap.

Reimplemented from CbcTree.

virtual void CbcTreeVariable::push ( CbcNode x)
virtual

Add a node to the heap.

Reimplemented from CbcTree.

virtual void CbcTreeVariable::pop ( )
virtual

Remove the top node from the heap.

Reimplemented from CbcTree.

int CbcTreeVariable::createCut ( const double *  solution,
OsiRowCut &  cut 
)

Create cut - return -1 if bad, 0 if okay and 1 if cut is everything.

virtual bool CbcTreeVariable::empty ( )
virtual

Test if empty *** note may be overridden.

Reimplemented from CbcTree.

virtual void CbcTreeVariable::endSearch ( )
virtual

We may have got an intelligent tree so give it one more chance.

Reimplemented from CbcTree.

void CbcTreeVariable::reverseCut ( int  state,
double  bias = 0.0 
)

Other side of last cut branch (if bias==rhs_ will be weakest possible)

void CbcTreeVariable::deleteCut ( OsiRowCut &  cut)

Delete last cut branch.

void CbcTreeVariable::passInSolution ( const double *  solution,
double  solutionValue 
)

Pass in solution (so can be used after heuristic)

int CbcTreeVariable::range ( ) const
inline

Definition at line 273 of file CbcTreeLocal.hpp.

void CbcTreeVariable::setRange ( int  value)
inline

Definition at line 277 of file CbcTreeLocal.hpp.

int CbcTreeVariable::typeCuts ( ) const
inline

Definition at line 281 of file CbcTreeLocal.hpp.

void CbcTreeVariable::setTypeCuts ( int  value)
inline

Definition at line 285 of file CbcTreeLocal.hpp.

int CbcTreeVariable::maxDiversification ( ) const
inline

Definition at line 289 of file CbcTreeLocal.hpp.

void CbcTreeVariable::setMaxDiversification ( int  value)
inline

Definition at line 293 of file CbcTreeLocal.hpp.

int CbcTreeVariable::timeLimit ( ) const
inline

Definition at line 297 of file CbcTreeLocal.hpp.

void CbcTreeVariable::setTimeLimit ( int  value)
inline

Definition at line 301 of file CbcTreeLocal.hpp.

int CbcTreeVariable::nodeLimit ( ) const
inline

Definition at line 305 of file CbcTreeLocal.hpp.

void CbcTreeVariable::setNodeLimit ( int  value)
inline

Definition at line 309 of file CbcTreeLocal.hpp.

bool CbcTreeVariable::refine ( ) const
inline

Definition at line 313 of file CbcTreeLocal.hpp.

void CbcTreeVariable::setRefine ( bool  yesNo)
inline

Definition at line 317 of file CbcTreeLocal.hpp.


The documentation for this class was generated from the following file: