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> Problem for ILP<V>

const NAME: &'static str = "ILP"

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

type Value = Extremum<f64>

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

fn problem_type() -> ProblemType

Look up this problem’s catalog entry.

impl ReduceTo<ILP<i32>> for AcyclicPartition<i32>

type Result = ReductionAcyclicPartitionToILP

The reduction result type.

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

Reduce this problem to the target problem type.

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

type Result = ReductionBiconnAugToILP

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<ILP<i32>> for BottleneckTravelingSalesman

type Result = ReductionBTSPToILP

The reduction result type.

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

Reduce this problem to the target problem type.

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

type Result = ReductionBCSFToILP

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<ILP<i32>> for DirectedTwoCommodityIntegralFlow

type Result = ReductionD2CIFToILP

The reduction result type.

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

Reduce this problem to the target problem type.

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 FeasibleRegisterAssignment

type Result = ReductionFeasibleRegisterAssignmentToILP

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<ILP<i32>> for FlowShopScheduling

type Result = ReductionFSSToILP

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<i32>> for IntegerKnapsack

type Result = ReductionIntegerKnapsackToILP

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<ILP<i32>> for IntegralFlowBundles

type Result = ReductionIFBToILP

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<ILP<i32>> for IntegralFlowHomologousArcs

type Result = ReductionIFHAToILP

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<ILP<i32>> for IntegralFlowWithMultipliers

type Result = ReductionIFWMToILP

The reduction result type.

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

Reduce this problem to the target problem type.

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

type Result = ReductionLongestPathToILP

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<ILP<i32>> for MaximumLeafSpanningTree<SimpleGraph>

type Result = ReductionMaximumLeafSpanningTreeToILP

The reduction result type.

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

Reduce this problem to the target problem type.

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

type Result = ReductionMMCToILP

The reduction result type.

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

Reduce this problem to the target problem type.

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

type Result = ReductionMinimumCapacitatedSpanningTreeToILP

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<ILP<i32>> for MinimumEdgeCostFlow

type Result = ReductionMECFToILP

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<ILP<i32>> for MinimumFeedbackArcSet<i32>

type Result = ReductionFASToILP

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<ILP<i32>> for MinimumFeedbackVertexSet<i32>

type Result = ReductionMFVSToILP

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<ILP<i32>> for MinimumGraphBandwidth<SimpleGraph>

type Result = ReductionMGBToILP

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<ILP<i32>> for MinimumWeightDecoding

type Result = ReductionMinimumWeightDecodingToILP

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<ILP<i32>> for MixedChinesePostman<i32>

type Result = ReductionMCPToILP

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<ILP<i32>> for OpenShopScheduling

type Result = ReductionOSSToILP

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<ILP<i32>> for OptimalLinearArrangement<SimpleGraph>

type Result = ReductionOLAToILP

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<ILP<i32>> for PathConstrainedNetworkFlow

type Result = ReductionPCNFToILP

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<ILP<i32>> for PreemptiveScheduling

type Result = ReductionPSToILP

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<ILP<i32>> for RegisterSufficiency

type Result = ReductionRegisterSufficiencyToILP

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<ILP<i32>> for RootedTreeStorageAssignment

type Result = ReductionRTSAToILP

The reduction result type.

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

Reduce this problem to the target problem type.

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

type Result = ReductionRPToILP

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<ILP<i32>> for SchedulingToMinimizeWeightedCompletionTime

type Result = ReductionSMWCTToILP

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<ILP<i32>> for SequencingToMinimizeMaximumCumulativeCost

type Result = ReductionSTMMCCToILP

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<ILP<i32>> for SequencingToMinimizeWeightedCompletionTime

type Result = ReductionSTMWCTToILP

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<ILP<i32>> for SequencingToMinimizeWeightedTardiness

type Result = ReductionSTMWTToILP

The reduction result type.

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

Reduce this problem to the target problem type.

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

type Result = ReductionSWCPToILP

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<ILP<i32>> for StrongConnectivityAugmentation<i32>

type Result = ReductionSCAToILP

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<ILP<i32>> for UndirectedFlowLowerBounds

type Result = ReductionUFLBToILP

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<ILP<i32>> for UndirectedTwoCommodityIntegralFlow

type Result = ReductionU2CIFToILP

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<ILP> for BMF

type Result = ReductionBMFToILP

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<ILP> for BalancedCompleteBipartiteSubgraph

type Result = ReductionBCBSToILP

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 CapacityAssignment

type Result = ReductionCAToILP

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 Clustering

type Result = ReductionClusteringToILP

The reduction result type.

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

Reduce this problem to the target problem type.

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 ReduceTo<ILP> for ConsecutiveOnesMatrixAugmentation

type Result = ReductionCOMAToILP

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<ILP> for ConsecutiveOnesSubmatrix

type Result = ReductionCOSToILP

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<ILP> for ConsistencyOfDatabaseFrequencyTables

type Result = ReductionCDFTToILP

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<ILP> for DirectedHamiltonianPath

type Result = ReductionDirectedHamiltonianPathToILP

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<ILP> for DisjointConnectingPaths<SimpleGraph>

type Result = ReductionDCPToILP

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<ILP> for ExactCoverBy3Sets

type Result = ReductionX3CToILP

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<ILP> for ExpectedRetrievalCost

type Result = ReductionERCToILP

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<ILP> for GraphPartitioning<SimpleGraph>

type Result = ReductionGraphPartitioningToILP

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<ILP> for HamiltonianPath<SimpleGraph>

type Result = ReductionHamiltonianPathToILP

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<ILP> for ILP<i32>

type Result = ReductionIntILPToBinaryILP

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<ILP> for IsomorphicSpanningTree<SimpleGraph>

type Result = ReductionISTToILP

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<ILP> for KClique<SimpleGraph>

type Result = ReductionKCliqueToILP

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 Knapsack

type Result = ReductionKnapsackToILP

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<ILP> for LengthBoundedDisjointPaths<SimpleGraph>

type Result = ReductionLBDPToILP

The reduction result type.

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

Reduce this problem to the target problem type.

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

type Result = ReductionLongestCircuitToILP

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<ILP> for LongestCommonSubsequence

type Result = ReductionLCSToILP

The reduction result type.

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

Reduce this problem to the target problem type.

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

type Result = ReductionMxISToILP

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<ILP> for Maximum2Satisfiability

type Result = ReductionMaximum2SatisfiabilityToILP

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 MaximumDomaticNumber<SimpleGraph>

type Result = ReductionDomaticNumberToILP

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<ILP> for MaximumLikelihoodRanking

type Result = ReductionMaximumLikelihoodRankingToILP

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 MinimumCoveringByCliques<SimpleGraph>

type Result = ReductionMinimumCoveringByCliquesToILP

The reduction result type.

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

Reduce this problem to the target problem type.

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

type Result = ReductionMinCutBSToILP

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 MinimumExternalMacroDataCompression

type Result = ReductionEMDCToILP

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<ILP> for MinimumFaultDetectionTestSet

type Result = ReductionMFDTSToILP

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<ILP> for MinimumHittingSet

type Result = ReductionHSToILP

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<ILP> for MinimumInternalMacroDataCompression

type Result = ReductionIMDCToILP

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<ILP> for MinimumMatrixCover

type Result = ReductionMinimumMatrixCoverToILP

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<ILP> for MinimumMaximalMatching<SimpleGraph>

type Result = ReductionMMMToILP

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<ILP> for MinimumMetricDimension<SimpleGraph>

type Result = ReductionMDToILP

The reduction result type.

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

Reduce this problem to the target problem type.

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

type Result = ReductionMMCToILP

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 MinimumSumMulticenter<SimpleGraph, i32>

type Result = ReductionMSMCToILP

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<ILP> for MinimumTardinessSequencing<One>

type Result = ReductionMTSToILP

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<ILP> for MinimumTardinessSequencing<i32>

type Result = ReductionMTSWeightedToILP

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<ILP> for MonochromaticTriangle<SimpleGraph>

type Result = ReductionMonochromaticTriangleToILP

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<ILP> for MultipleCopyFileAllocation

type Result = ReductionMCFAToILP

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<ILP> for MultiprocessorScheduling

type Result = ReductionMSToILP

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<ILP> for NAESatisfiability

type Result = ReductionNAESATToILP

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<ILP> for NumericalMatchingWithTargetSums

type Result = ReductionNMTSToILP

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<ILP> for OptimumCommunicationSpanningTree

type Result = ReductionOptimumCommunicationSpanningTreeToILP

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<ILP> for PaintShop

type Result = ReductionPaintShopToILP

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<ILP> for PartiallyOrderedKnapsack

type Result = ReductionPOKToILP

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<ILP> for PartitionIntoPathsOfLength2<SimpleGraph>

type Result = ReductionPIPL2ToILP

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<ILP> for PartitionIntoTriangles<SimpleGraph>

type Result = ReductionPITToILP

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<ILP> for PrecedenceConstrainedScheduling

type Result = ReductionPCSToILP

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 QuadraticAssignment

type Result = ReductionQAPToILP

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<ILP> for RectilinearPictureCompression

type Result = ReductionRPCToILP

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<ILP> for ResourceConstrainedScheduling

type Result = ReductionRCSToILP

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<ILP> for SchedulingWithIndividualDeadlines

type Result = ReductionSWIDToILP

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<ILP> for SequencingToMinimizeTardyTaskWeight

type Result = ReductionSTMTTWToILP

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<ILP> for SequencingWithDeadlinesAndSetUpTimes

type Result = ReductionSWDSTToILP

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<ILP> for SequencingWithReleaseTimesAndDeadlines

type Result = ReductionSWRTDToILP

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<ILP> for SequencingWithinIntervals

type Result = ReductionSWIToILP

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<ILP> for SetSplitting

type Result = ReductionSetSplittingToILP

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<ILP> for ShortestCommonSupersequence

type Result = ReductionSCSToILP

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<ILP> for SparseMatrixCompression

type Result = ReductionSMCToILP

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<ILP> for StackerCrane

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 SteinerTree<SimpleGraph, i32>

type Result = ReductionSteinerTreeToILP

The reduction result type.

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

Reduce this problem to the target problem type.

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

type Result = ReductionSTIGToILP

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<ILP> for StringToStringCorrection

type Result = ReductionSTSCToILP

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<ILP> for SubgraphIsomorphism

type Result = ReductionSubIsoToILP

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<ILP> for SumOfSquaresPartition

type Result = ReductionSSPToILP

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<ILP> for ThreeDimensionalMatching

type Result = ReductionThreeDimensionalMatchingToILP

The reduction result type.

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

Reduce this problem to the target problem type.

impl ReduceTo<ILP> for TimetableDesign

type Result = ReductionTDToILP

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>