Trait Problem 

pub trait Problem: Clone {
    type Value: Clone;

    const NAME: &'static str;

    // Required methods
    fn dims(&self) -> Vec<usize>;
    fn evaluate(&self, config: &[usize]) -> Self::Value;
    fn variant() -> Vec<(&'static str, &'static str)>;

    // Provided methods
    fn num_variables(&self) -> usize { ... }
    fn problem_type() -> ProblemType { ... }
}

Minimal problem trait — a problem is a function from configuration to value.

This trait defines the interface for computational problems that can be solved by enumeration or reduction to other problems.

Required Associated Constants

const NAME: &'static str

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

Required Associated Types

type Value: Clone

The evaluation value type.

Required Methods

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

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

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

Evaluate the problem on a configuration.

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

Returns variant attributes derived from type parameters.

Used for generating variant IDs in the reduction graph schema. Returns pairs like [("graph", "SimpleGraph"), ("weight", "i32")].

Provided Methods

fn num_variables(&self) -> usize

Number of variables (derived from dims).

fn problem_type() -> ProblemType

Look up this problem’s catalog entry.

Returns the full [ProblemType] metadata from the catalog registry. The default implementation uses Self::NAME to perform the lookup.

Dyn Compatibility

This trait is not dyn compatible.

In older versions of Rust, dyn compatibility was called "object safety", so this trait is not object safe.

Implementors

impl Problem for AlgebraicEquationsOverGF2

const NAME: &'static str = "AlgebraicEquationsOverGF2"

type Value = Or

impl Problem for BMF

const NAME: &'static str = "BMF"

type Value = Min<i32>

impl Problem for ConsecutiveBlockMinimization

const NAME: &'static str = "ConsecutiveBlockMinimization"

type Value = Or

impl Problem for ConsecutiveOnesMatrixAugmentation

const NAME: &'static str = "ConsecutiveOnesMatrixAugmentation"

type Value = Or

impl Problem for ConsecutiveOnesSubmatrix

const NAME: &'static str = "ConsecutiveOnesSubmatrix"

type Value = Or

impl Problem for EquilibriumPoint

const NAME: &'static str = "EquilibriumPoint"

type Value = Or

impl Problem for FeasibleBasisExtension

const NAME: &'static str = "FeasibleBasisExtension"

type Value = Or

impl Problem for MinimumMatrixCover

const NAME: &'static str = "MinimumMatrixCover"

type Value = Min<i64>

impl Problem for MinimumMatrixDomination

const NAME: &'static str = "MinimumMatrixDomination"

type Value = Min<usize>

impl Problem for MinimumWeightDecoding

const NAME: &'static str = "MinimumWeightDecoding"

type Value = Min<usize>

impl Problem for MinimumWeightSolutionToLinearEquations

const NAME: &'static str = "MinimumWeightSolutionToLinearEquations"

type Value = Min<usize>

impl Problem for QuadraticAssignment

const NAME: &'static str = "QuadraticAssignment"

type Value = Min<i64>

impl Problem for QuadraticCongruences

const NAME: &'static str = "QuadraticCongruences"

type Value = Or

impl Problem for QuadraticDiophantineEquations

const NAME: &'static str = "QuadraticDiophantineEquations"

type Value = Or

impl Problem for SimultaneousIncongruences

const NAME: &'static str = "SimultaneousIncongruences"

type Value = Or

impl Problem for SparseMatrixCompression

const NAME: &'static str = "SparseMatrixCompression"

type Value = Or

impl Problem for CircuitSAT

const NAME: &'static str = "CircuitSAT"

type Value = Or

impl Problem for Maximum2Satisfiability

const NAME: &'static str = "Maximum2Satisfiability"

type Value = Max<usize>

impl Problem for NAESatisfiability

const NAME: &'static str = "NAESatisfiability"

type Value = Or

impl Problem for NonTautology

const NAME: &'static str = "NonTautology"

type Value = Or

impl Problem for OneInThreeSatisfiability

const NAME: &'static str = "OneInThreeSatisfiability"

type Value = Or

impl Problem for Planar3Satisfiability

const NAME: &'static str = "Planar3Satisfiability"

type Value = Or

impl Problem for QuantifiedBooleanFormulas

const NAME: &'static str = "QuantifiedBooleanFormulas"

type Value = Or

impl Problem for Satisfiability

const NAME: &'static str = "Satisfiability"

type Value = Or

impl Problem for BalancedCompleteBipartiteSubgraph

const NAME: &'static str = "BalancedCompleteBipartiteSubgraph"

type Value = Or

impl Problem for BicliqueCover

const NAME: &'static str = "BicliqueCover"

type Value = Min<i32>

impl Problem for BottleneckTravelingSalesman

const NAME: &'static str = "BottleneckTravelingSalesman"

type Value = Min<i32>

impl Problem for DirectedHamiltonianPath

const NAME: &'static str = "DirectedHamiltonianPath"

type Value = Or

impl Problem for DirectedTwoCommodityIntegralFlow

const NAME: &'static str = "DirectedTwoCommodityIntegralFlow"

type Value = Or

impl Problem for IntegralFlowBundles

const NAME: &'static str = "IntegralFlowBundles"

type Value = Or

impl Problem for IntegralFlowHomologousArcs

const NAME: &'static str = "IntegralFlowHomologousArcs"

type Value = Or

impl Problem for IntegralFlowWithMultipliers

const NAME: &'static str = "IntegralFlowWithMultipliers"

type Value = Or

impl Problem for Kernel

const NAME: &'static str = "Kernel"

type Value = Or

impl Problem for MinimumDummyActivitiesPert

const NAME: &'static str = "MinimumDummyActivitiesPert"

type Value = Min<i32>

impl Problem for MinimumEdgeCostFlow

const NAME: &'static str = "MinimumEdgeCostFlow"

type Value = Min<i64>

impl Problem for MinimumGeometricConnectedDominatingSet

const NAME: &'static str = "MinimumGeometricConnectedDominatingSet"

type Value = Min<usize>

impl Problem for MultipleCopyFileAllocation

const NAME: &'static str = "MultipleCopyFileAllocation"

type Value = Min<i64>

impl Problem for PathConstrainedNetworkFlow

const NAME: &'static str = "PathConstrainedNetworkFlow"

type Value = Or

impl Problem for SubgraphIsomorphism

const NAME: &'static str = "SubgraphIsomorphism"

type Value = Or

impl Problem for UndirectedFlowLowerBounds

const NAME: &'static str = "UndirectedFlowLowerBounds"

type Value = Or

impl Problem for UndirectedTwoCommodityIntegralFlow

const NAME: &'static str = "UndirectedTwoCommodityIntegralFlow"

type Value = Or

impl Problem for AdditionalKey

const NAME: &'static str = "AdditionalKey"

type Value = Or

impl Problem for Betweenness

const NAME: &'static str = "Betweenness"

type Value = Or

impl Problem for BoyceCoddNormalFormViolation

const NAME: &'static str = "BoyceCoddNormalFormViolation"

type Value = Or

impl Problem for CapacityAssignment

const NAME: &'static str = "CapacityAssignment"

type Value = Min<u128>

impl Problem for Clustering

const NAME: &'static str = "Clustering"

type Value = Or

impl Problem for ConjunctiveBooleanQuery

const NAME: &'static str = "ConjunctiveBooleanQuery"

type Value = Or

impl Problem for ConjunctiveQueryFoldability

const NAME: &'static str = "ConjunctiveQueryFoldability"

type Value = Or

impl Problem for ConsistencyOfDatabaseFrequencyTables

const NAME: &'static str = "ConsistencyOfDatabaseFrequencyTables"

type Value = Or

impl Problem for CosineProductIntegration

const NAME: &'static str = "CosineProductIntegration"

type Value = Or

impl Problem for CyclicOrdering

const NAME: &'static str = "CyclicOrdering"

type Value = Or

impl Problem for DynamicStorageAllocation

const NAME: &'static str = "DynamicStorageAllocation"

type Value = Or

impl Problem for EnsembleComputation

const NAME: &'static str = "EnsembleComputation"

type Value = Min<usize>

impl Problem for ExpectedRetrievalCost

const NAME: &'static str = "ExpectedRetrievalCost"

type Value = Min<f64>

impl Problem for Factoring

const NAME: &'static str = "Factoring"

type Value = Min<i32>

impl Problem for FeasibleRegisterAssignment

const NAME: &'static str = "FeasibleRegisterAssignment"

type Value = Or

impl Problem for FlowShopScheduling

const NAME: &'static str = "FlowShopScheduling"

type Value = Or

impl Problem for GroupingBySwapping

const NAME: &'static str = "GroupingBySwapping"

type Value = Or

impl Problem for IntegerExpressionMembership

const NAME: &'static str = "IntegerExpressionMembership"

type Value = Or

impl Problem for JobShopScheduling

const NAME: &'static str = "JobShopScheduling"

type Value = Min<u64>

impl Problem for Knapsack

const NAME: &'static str = "Knapsack"

type Value = Max<i64>

impl Problem for KthLargestMTuple

const NAME: &'static str = "KthLargestMTuple"

type Value = Sum<u64>

impl Problem for LongestCommonSubsequence

const NAME: &'static str = "LongestCommonSubsequence"

type Value = Max<usize>

impl Problem for MaximumLikelihoodRanking

const NAME: &'static str = "MaximumLikelihoodRanking"

type Value = Min<i64>

impl Problem for MinimumAxiomSet

const NAME: &'static str = "MinimumAxiomSet"

type Value = Min<usize>

impl Problem for MinimumCodeGenerationOneRegister

const NAME: &'static str = "MinimumCodeGenerationOneRegister"

type Value = Min<usize>

impl Problem for MinimumCodeGenerationParallelAssignments

const NAME: &'static str = "MinimumCodeGenerationParallelAssignments"

type Value = Min<usize>

impl Problem for MinimumCodeGenerationUnlimitedRegisters

const NAME: &'static str = "MinimumCodeGenerationUnlimitedRegisters"

type Value = Min<usize>

impl Problem for MinimumDecisionTree

const NAME: &'static str = "MinimumDecisionTree"

type Value = Min<usize>

impl Problem for MinimumDisjunctiveNormalForm

const NAME: &'static str = "MinimumDisjunctiveNormalForm"

type Value = Min<usize>

impl Problem for MinimumExternalMacroDataCompression

const NAME: &'static str = "MinimumExternalMacroDataCompression"

type Value = Min<usize>

impl Problem for MinimumFaultDetectionTestSet

const NAME: &'static str = "MinimumFaultDetectionTestSet"

type Value = Min<usize>

impl Problem for MinimumInternalMacroDataCompression

const NAME: &'static str = "MinimumInternalMacroDataCompression"

type Value = Min<usize>

impl Problem for MinimumRegisterSufficiencyForLoops

const NAME: &'static str = "MinimumRegisterSufficiencyForLoops"

type Value = Min<usize>

impl Problem for MinimumTardinessSequencing<i32>

const NAME: &'static str = "MinimumTardinessSequencing"

type Value = Min<usize>

impl Problem for MinimumTardinessSequencing<One>

const NAME: &'static str = "MinimumTardinessSequencing"

type Value = Min<usize>

impl Problem for MinimumWeightAndOrGraph

const NAME: &'static str = "MinimumWeightAndOrGraph"

type Value = Min<i32>

impl Problem for MultiprocessorScheduling

const NAME: &'static str = "MultiprocessorScheduling"

type Value = Or

impl Problem for NonLivenessFreePetriNet

const NAME: &'static str = "NonLivenessFreePetriNet"

type Value = Or

impl Problem for Numerical3DimensionalMatching

const NAME: &'static str = "Numerical3DimensionalMatching"

type Value = Or

impl Problem for NumericalMatchingWithTargetSums

const NAME: &'static str = "NumericalMatchingWithTargetSums"

type Value = Or

impl Problem for OpenShopScheduling

const NAME: &'static str = "OpenShopScheduling"

type Value = Min<usize>

impl Problem for OptimumCommunicationSpanningTree

const NAME: &'static str = "OptimumCommunicationSpanningTree"

type Value = Min<i64>

impl Problem for PaintShop

const NAME: &'static str = "PaintShop"

type Value = Min<i32>

impl Problem for PartiallyOrderedKnapsack

const NAME: &'static str = "PartiallyOrderedKnapsack"

type Value = Max<i64>

impl Problem for Partition

const NAME: &'static str = "Partition"

type Value = Or

impl Problem for PrecedenceConstrainedScheduling

const NAME: &'static str = "PrecedenceConstrainedScheduling"

type Value = Or

impl Problem for PreemptiveScheduling

const NAME: &'static str = "PreemptiveScheduling"

type Value = Min<usize>

impl Problem for ProductionPlanning

const NAME: &'static str = "ProductionPlanning"

type Value = Or

impl Problem for RectilinearPictureCompression

const NAME: &'static str = "RectilinearPictureCompression"

type Value = Or

impl Problem for RegisterSufficiency

const NAME: &'static str = "RegisterSufficiency"

type Value = Or

impl Problem for ResourceConstrainedScheduling

const NAME: &'static str = "ResourceConstrainedScheduling"

type Value = Or

impl Problem for SchedulingToMinimizeWeightedCompletionTime

const NAME: &'static str = "SchedulingToMinimizeWeightedCompletionTime"

type Value = Min<u64>

impl Problem for SchedulingWithIndividualDeadlines

const NAME: &'static str = "SchedulingWithIndividualDeadlines"

type Value = Or

impl Problem for SequencingToMinimizeMaximumCumulativeCost

const NAME: &'static str = "SequencingToMinimizeMaximumCumulativeCost"

type Value = Min<i64>

impl Problem for SequencingToMinimizeTardyTaskWeight

const NAME: &'static str = "SequencingToMinimizeTardyTaskWeight"

type Value = Min<u64>

impl Problem for SequencingToMinimizeWeightedCompletionTime

const NAME: &'static str = "SequencingToMinimizeWeightedCompletionTime"

type Value = Min<u64>

impl Problem for SequencingToMinimizeWeightedTardiness

const NAME: &'static str = "SequencingToMinimizeWeightedTardiness"

type Value = Or

impl Problem for SequencingWithDeadlinesAndSetUpTimes

const NAME: &'static str = "SequencingWithDeadlinesAndSetUpTimes"

type Value = Or

impl Problem for SequencingWithReleaseTimesAndDeadlines

const NAME: &'static str = "SequencingWithReleaseTimesAndDeadlines"

type Value = Or

impl Problem for SequencingWithinIntervals

const NAME: &'static str = "SequencingWithinIntervals"

type Value = Or

impl Problem for ShortestCommonSupersequence

const NAME: &'static str = "ShortestCommonSupersequence"

type Value = Min<usize>

impl Problem for SquareTiling

const NAME: &'static str = "SquareTiling"

type Value = Or

impl Problem for StackerCrane

const NAME: &'static str = "StackerCrane"

type Value = Min<i32>

impl Problem for StaffScheduling

const NAME: &'static str = "StaffScheduling"

type Value = Or

impl Problem for StringToStringCorrection

const NAME: &'static str = "StringToStringCorrection"

type Value = Or

impl Problem for SubsetProduct

const NAME: &'static str = "SubsetProduct"

type Value = Or

impl Problem for SubsetSum

const NAME: &'static str = "SubsetSum"

type Value = Or

impl Problem for SumOfSquaresPartition

const NAME: &'static str = "SumOfSquaresPartition"

type Value = Min<i64>

impl Problem for ThreePartition

const NAME: &'static str = "ThreePartition"

type Value = Or

impl Problem for TimetableDesign

const NAME: &'static str = "TimetableDesign"

type Value = Or

impl Problem for ConsecutiveSets

const NAME: &'static str = "ConsecutiveSets"

type Value = Or

impl Problem for ExactCoverBy3Sets

const NAME: &'static str = "ExactCoverBy3Sets"

type Value = Or

impl Problem for IntegerKnapsack

const NAME: &'static str = "IntegerKnapsack"

type Value = Max<i64>

impl Problem for MinimumCardinalityKey

const NAME: &'static str = "MinimumCardinalityKey"

type Value = Min<i64>

impl Problem for MinimumHittingSet

const NAME: &'static str = "MinimumHittingSet"

type Value = Min<usize>

impl Problem for PrimeAttributeName

const NAME: &'static str = "PrimeAttributeName"

type Value = Or

impl Problem for RootedTreeStorageAssignment

const NAME: &'static str = "RootedTreeStorageAssignment"

type Value = Or

impl Problem for SetBasis

const NAME: &'static str = "SetBasis"

type Value = Or

impl Problem for SetSplitting

const NAME: &'static str = "SetSplitting"

type Value = Or

impl Problem for ThreeDimensionalMatching

const NAME: &'static str = "ThreeDimensionalMatching"

type Value = Or

impl Problem for ThreeMatroidIntersection

const NAME: &'static str = "ThreeMatroidIntersection"

type Value = Or

impl Problem for TwoDimensionalConsecutiveSets

const NAME: &'static str = "TwoDimensionalConsecutiveSets"

type Value = Or

impl<G> Problem for DegreeConstrainedSpanningTree<G>

where G: Graph + VariantParam,

const NAME: &'static str = "DegreeConstrainedSpanningTree"

type Value = Or

impl<G> Problem for DisjointConnectingPaths<G>

where G: Graph + VariantParam,

const NAME: &'static str = "DisjointConnectingPaths"

type Value = Or

impl<G> Problem for GeneralizedHex<G>

where G: Graph + VariantParam,

const NAME: &'static str = "GeneralizedHex"

type Value = Or

impl<G> Problem for GraphPartitioning<G>

where G: Graph + VariantParam,

const NAME: &'static str = "GraphPartitioning"

type Value = Min<i32>

impl<G> Problem for HamiltonianCircuit<G>

where G: Graph + VariantParam,

const NAME: &'static str = "HamiltonianCircuit"

type Value = Or

impl<G> Problem for HamiltonianPath<G>

where G: Graph + VariantParam,

const NAME: &'static str = "HamiltonianPath"

type Value = Or

impl<G> Problem for HamiltonianPathBetweenTwoVertices<G>

where G: Graph + VariantParam,

const NAME: &'static str = "HamiltonianPathBetweenTwoVertices"

type Value = Or

impl<G> Problem for IsomorphicSpanningTree<G>

where G: Graph + VariantParam,

const NAME: &'static str = "IsomorphicSpanningTree"

type Value = Or

impl<G> Problem for KClique<G>

where G: Graph + VariantParam,

const NAME: &'static str = "KClique"

type Value = Or

impl<G> Problem for LengthBoundedDisjointPaths<G>

where G: Graph + VariantParam,

const NAME: &'static str = "LengthBoundedDisjointPaths"

type Value = Max<usize>

impl<G> Problem for MaximumAchromaticNumber<G>

where G: Graph + VariantParam,

const NAME: &'static str = "MaximumAchromaticNumber"

type Value = Max<usize>

impl<G> Problem for MaximumDomaticNumber<G>

where G: Graph + VariantParam,

const NAME: &'static str = "MaximumDomaticNumber"

type Value = Max<usize>

impl<G> Problem for MaximumLeafSpanningTree<G>

where G: Graph + VariantParam,

const NAME: &'static str = "MaximumLeafSpanningTree"

type Value = Max<usize>

impl<G> Problem for MinimumCoveringByCliques<G>

where G: Graph + VariantParam,

const NAME: &'static str = "MinimumCoveringByCliques"

type Value = Min<usize>

impl<G> Problem for MinimumGraphBandwidth<G>

where G: Graph + VariantParam,

const NAME: &'static str = "MinimumGraphBandwidth"

type Value = Min<usize>

impl<G> Problem for MinimumIntersectionGraphBasis<G>

where G: Graph + VariantParam,

const NAME: &'static str = "MinimumIntersectionGraphBasis"

type Value = Min<usize>

impl<G> Problem for MinimumMaximalMatching<G>

where G: Graph + VariantParam,

const NAME: &'static str = "MinimumMaximalMatching"

type Value = Min<usize>

impl<G> Problem for MinimumMetricDimension<G>

where G: Graph + VariantParam,

const NAME: &'static str = "MinimumMetricDimension"

type Value = Min<usize>

impl<G> Problem for MonochromaticTriangle<G>

where G: Graph + VariantParam,

const NAME: &'static str = "MonochromaticTriangle"

type Value = Or

impl<G> Problem for OptimalLinearArrangement<G>

where G: Graph + VariantParam,

const NAME: &'static str = "OptimalLinearArrangement"

type Value = Min<usize>

impl<G> Problem for PartialFeedbackEdgeSet<G>

where G: Graph + VariantParam,

const NAME: &'static str = "PartialFeedbackEdgeSet"

type Value = Or

impl<G> Problem for PartitionIntoCliques<G>

where G: Graph + VariantParam,

const NAME: &'static str = "PartitionIntoCliques"

type Value = Or

impl<G> Problem for PartitionIntoForests<G>

where G: Graph + VariantParam,

const NAME: &'static str = "PartitionIntoForests"

type Value = Or

impl<G> Problem for PartitionIntoPathsOfLength2<G>

where G: Graph + VariantParam,

const NAME: &'static str = "PartitionIntoPathsOfLength2"

type Value = Or

impl<G> Problem for PartitionIntoPerfectMatchings<G>

where G: Graph + VariantParam,

const NAME: &'static str = "PartitionIntoPerfectMatchings"

type Value = Or

impl<G> Problem for PartitionIntoTriangles<G>

where G: Graph + VariantParam,

const NAME: &'static str = "PartitionIntoTriangles"

type Value = Or

impl<G> Problem for RootedTreeArrangement<G>

where G: Graph + VariantParam,

const NAME: &'static str = "RootedTreeArrangement"

type Value = Or

impl<G, N> Problem for ShortestWeightConstrainedPath<G, N>

where G: Graph + VariantParam, N: WeightElement + VariantParam,

const NAME: &'static str = "ShortestWeightConstrainedPath"

type Value = Min<<N as WeightElement>::Sum>

impl<G, W> Problem for BiconnectivityAugmentation<G, W>

where G: Graph + VariantParam, W: WeightElement + VariantParam,

const NAME: &'static str = "BiconnectivityAugmentation"

type Value = Or

impl<G, W> Problem for BoundedComponentSpanningForest<G, W>

where G: Graph + VariantParam, W: WeightElement + VariantParam,

const NAME: &'static str = "BoundedComponentSpanningForest"

type Value = Or

impl<G, W> Problem for BoundedDiameterSpanningTree<G, W>

where G: Graph + VariantParam, W: WeightElement + VariantParam,

const NAME: &'static str = "BoundedDiameterSpanningTree"

type Value = Or

impl<G, W> Problem for LongestCircuit<G, W>

where G: Graph + VariantParam, W: WeightElement + VariantParam,

const NAME: &'static str = "LongestCircuit"

type Value = Max<<W as WeightElement>::Sum>

impl<G, W> Problem for LongestPath<G, W>

where G: Graph + VariantParam, W: WeightElement + VariantParam,

const NAME: &'static str = "LongestPath"

type Value = Max<<W as WeightElement>::Sum>

impl<G, W> Problem for MaxCut<G, W>

where G: Graph + VariantParam, W: WeightElement + VariantParam,

const NAME: &'static str = "MaxCut"

type Value = Max<<W as WeightElement>::Sum>

impl<G, W> Problem for MaximalIS<G, W>

where G: Graph + VariantParam, W: WeightElement + VariantParam,

const NAME: &'static str = "MaximalIS"

type Value = Max<<W as WeightElement>::Sum>

impl<G, W> Problem for MaximumClique<G, W>

where G: Graph + VariantParam, W: WeightElement + VariantParam,

const NAME: &'static str = "MaximumClique"

type Value = Max<<W as WeightElement>::Sum>

impl<G, W> Problem for MaximumIndependentSet<G, W>

where G: Graph + VariantParam, W: WeightElement + VariantParam,

const NAME: &'static str = "MaximumIndependentSet"

type Value = Max<<W as WeightElement>::Sum>

impl<G, W> Problem for MaximumMatching<G, W>

where G: Graph + VariantParam, W: WeightElement + VariantParam,

const NAME: &'static str = "MaximumMatching"

type Value = Max<<W as WeightElement>::Sum>

impl<G, W> Problem for MinMaxMulticenter<G, W>

where G: Graph + VariantParam, W: WeightElement + VariantParam,

const NAME: &'static str = "MinMaxMulticenter"

type Value = Min<<W as WeightElement>::Sum>

impl<G, W> Problem for MinimumCapacitatedSpanningTree<G, W>

where G: Graph + VariantParam, W: WeightElement + VariantParam,

const NAME: &'static str = "MinimumCapacitatedSpanningTree"

type Value = Min<<W as WeightElement>::Sum>

impl<G, W> Problem for MinimumCutIntoBoundedSets<G, W>

where G: Graph + VariantParam, W: WeightElement + VariantParam,

const NAME: &'static str = "MinimumCutIntoBoundedSets"

type Value = Min<<W as WeightElement>::Sum>

impl<G, W> Problem for MinimumDominatingSet<G, W>

where G: Graph + VariantParam, W: WeightElement + VariantParam,

const NAME: &'static str = "MinimumDominatingSet"

type Value = Min<<W as WeightElement>::Sum>

impl<G, W> Problem for MinimumMultiwayCut<G, W>

where G: Graph + VariantParam, W: WeightElement + VariantParam,

const NAME: &'static str = "MinimumMultiwayCut"

type Value = Min<<W as WeightElement>::Sum>

impl<G, W> Problem for MinimumSumMulticenter<G, W>

where G: Graph + VariantParam, W: WeightElement + VariantParam,

const NAME: &'static str = "MinimumSumMulticenter"

type Value = Min<<W as WeightElement>::Sum>

impl<G, W> Problem for MinimumVertexCover<G, W>

where G: Graph + VariantParam, W: WeightElement + VariantParam,

const NAME: &'static str = "MinimumVertexCover"

type Value = Min<<W as WeightElement>::Sum>

impl<G, W> Problem for RuralPostman<G, W>

where G: Graph + VariantParam, W: WeightElement + VariantParam,

const NAME: &'static str = "RuralPostman"

type Value = Min<<W as WeightElement>::Sum>

impl<G, W> Problem for SpinGlass<G, W>

where G: Graph + VariantParam, W: WeightElement + VariantParam + PartialOrd + Num + Zero + Bounded + AddAssign + Mul<Output = W> + From<i32>,

const NAME: &'static str = "SpinGlass"

type Value = Min<<W as WeightElement>::Sum>

impl<G, W> Problem for SteinerTree<G, W>

where G: Graph + VariantParam, W: WeightElement + VariantParam,

const NAME: &'static str = "SteinerTree"

type Value = Min<<W as WeightElement>::Sum>

impl<G, W> Problem for SteinerTreeInGraphs<G, W>

where G: Graph + VariantParam, W: WeightElement + VariantParam,

const NAME: &'static str = "SteinerTreeInGraphs"

type Value = Min<<W as WeightElement>::Sum>

impl<G, W> Problem for TravelingSalesman<G, W>

where G: Graph + VariantParam, W: WeightElement + VariantParam,

const NAME: &'static str = "TravelingSalesman"

type Value = Min<<W as WeightElement>::Sum>

impl<K: KValue> Problem for KSatisfiability<K>

const NAME: &'static str = "KSatisfiability"

type Value = Or

impl<K: KValue, G> Problem for KColoring<K, G>

where G: Graph + VariantParam,

const NAME: &'static str = "KColoring"

type Value = Or

impl<P> Problem for Decision<P>

where P: DecisionProblemMeta, P::Value: OptimizationValue,

const NAME: &'static str = P::DECISION_NAME

type Value = Or

impl<T> Problem for ClosestVectorProblem<T>

where T: Clone + Into<f64> + VariantParam + Serialize + for<'de> Deserialize<'de> + Debug + 'static,

const NAME: &'static str = "ClosestVectorProblem"

type Value = Min<f64>

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

const NAME: &'static str = "ILP"

type Value = Extremum<f64>

impl<W> Problem for QUBO<W>

where W: WeightElement + VariantParam + PartialOrd + Num + Zero + Bounded + AddAssign + Mul<Output = W>,

const NAME: &'static str = "QUBO"

type Value = Min<<W as WeightElement>::Sum>

impl<W> Problem for AcyclicPartition<W>

where W: WeightElement + VariantParam,

const NAME: &'static str = "AcyclicPartition"

type Value = Or

impl<W> Problem for KthBestSpanningTree<W>

where W: WeightElement + VariantParam,

const NAME: &'static str = "KthBestSpanningTree"

type Value = Or

impl<W> Problem for MinimumFeedbackArcSet<W>

where W: WeightElement + VariantParam,

const NAME: &'static str = "MinimumFeedbackArcSet"

type Value = Min<<W as WeightElement>::Sum>

impl<W> Problem for MinimumFeedbackVertexSet<W>

where W: WeightElement + VariantParam,

const NAME: &'static str = "MinimumFeedbackVertexSet"

type Value = Min<<W as WeightElement>::Sum>

impl<W> Problem for MixedChinesePostman<W>

where W: WeightElement<Sum = i32> + VariantParam,

const NAME: &'static str = "MixedChinesePostman"

type Value = Min<<W as WeightElement>::Sum>

impl<W> Problem for MultipleChoiceBranching<W>

where W: WeightElement + VariantParam,

const NAME: &'static str = "MultipleChoiceBranching"

type Value = Or

impl<W> Problem for StrongConnectivityAugmentation<W>

where W: WeightElement + VariantParam,

const NAME: &'static str = "StrongConnectivityAugmentation"

type Value = Or

impl<W> Problem for BinPacking<W>

where W: WeightElement + VariantParam, W::Sum: PartialOrd,

const NAME: &'static str = "BinPacking"

type Value = Min<i32>

impl<W> Problem for ComparativeContainment<W>

where W: WeightElement + VariantParam,

const NAME: &'static str = "ComparativeContainment"

type Value = Or

impl<W> Problem for MaximumSetPacking<W>

where W: WeightElement + VariantParam,

const NAME: &'static str = "MaximumSetPacking"

type Value = Max<<W as WeightElement>::Sum>

impl<W> Problem for MinimumSetCovering<W>

where W: WeightElement + VariantParam,

const NAME: &'static str = "MinimumSetCovering"

type Value = Min<<W as WeightElement>::Sum>