#[non_exhaustive]pub enum BranchingStrategy<F = f64> {
MostFractional,
StrongBranching,
Cdcl(CdclBranchingState<F>),
}Expand description
Enumeration of branching strategies for use with MilpBranchAndBound.
This enum is intended to be incorporated into the MilpBranchAndBound
solver to switch between branching heuristics at runtime.
§Integration with MilpBranchAndBound
match strategy {
BranchingStrategy::MostFractional => { /* existing code */ }
BranchingStrategy::StrongBranching => { /* existing code */ }
BranchingStrategy::Cdcl(ref mut state) => {
let var = state.select_branching_var(lp_sol)?;
// ... branch on `var`, then:
if node_infeasible {
state.record_conflict(&decisions_on_path);
}
if state.apply_clauses(¤t_decisions) {
prune_node();
}
}
}Variants (Non-exhaustive)§
This enum is marked as non-exhaustive
Non-exhaustive enums could have additional variants added in future. Therefore, when matching against variants of non-exhaustive enums, an extra wildcard arm must be added to account for any future variants.
MostFractional
Most-fractional variable selection (standard heuristic).
StrongBranching
Strong branching: evaluate both child LP relaxations before committing.
Cdcl(CdclBranchingState<F>)
CDCL-style branching with clause learning and VSIDS activity.
Trait Implementations§
Auto Trait Implementations§
impl<F> Freeze for BranchingStrategy<F>
impl<F> RefUnwindSafe for BranchingStrategy<F>where
F: RefUnwindSafe,
impl<F> Send for BranchingStrategy<F>where
F: Send,
impl<F> Sync for BranchingStrategy<F>where
F: Sync,
impl<F> Unpin for BranchingStrategy<F>where
F: Unpin,
impl<F> UnsafeUnpin for BranchingStrategy<F>
impl<F> UnwindSafe for BranchingStrategy<F>where
F: UnwindSafe,
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.