Struct ILP 

pub struct ILP<V: VariableDomain = bool> {
    pub num_vars: usize,
    pub constraints: Vec<LinearConstraint>,
    pub objective: Vec<(usize, f64)>,
    pub sense: ObjectiveSense,
    /* private fields */
}

Integer Linear Programming (ILP) problem.

An ILP consists of:

• A set of integer variables with a domain determined by V
• Linear constraints on those variables
• A linear objective function to optimize
• An optimization sense (maximize or minimize)

Type Parameter

• V = bool: binary variables (0 or 1)
• V = i32: non-negative integer variables

Example

use problemreductions::models::algebraic::{ILP, LinearConstraint, ObjectiveSense};
use problemreductions::Problem;

// Create a simple binary ILP: maximize x0 + 2*x1
// subject to: x0 + x1 <= 3, x0, x1 binary
let ilp = ILP::<bool>::new(
    2,
    vec![LinearConstraint::le(vec![(0, 1.0), (1, 1.0)], 3.0)],
    vec![(0, 1.0), (1, 2.0)],
    ObjectiveSense::Maximize,
);

assert_eq!(ilp.num_variables(), 2);

Fields

num_vars: usize

Number of variables.

constraints: Vec<LinearConstraint>

Linear constraints.

objective: Vec<(usize, f64)>

Sparse objective coefficients: (var_index, coefficient).

sense: ObjectiveSense

Optimization direction.

Implementations

impl<V: VariableDomain> ILP<V>

pub fn new( num_vars: usize, constraints: Vec<LinearConstraint>, objective: Vec<(usize, f64)>, sense: ObjectiveSense, ) -> Self

Create a new ILP problem.

pub fn empty() -> Self

Create an empty ILP with no variables.

pub fn evaluate_objective(&self, values: &[i64]) -> f64

Evaluate the objective function for given variable values.

pub fn constraints_satisfied(&self, values: &[i64]) -> bool

Check if all constraints are satisfied for given variable values.

pub fn is_feasible(&self, values: &[i64]) -> bool

Check if a solution is feasible (satisfies constraints).

pub fn num_variables(&self) -> usize

Get the number of variables.

pub fn num_vars(&self) -> usize

Get the number of variables.

pub fn num_constraints(&self) -> usize

Get the number of constraints.

Trait Implementations

impl<V: Clone + VariableDomain> Clone for ILP<V>

fn clone(&self) -> ILP<V>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<V: Debug + VariableDomain> Debug for ILP<V>

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

Formats the value using the given formatter.

impl<'de, V: VariableDomain> Deserialize<'de> for ILP<V>

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<V: VariableDomain> OptimizationProblem for ILP<V>

type Value = f64

The inner objective value type (e.g., i32, f64).

fn direction(&self) -> Direction

Whether to maximize or minimize the metric.

impl<V: VariableDomain> Problem for ILP<V>

const NAME: &'static str = "ILP"

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

type Metric = SolutionSize<f64>

The evaluation metric type.

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

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

fn evaluate(&self, config: &[usize]) -> SolutionSize<f64>

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).

impl ReduceTo<ILP<i32>> for Factoring

type Result = ReductionFactoringToILP

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<ILP<i32>> for ILP<bool>

type Result = ReductionBinaryILPToIntILP

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<ILP> for BinPacking<i32>

type Result = ReductionBPToILP

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<ILP> for CircuitSAT

type Result = ReductionCircuitToILP

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<ILP> for KColoring<K1, SimpleGraph>

type Result = ReductionKColoringToILP<K1, SimpleGraph>

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<ILP> for KColoring<K2, SimpleGraph>

type Result = ReductionKColoringToILP<K2, SimpleGraph>

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<ILP> for KColoring<K3, SimpleGraph>

type Result = ReductionKColoringToILP<K3, SimpleGraph>

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<ILP> for KColoring<K4, SimpleGraph>

type Result = ReductionKColoringToILP<K4, SimpleGraph>

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<ILP> for KColoring<KN, SimpleGraph>

type Result = ReductionKColoringToILP<KN, SimpleGraph>

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<ILP> for MaximumClique<SimpleGraph, i32>

type Result = ReductionCliqueToILP

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<ILP> for MaximumMatching<SimpleGraph, i32>

type Result = ReductionMatchingToILP

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<ILP> for MaximumSetPacking<i32>

type Result = ReductionSPToILP

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<ILP> for MinimumDominatingSet<SimpleGraph, i32>

type Result = ReductionDSToILP

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<ILP> for MinimumSetCovering<i32>

type Result = ReductionSCToILP

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<ILP> for QUBO<f64>

type Result = ReductionQUBOToILP

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<ILP> for TravelingSalesman<SimpleGraph, i32>

type Result = ReductionTSPToILP

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<QUBO> for ILP<bool>

type Result = ReductionILPToQUBO

The reduction result type.

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

Reduce this problem to the target problem type.

impl<V: VariableDomain> Serialize for ILP<V>

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 ILP<bool>

impl DeclaredVariant for ILP<i32>