Enum DivConAnchor

pub enum DivConAnchor {
    LinSu,
    BiOptSat,
    PMinimal(SubProblemSize),
    LowerBounding(SubProblemSize),
    NMinus(usize),
}

Possible recursion anchors for the divide and conquer algorithm

Variants

LinSu

Linear Sat-Unsat for single-objective subproblems

BiOptSat

BiOptSat (Sat-Unsat) for bi-objective subproblems

PMinimal(SubProblemSize)

P-Minimal at subproblems of given size

LowerBounding(SubProblemSize)

Run lower-bounding algorithm at subproblems of given size

NMinus(usize)

Run the appropriate anchor (Linear Sat-Unsat / BiOptSat / P-Minimal) at subproblems of size n-x.

Trait Implementations

impl Clone for DivConAnchor

fn clone(&self) -> DivConAnchor

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for DivConAnchor

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

Formats the value using the given formatter.

impl Default for DivConAnchor

fn default() -> DivConAnchor

Returns the “default value” for a type.

impl Display for DivConAnchor

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

Formats the value using the given formatter.

impl PartialEq for DivConAnchor

fn eq(&self, other: &DivConAnchor) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Copy for DivConAnchor

impl Eq for DivConAnchor

impl StructuralPartialEq for DivConAnchor