Module algebraic 

Algebraic problems.

Problems whose input is a matrix, linear system, or lattice:

• QUBO: Quadratic Unconstrained Binary Optimization
• ILP: Integer Linear Programming
• ClosestVectorProblem: Closest Vector Problem (minimize lattice distance)
• BMF: Boolean Matrix Factorization

Structs

BMF

The Boolean Matrix Factorization problem.

ClosestVectorProblem

Closest Vector Problem (CVP).

ILP

Integer Linear Programming (ILP) problem.

LinearConstraint

A linear constraint: sum of (coefficient * variable) {<=, >=, ==} rhs.

QUBO

The QUBO (Quadratic Unconstrained Binary Optimization) problem.

VarBounds

Variable bounds (None = unbounded in that direction).

Enums

Comparison

Comparison operator for linear constraints.

ObjectiveSense

Optimization direction for the ILP.

Traits

VariableDomain

Sealed trait for ILP variable domains.