ddo 2.0.0

DDO a generic and efficient framework for MDD-based optimization.
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
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81

use std::{time::{Duration, Instant}, fs::File};

use clap::Parser;
use ddo::*;

use crate::{graph::Graph, model::{Mcp, McpRanking}, relax::McpRelax};

mod graph;
mod model;
mod relax;
#[cfg(test)]
mod tests;

/// Solve max2sat instance
#[derive(Debug, Parser)]
#[command(author, version, about, long_about = None)]
struct Params {
    /// the instance file
    #[arg(short, long)]
    file: String,
    /// maximum width in a layer
    #[arg(short, long)]
    width: Option<usize>,
    /// max time to find the solution
    #[arg(short, long)]
    timeout: Option<u64>,
}

fn main() {
    let Params{file, width, timeout} = Params::parse();
    let graph = Graph::from(File::open(file).expect("could not open file"));
    let problem = Mcp::from(graph);
    let relax = McpRelax::new(&problem);
    let rank = McpRanking;
    let width = max_width(&problem, width);
    let dominance = EmptyDominanceChecker::default();
    let cutoff = cutoff(timeout);
    let mut fringe = NoDupFringe::new(MaxUB::new(&rank));

    let mut solver = DefaultSolver::new(
        &problem, 
        &relax, 
        &rank, 
        width.as_ref(), 
        &dominance,
        cutoff.as_ref(), 
        &mut fringe,
    );

        let start = Instant::now();
        let Completion{ is_exact, best_value } = solver.maximize();
        
        let duration = start.elapsed();
        let upper_bound = solver.best_upper_bound();
        let lower_bound = solver.best_lower_bound();
        let gap = solver.gap();
        let best_solution  = solver.best_solution();
    
        println!("Duration:   {:.3} seconds", duration.as_secs_f32());
        println!("Objective:  {}",            best_value.unwrap_or(-1));
        println!("Upper Bnd:  {}",            upper_bound);
        println!("Lower Bnd:  {}",            lower_bound);
        println!("Gap:        {:.3}",         gap);
        println!("Aborted:    {}",            !is_exact);
        println!("Solution:   {:?}",          best_solution.unwrap_or_default());
}

fn cutoff(timeout: Option<u64>) -> Box<dyn Cutoff + Send + Sync> {
    if let Some(t) = timeout {
        Box::new(TimeBudget::new(Duration::from_secs(t)))
    } else {
        Box::new(NoCutoff)
    }
}
fn max_width<P: Problem>(p: &P, w: Option<usize>) -> Box<dyn WidthHeuristic<P::State> + Send + Sync> {
    if let Some(w) = w {
        Box::new(FixedWidth(w))
    } else {
        Box::new(NbUnassignedWidth(p.nb_variables()))
    }
}