Skip to main content

MipStats

otspot_core::mip

Struct MipStats 

Source 
pub struct MipStats {
Show 14 fields
    pub nodes_processed: usize,
    pub max_depth_seen: usize,
    pub pruned: usize,
    pub incumbent_updates: usize,
    pub relaxation_time_total_ms: f64,
    pub relaxation_time_root_ms: f64,
    pub relaxation_time_desc_ms: f64,
    pub relaxation_time_optimal_ms: f64,
    pub relaxation_time_infeasible_ms: f64,
    pub lp_presolve_us_total: u64,
    pub lp_solve_us_total: u64,
    pub lp_postsolve_us_total: u64,
    pub approx_bounds_bytes_per_node: usize,
    pub fp_incumbent_found: bool,

}
Expand description

Search statistics returned by solve_milp_with_stats / solve_miqp_with_stats.

Counters and timings instrument the branch-and-bound driver without changing its behaviour. The timing fields help separate exploration explosion (many nodes) from per-node cost (slow relaxation solves).

Fields§

§nodes_processed: usize

Relaxation solves performed (root included).

§max_depth_seen: usize

Maximum branching depth reached.

§pruned: usize

Nodes discarded by bound/infeasibility before branching.

§incumbent_updates: usize

Number of incumbent improvements (including the first one found).

§relaxation_time_total_ms: f64

Total wall time spent inside relaxation solves across all nodes (ms).

§relaxation_time_root_ms: f64

Wall time for the root node relaxation solve (ms).

§relaxation_time_desc_ms: f64

Cumulative wall time for all descendant (non-root) relaxation solves (ms).

§relaxation_time_optimal_ms: f64

Cumulative time in solves that returned Optimal (ms).

§relaxation_time_infeasible_ms: f64

Cumulative time in solves that returned Infeasible (ms).

§lp_presolve_us_total: u64

Cumulative LP presolve microseconds across all nodes (zero when presolve does not reduce).

§lp_solve_us_total: u64

Cumulative LP solve (simplex) microseconds across all nodes.

§lp_postsolve_us_total: u64

Cumulative LP postsolve microseconds across all nodes.

§approx_bounds_bytes_per_node: usize

Approximate bytes per node for the bounds clone: n_vars × 2 × size_of::<f64>(). Gives a rough idea of per-node memory traffic regardless of node count.

§fp_incumbent_found: bool

Whether the feasibility pump found an initial incumbent before branch-and-bound.

Trait Implementations§

Source§

impl Clone for MipStats

Source§

fn clone(&self) -> MipStats

Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§

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

Performs copy-assignment from source. Read more
Source§

impl Copy for MipStats

Source§

impl Debug for MipStats

Source§

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

Formats the value using the given formatter. Read more
Source§

impl Default for MipStats

Source§

fn default() -> MipStats

Returns the “default value” for a type. Read more

Auto Trait Implementations§

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> ByRef<T> for T

Source§

fn by_ref(&self) -> &T

Source§

impl<T> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. Read more
Source§

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

Source§

fn rand<T>(&self, rng: &mut (impl Rng + ?Sized)) -> T
where Self: Distribution<T>,

Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Imply<T> for U
where T: ?Sized, U: ?Sized,

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> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
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