bnb.h

Header of the layer bnb, in the group Headers of the layer; the same header on the site of Doxygen, its source on GitHub.

Description of the header

Header file that includes the tree searches of PBeFS, i.e., the best-first searches with an incumbent (Branch-and-Bound) of a problem satisfying the concept BranchAndBound, save the one that needs MPI, MPIBranchAndBound.h.

They are the sequential BranchAndBoundSearch [see BranchAndBound.h], SharedBranchAndBound and DistributedBranchAndBound on an executor of ADS [see ParallelBranchAndBound.h], FarmBranchAndBound, master-worker on a farm with feedback [see FarmBranchAndBound.h], DeterministicBranchAndBound, by synchronous rounds whose outcome does not depend on the timing of the workers [see DeterministicBranchAndBound.h], SelfSplitBranchAndBound, whose workers search apart the subtrees of a first sampling of the tree [see SelfSplitBranchAndBound.h], and StealingBranchAndBound, whose workers keep their children and steal a node when they have none [see StealingBranchAndBound.h], and MultiQueueBranchAndBound, whose workers share the nodes in the MultiQueue of ADS [see MultiQueueBranchAndBound.h], all of which can also be chosen by a value [see BranchAndBoundScheme.h]. Knapsack is a 0-1 knapsack problem to try them on [see Knapsack.h].

Author

Donato Meoli

Dipartimento di Informatica

Università di Pisa

Copyright

© by Donato Meoli