Searches

Topics
	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.
	bnb/ParallelBranchAndBound.h
	Parallel best-first searches with an incumbent, i.e., the parallel Branch-and-Bound (B&B) on an executor of ADS (the pool of C++ threads, OpenMP or FastFlow): SharedBranchAndBound, whose workers extract the nodes from one queue as the workers of SPA* do, and DistributedBranchAndBound, whose workers have a queue each and send the children to their owners as the workers of HDA* do.
	bnb/DeterministicBranchAndBound.h
	The parallel B&B by synchronous rounds.
	bnb/StealingBranchAndBound.h
	The parallel B&B by work stealing.
	bnb/MultiQueueBranchAndBound.h
	The parallel B&B on the MultiQueue of ADS.
	bnb/SelfSplitBranchAndBound.h
	The parallel B&B by a split of the tree after a sampling.
	bnb/FarmBranchAndBound.h
	The master-worker B&B on a farm with feedback.
	bnb/MPIBranchAndBound.h
	MPIBranchAndBound, the distributed Branch-and-Bound (B&B) with one MPI process per worker: each process has a queue of open nodes and sends the children to their owners, as DistributedBranchAndBound does with threads [see ParallelBranchAndBound.h] and HDAStarMPI with the states of A* [see HDAStarMPI.h].

Detailed Description