bnb/BranchAndBound.h

Best-first search with an incumbent, i.e., for Branch-and-Bound (B&B): the concept BranchAndBound of a problem, its options and its Solution, the queue of the open nodes, and the sequential search BranchAndBoundSearch. More...

Files
file	BranchAndBound.h
	Header file for the best-first search with an incumbent, i.e., for Branch-and-Bound (B&B): the concept BranchAndBound of a problem, its options and its Solution, the queue of the open nodes, and the sequential search BranchAndBoundSearch.

Concepts
concept	PBeFS_di_unipi_it::BBValue
	a type of values of a B&B: signed, totally ordered, made from an int, and with its BBValueTraits
concept	PBeFS_di_unipi_it::BBEvaluator
	what evaluates and branches the nodes of a B&B
concept	PBeFS_di_unipi_it::BranchAndBound
	a B&B problem
concept	PBeFS_di_unipi_it::HashedBranchAndBound
	a B&B problem that gives a hash of its nodes
concept	PBeFS_di_unipi_it::EstimatingBranchAndBound
	a B&B problem that estimates the best feasible value under a node

Classes
struct	BasicEvaluation< V >
	the outcome of the evaluation of a node, with values of type V More...
struct	BBLeaf< Node, V >
	a leaf of the tree explored, or a node to start a search from More...
struct	BBValueTraits< V >
	what the B&B needs to know of the type V of its values More...
struct	BasicBBOptions< V >
	the options of a B&B with values of type V More...
struct	BBStats
	the counters of a B&B More...
struct	BBSolution< Node, V >
	the outcome of a B&B More...
class	BBQueue< Node, V >
	the open nodes of a B&B, ordered by a key More...
class	BranchAndBoundSearch< P >
	the sequential best-first search with an incumbent More...

Detailed Description

Best-first search with an incumbent, i.e., for Branch-and-Bound (B&B): the concept BranchAndBound of a problem, its options and its Solution, the queue of the open nodes, and the sequential search BranchAndBoundSearch.