Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
Loading...
Searching...
No Matches
Aleph::BranchAndBoundObjectivePolicy Concept Reference

Concept for objective policies used by branch and bound. More...

#include <Branch_And_Bound.H>

Concept definition

template<typename Policy, typename Value>
concept Aleph::BranchAndBoundObjectivePolicy = requires(const Policy &policy, const Value &a, const Value &b) {
{ policy.better(a, b) } -> std::convertible_to<bool>;
{ policy.can_improve(a, b) } -> std::convertible_to<bool>;
{ policy.more_promising(a, b) } -> std::convertible_to<bool>;
}
Aleph::BranchAndBoundObjectivePolicy
Concept for objective policies used by branch and bound.
Definition Branch_And_Bound.H:116
Aleph::divide_and_conquer_partition_dp
Divide_Conquer_DP_Result< Cost > divide_and_conquer_partition_dp(const size_t groups, const size_t n, Transition_Cost_Fn transition_cost, const Cost inf=dp_optimization_detail::default_inf< Cost >())
Optimize partition DP using divide-and-conquer optimization.
Definition DP_Optimizations.H:133

Detailed Description

Concept for objective policies used by branch and bound.

Definition at line 115 of file Branch_And_Bound.H.