Expand description
Algebraic problems.
Problems whose input is a matrix, linear system, or lattice:
AlgebraicEquationsOverGF2: Multilinear polynomial equations over GF(2)QUBO: Quadratic Unconstrained Binary OptimizationILP: Integer Linear ProgrammingClosestVectorProblem: Closest Vector Problem (minimize lattice distance)BMF: Boolean Matrix FactorizationConsecutiveBlockMinimization: Consecutive Block MinimizationConsecutiveOnesSubmatrix: Consecutive Ones Submatrix (column selection with C1P)EquilibriumPoint: Pure-strategy Nash Equilibrium existenceQuadraticAssignment: Quadratic Assignment ProblemQuadraticCongruences: Decide x² ≡ a (mod b) for x in {1, …, c-1}QuadraticDiophantineEquations: Decide ax² + by = c in positive integersSimultaneousIncongruences: Decide whether x ≢ aᵢ (mod bᵢ) for all i simultaneouslyMinimumMatrixDomination: Minimum Matrix Domination (minimum dominating set of 1-entries)MinimumWeightDecoding: Minimum Weight Decoding (minimize Hamming weight of Hx≡s mod 2)MinimumWeightSolutionToLinearEquations: Minimum Weight Solution to Linear Equations (minimize Hamming weight of Ay=b solution)SparseMatrixCompression: Sparse Matrix Compression by row overlay
Structs§
- Algebraic
Equations OverG F2 - Algebraic Equations over GF(2).
- BMF
- The Boolean Matrix Factorization problem.
- Closest
Vector Problem - Closest Vector Problem (CVP).
- Consecutive
Block Minimization - Consecutive Block Minimization (CBM) problem.
- Consecutive
Ones Matrix Augmentation - Consecutive
Ones Submatrix - The Consecutive Ones Submatrix problem.
- Equilibrium
Point - Equilibrium Point problem.
- Feasible
Basis Extension - The Feasible Basis Extension problem.
- ILP
- Integer Linear Programming (ILP) problem.
- Linear
Constraint - A linear constraint: sum of (coefficient * variable) {<=, >=, ==} rhs.
- Minimum
Matrix Cover - Minimum Matrix Cover.
- Minimum
Matrix Domination - Minimum Matrix Domination.
- Minimum
Weight Decoding - Minimum Weight Decoding.
- Minimum
Weight Solution ToLinear Equations - Minimum Weight Solution to Linear Equations.
- QUBO
- The QUBO (Quadratic Unconstrained Binary Optimization) problem.
- Quadratic
Assignment - The Quadratic Assignment Problem (QAP).
- Quadratic
Congruences - Quadratic Congruences problem.
- Quadratic
Diophantine Equations - Quadratic Diophantine Equations problem.
- Simultaneous
Incongruences - Simultaneous Incongruences problem.
- Sparse
Matrix Compression - Sparse Matrix Compression.
- VarBounds
- Variable bounds (None = unbounded in that direction).
Enums§
- Comparison
- Comparison operator for linear constraints.
- Objective
Sense - Optimization direction for the ILP.
Traits§
- Variable
Domain - Sealed trait for ILP variable domains.