PBeFS
Parallel Best-First Search
Loading...
Searching...
No Matches
PBeFS_di_unipi_it::EstimatingBranchAndBound Concept Reference

a B&B problem that estimates the best feasible value under a node More...

#include <PBeFS/bnb/BranchAndBound.h>

Concept definition

template<class P>
requires( const P & p , const typename P::node_type & n ) {
{ p.estimate( n ) } -> std::convertible_to< bb_value_t< P > >;
}
a B&B problem
Definition BranchAndBound.h:337
a B&B problem that estimates the best feasible value under a node
Definition BranchAndBound.h:362

Detailed Description

a B&B problem that estimates the best feasible value under a node