BBLeaf< Node, V > Struct Template Reference

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

#include <PBeFS/bnb/BranchAndBound.h>

Public Attributes
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

Detailed Description

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

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.

Member Data Documentation

bound

template<class Node, class V = double>

V bound

its bound

depth

template<class Node, class V = double>

unsigned depth = 0

its depth in the tree

kind

template<class Node, class V = double>

BBLeafKind kind = BBLeafKind::open

why it is a leaf

node

template<class Node, class V = double>

Node node

the node

---

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

• PBeFS/bnb/BranchAndBound.h