#include <CoinSearchTree.hpp>
Collaboration diagram for CoinTreeNode:
Public Member Functions | |
virtual | ~CoinTreeNode () |
A measure of fractionality, e.g., the fraction of unsatisfied integrality requirements. | |
int | getDepth () const |
double | getQuality () const |
double | getTrueLB () const |
BitVector128 | getPreferred () const |
void | setDepth (int d) |
void | setQuality (double q) |
void | setTrueLB (double tlb) |
void | setPreferred (BitVector128 p) |
Protected Member Functions | |
CoinTreeNode () | |
CoinTreeNode (int d, double q=-COIN_DBL_MAX, double tlb=-COIN_DBL_MAX, BitVector128 p=BitVector128()) | |
CoinTreeNode (const CoinTreeNode &x) | |
CoinTreeNode & | operator= (const CoinTreeNode &x) |
Private Attributes | |
int | depth_ |
The depth of the node in the tree. | |
double | quality_ |
Some quality for the node. | |
double | true_lower_bound_ |
A true lower bound on the node. | |
BitVector128 | preferred_ |
Some of the data that undoubtedly exist in the real tree node is replicated here for fast access. This class is used in the various comparison functions.
Definition at line 35 of file CoinSearchTree.hpp.
CoinTreeNode::CoinTreeNode | ( | ) | [inline, protected] |
Definition at line 37 of file CoinSearchTree.hpp.
CoinTreeNode::CoinTreeNode | ( | int | d, | |
double | q = -COIN_DBL_MAX , |
|||
double | tlb = -COIN_DBL_MAX , |
|||
BitVector128 | p = BitVector128() | |||
) | [inline, protected] |
Definition at line 42 of file CoinSearchTree.hpp.
CoinTreeNode::CoinTreeNode | ( | const CoinTreeNode & | x | ) | [inline, protected] |
Definition at line 50 of file CoinSearchTree.hpp.
virtual CoinTreeNode::~CoinTreeNode | ( | ) | [inline, virtual] |
A measure of fractionality, e.g., the fraction of unsatisfied integrality requirements.
Definition at line 80 of file CoinSearchTree.hpp.
CoinTreeNode& CoinTreeNode::operator= | ( | const CoinTreeNode & | x | ) | [inline, protected] |
Definition at line 55 of file CoinSearchTree.hpp.
References depth_, preferred_, quality_, and true_lower_bound_.
int CoinTreeNode::getDepth | ( | ) | const [inline] |
Definition at line 82 of file CoinSearchTree.hpp.
References depth_.
Referenced by CoinSearchTreeCompareBreadth::operator()(), and CoinSearchTreeCompareDepth::operator()().
double CoinTreeNode::getQuality | ( | ) | const [inline] |
Definition at line 83 of file CoinSearchTree.hpp.
References quality_.
Referenced by CoinSearchTreeManager::bestQuality(), CoinSearchTreeCompareBest::operator()(), CoinSearchTreeCompareDepth::operator()(), and CoinSearchTreeComparePreferred::operator()().
double CoinTreeNode::getTrueLB | ( | ) | const [inline] |
BitVector128 CoinTreeNode::getPreferred | ( | ) | const [inline] |
Definition at line 85 of file CoinSearchTree.hpp.
References preferred_.
Referenced by CoinSearchTreeComparePreferred::operator()().
void CoinTreeNode::setDepth | ( | int | d | ) | [inline] |
void CoinTreeNode::setQuality | ( | double | q | ) | [inline] |
void CoinTreeNode::setTrueLB | ( | double | tlb | ) | [inline] |
void CoinTreeNode::setPreferred | ( | BitVector128 | p | ) | [inline] |
int CoinTreeNode::depth_ [private] |
The depth of the node in the tree.
Definition at line 65 of file CoinSearchTree.hpp.
Referenced by getDepth(), operator=(), and setDepth().
double CoinTreeNode::quality_ [private] |
Some quality for the node.
For normal branch-and-cut problems the LP relaxation value will do just fine. It is probably an OK approximation even if column generation is done.
Definition at line 69 of file CoinSearchTree.hpp.
Referenced by getQuality(), operator=(), and setQuality().
double CoinTreeNode::true_lower_bound_ [private] |
A true lower bound on the node.
May be -infinity. For normal branch-and-cut problems the LP relaxation value is OK. It is different when column generation is done.
Definition at line 73 of file CoinSearchTree.hpp.
Referenced by getTrueLB(), operator=(), and setTrueLB().
BitVector128 CoinTreeNode::preferred_ [private] |
Definition at line 75 of file CoinSearchTree.hpp.
Referenced by getPreferred(), operator=(), and setPreferred().