A class from which the real tree nodes should be derived from. More...
#include <CoinSearchTree.hpp>
Public Member Functions | |
virtual | ~CoinTreeNode () |
int | getDepth () const |
int | getFractionality () const |
double | getQuality () const |
double | getTrueLB () const |
BitVector128 | getPreferred () const |
void | setDepth (int d) |
void | setFractionality (int f) |
void | setQuality (double q) |
void | setTrueLB (double tlb) |
void | setPreferred (BitVector128 p) |
Protected Member Functions | |
CoinTreeNode () | |
CoinTreeNode (int d, int f=-1, 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. More... | |
int | fractionality_ |
A measure of fractionality, e.g., the number of unsatisfied integrality requirements. More... | |
double | quality_ |
Some quality for the node. More... | |
double | true_lower_bound_ |
A true lower bound on the node. More... | |
BitVector128 | preferred_ |
A class from which the real tree nodes should be derived from.
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 42 of file CoinSearchTree.hpp.
|
inlineprotected |
Definition at line 44 of file CoinSearchTree.hpp.
|
inlineprotected |
Definition at line 50 of file CoinSearchTree.hpp.
|
inlineprotected |
Definition at line 60 of file CoinSearchTree.hpp.
|
inlinevirtual |
Definition at line 93 of file CoinSearchTree.hpp.
|
inlineprotected |
Definition at line 66 of file CoinSearchTree.hpp.
|
inline |
Definition at line 95 of file CoinSearchTree.hpp.
|
inline |
Definition at line 96 of file CoinSearchTree.hpp.
|
inline |
Definition at line 97 of file CoinSearchTree.hpp.
|
inline |
Definition at line 98 of file CoinSearchTree.hpp.
|
inline |
Definition at line 99 of file CoinSearchTree.hpp.
|
inline |
Definition at line 101 of file CoinSearchTree.hpp.
|
inline |
Definition at line 102 of file CoinSearchTree.hpp.
|
inline |
Definition at line 103 of file CoinSearchTree.hpp.
|
inline |
Definition at line 104 of file CoinSearchTree.hpp.
|
inline |
Definition at line 105 of file CoinSearchTree.hpp.
|
private |
The depth of the node in the tree.
Definition at line 78 of file CoinSearchTree.hpp.
|
private |
A measure of fractionality, e.g., the number of unsatisfied integrality requirements.
Definition at line 81 of file CoinSearchTree.hpp.
|
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 85 of file CoinSearchTree.hpp.
|
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 89 of file CoinSearchTree.hpp.
|
private |
Definition at line 91 of file CoinSearchTree.hpp.