30 #if defined(_MSC_VER) || defined(__MNO_CYGWIN)
33 #if 1 //ndef CBC_DUBIOUS_HEAP
104 virtual bool empty();
108 virtual int size()
const {
return static_cast< int >(
nodes_.size()); }
129 virtual void cleanTree(
CbcModel *model,
double cutoff,
double &bestPossibleObjective);
181 const double *currentLower,
182 const double *currentUpper);
187 #if CBC_DEBUG_HEAP > 0
221 #ifdef JJF_ZERO // not used
226 class CbcTreeArray :
public CbcTree {
233 CbcTreeArray(
const CbcTreeArray &rhs);
235 CbcTreeArray &
operator=(
const CbcTreeArray &rhs);
237 virtual ~CbcTreeArray();
261 virtual bool empty();
305 CbcNewTree(
const CbcNewTree &rhs);
307 CbcNewTree &
operator=(
const CbcNewTree &rhs);
309 virtual ~CbcNewTree();
312 virtual CbcNewTree *
clone()
const;
338 virtual bool empty();
341 inline int size()
const
343 return nodes_.size();
431 inline int size()
const
448 virtual bool empty();
484 std::vector< CbcNode * >
nodes_;
virtual bool empty()
Test for an empty tree.
int * newBound_
New bound.
int getNumberBranching() const
Get number of branches.
CbcNode * bestAlternate()
Get best on list using alternate method.
std::vector< CbcNode * > nodes_
Storage vector for the heap.
double lastObjective_
Objective of last node pushed on tree.
virtual int size() const
Return size.
CbcTree()
Default Constructor.
virtual void push(CbcNode *x)
Add a node to the heap.
double lastObjective() const
Last objective in branch-and-cut search tree.
int maximumBranching_
Maximum size of variable list.
void fixTop()
After changing data in the top node, fix the heap.
void realpush(CbcNode *node)
unsigned int * branched_
Integer variables branched or bounded top bit set if new upper bound next bit set if a branch...
void setNumberBranching(int value)
Set number of branches.
void increaseSpace()
Increase space for data.
CbcTree & operator=(const CbcTree &rhs)
= operator
virtual void rebuild()
Rebuild the heap.
int maximumNodeNumber_
Maximum "node" number so far to split ties.
virtual CbcNode * bestNode(double cutoff)
Gets best node and takes off heap.
int lastDepth_
Depth of last node pushed on tree.
CbcNode * nodePointer(int i) const
Return a node pointer.
CbcNode * operator[](int i) const
Return a node pointer.
Using MS heap implementation.
virtual CbcTree * clone() const
Clone.
virtual void endSearch()
We may have got an intelligent tree so give it one more chance.
virtual void pop()
Remove the top node from the heap.
int lastUnsatisfied_
Number unsatisfied of last node pushed on tree.
int lastUnsatisfied() const
Last number of objects unsatisfied.
virtual CbcNode * top() const
Return the top node of the heap.
Information required while the node is live.
int getMaximumBranching() const
Get maximum branches.
virtual void cleanTree(CbcModel *model, double cutoff, double &bestPossibleObjective)
Prune the tree using an objective function cutoff.
void addBranchingInformation(const CbcModel *model, const CbcNodeInfo *nodeInfo, const double *currentLower, const double *currentUpper)
Adds branching information to complete state.
virtual void generateCpp(FILE *)
Create C++ lines to get to current state.
Information required to recreate the subproblem at this node.
void resetNodeNumbers()
Reset maximum node number.
int numberBranching_
Size of variable list.
CbcCompare comparison_
Sort predicate for heap ordering.
virtual ~CbcTree()
Destructor.
unsigned int * branched() const
Get branched variables.
void setComparison(CbcCompareBase &compare)
Set comparison function and resort heap.
int * newBounds() const
Get bounds.
int maximumNodeNumber() const
Get maximum node number.
virtual double getBestPossibleObjective()
Get best possible objective function in the tree.
Simple Branch and bound class.
void setMaximumBranching(int value)
Set maximum branches.
int lastDepth() const
Last depth in branch-and-cut search tree.