BBLeaf

Declared in bnb/BranchAndBound.h; the same struct on the site of Doxygen.

template<class Node, class V = double>
struct BBLeaf

a leaf of the tree explored, or a node to start a search from

The bound is in the sense of the problem: \( -\infty \) ( \( +\infty \) for a maximization) if none is known, \( +\infty \) ( \( -\infty \)) for an infeasible leaf. A pruned or open leaf may not have been evaluated, its bound being then that of its parent or its estimate.

Public Members

Node node

the node

V bound

its bound

unsigned depth = 0

its depth in the tree

BBLeafKind kind = BBLeafKind::open

why it is a leaf