Skip to main content

BranchingStrategy

Enum BranchingStrategy 

Source
#[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(&current_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§

Source§

impl<F: Debug> Debug for BranchingStrategy<F>

Source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more

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> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> IntoEither for T

Source§

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 more
Source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

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 more
Source§

impl<T> Pointable for T

Source§

const ALIGN: usize

The alignment of pointer.
Source§

type Init = T

The type for initializers.
Source§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
Source§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
Source§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
Source§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

impl<SS, SP> SupersetOf<SS> for SP
where SS: SubsetOf<SP>,

Source§

fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more
Source§

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

Use with care! Same as self.to_subset but without any property checks. Always succeeds.
Source§

fn from_subset(element: &SS) -> SP

The inclusion map: converts self to the equivalent element of its superset.
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
Source§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

Source§

fn vzip(self) -> V

Source§

impl<T> Ungil for T
where T: Send,