Struct ConsecutiveBlockMinimization 

pub struct ConsecutiveBlockMinimization { /* private fields */ }

Consecutive Block Minimization (CBM) problem.

Given an m x n binary matrix A and a positive integer K, determine whether there exists a permutation of the columns of A such that the resulting matrix has at most K maximal blocks of consecutive 1-entries (summed over all rows).

Example

use problemreductions::models::algebraic::ConsecutiveBlockMinimization;
use problemreductions::{Problem, Solver, BruteForce};

// 2x3 binary matrix
let problem = ConsecutiveBlockMinimization::new(
    vec![
        vec![true, false, true],
        vec![false, true, true],
    ],
    2,
);

let solver = BruteForce::new();
let solutions = solver.find_all_witnesses(&problem);

// Verify solutions satisfy the block bound
for sol in solutions {
    assert!(problem.evaluate(&sol));
}

Implementations

impl ConsecutiveBlockMinimization

pub fn new(matrix: Vec<Vec<bool>>, bound: i64) -> Self

Create a new ConsecutiveBlockMinimization problem.

Arguments

• matrix - The m x n binary matrix
• bound - Upper bound on total consecutive blocks

Panics

Panics if rows have inconsistent lengths.

pub fn try_new(matrix: Vec<Vec<bool>>, bound: i64) -> Result<Self, String>

Create a new ConsecutiveBlockMinimization problem, returning an error instead of panicking when the matrix is ragged.

pub fn matrix(&self) -> &[Vec<bool>]

Get the binary matrix.

pub fn num_rows(&self) -> usize

Get the number of rows.

pub fn num_cols(&self) -> usize

Get the number of columns.

pub fn bound(&self) -> i64

Get the upper bound K.

pub fn count_consecutive_blocks(&self, config: &[usize]) -> Option<usize>

Count the total number of maximal consecutive blocks of 1s when columns are permuted according to config.

config[position] = column_index defines the column permutation. Returns Some(total_blocks) if the config is a valid permutation, or None if it is not (wrong length, duplicate columns, or out-of-range).

Trait Implementations

impl Clone for ConsecutiveBlockMinimization

fn clone(&self) -> ConsecutiveBlockMinimization

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for ConsecutiveBlockMinimization

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for ConsecutiveBlockMinimization

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Problem for ConsecutiveBlockMinimization

const NAME: &'static str = "ConsecutiveBlockMinimization"

Base name of this problem type (e.g., “MaximumIndependentSet”).

type Value = Or

The evaluation value type.

fn dims(&self) -> Vec<usize>

Configuration space dimensions. Each entry is the cardinality of that variable.

fn evaluate(&self, config: &[usize]) -> Or

Evaluate the problem on a configuration.

fn variant() -> Vec<(&'static str, &'static str)>

Returns variant attributes derived from type parameters.

fn num_variables(&self) -> usize

Number of variables (derived from dims).

fn problem_type() -> ProblemType

Look up this problem’s catalog entry.

impl ReduceTo<ILP> for ConsecutiveBlockMinimization

type Result = ReductionCBMToILP

The reduction result type.

fn reduce_to(&self) -> Self::Result

Reduce this problem to the target problem type.

impl Serialize for ConsecutiveBlockMinimization

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl DeclaredVariant for ConsecutiveBlockMinimization