algos 0.6.8

A collection of algorithms in Rust
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50

use std::error::Error;

pub mod benders;
pub mod branch_and_bound;
pub mod branch_and_cut;
pub mod branch_and_price;
pub mod branch_and_reduce;
pub mod column_generation;
pub mod dantzig_wolfe;
pub mod gomory;
pub mod lift_and_project;
pub mod mixed_integer_rounding;

#[derive(Debug, Clone)]
pub struct IntegerLinearProgram {
    pub objective: Vec<f64>,
    pub constraints: Vec<Vec<f64>>,
    pub bounds: Vec<f64>,
    pub integer_vars: Vec<usize>,
}

#[derive(Debug, Clone)]
pub struct ILPSolution {
    pub values: Vec<f64>,
    pub objective_value: f64,
    pub status: ILPStatus,
}

#[derive(Debug, Clone, PartialEq)]
pub enum ILPStatus {
    Optimal,
    Infeasible,
    Unbounded,
    MaxIterationsReached,
}

pub trait ILPSolver {
    fn solve(&self, problem: &IntegerLinearProgram) -> Result<ILPSolution, Box<dyn Error>>;
}

pub use benders::BendersDecomposition;
pub use branch_and_bound::BranchAndBoundSolver;
pub use branch_and_cut::BranchAndCutSolver;
pub use branch_and_price::BranchAndPriceSolver;
pub use branch_and_reduce::BranchAndReduceSolver;
pub use column_generation::ColumnGenerationSolver;
pub use dantzig_wolfe::DantzigWolfeDecomposition;
pub use gomory::GomoryCuttingPlanes;
pub use lift_and_project::LiftAndProjectCuts;
pub use mixed_integer_rounding::MixedIntegerRoundingCuts;