BasicParallelBBOptions

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

inheritance diagram of BasicParallelBBOptions

template<class V = double>
struct BasicParallelBBOptions : public BasicBBOptions<double>, public ParallelParams

the options of the parallel B&B with values of type V

Those of the sequential search, and the parameters of the parallel ones [see ParallelParams], with batches of 16 nodes flushed at every evaluation, since an evaluation is usually “expensive”; node_limit bounds the evaluations of all the workers together, batch is used by the searches that send nodes (the distributed, the farm and the MPI ones), flush_period by the distributed and the MPI ones, and seed gives the owners of the nodes when the problem gives no hash( n ), while round is used by the deterministic search only and split by the SelfSplit one.

Public Functions

inline BasicParallelBBOptions(void)

Public Members

std::size_t round = 0

the nodes evaluated at each round of the deterministic search, 0 for one per worker [see DeterministicBranchAndBound]

std::size_t split = 0

the open nodes per worker at which the sampling of the SelfSplit search stops, 0 for 4 [see SelfSplitBranchAndBound]

bool split_dive = true

true if the sampling of the SelfSplit search ends with a dive from its first open node to a leaf, whose incumbent the workers start from [see SelfSplitBranchAndBound]

bool split_shared = false

true if the workers of the SelfSplit search share their incumbent, which prunes more but makes the nodes evaluated depend on the timing [see SelfSplitBranchAndBound]