Expand description
Problem model implementations.
Each sub-module groups related problem types by input structure.
Re-exports§
pub use algebraic::AlgebraicEquationsOverGF2;pub use algebraic::ClosestVectorProblem;pub use algebraic::ConsecutiveBlockMinimization;pub use algebraic::ConsecutiveOnesMatrixAugmentation;pub use algebraic::ConsecutiveOnesSubmatrix;pub use algebraic::EquilibriumPoint;pub use algebraic::FeasibleBasisExtension;pub use algebraic::MinimumMatrixCover;pub use algebraic::MinimumMatrixDomination;pub use algebraic::MinimumWeightDecoding;pub use algebraic::MinimumWeightSolutionToLinearEquations;pub use algebraic::QuadraticAssignment;pub use algebraic::QuadraticCongruences;pub use algebraic::QuadraticDiophantineEquations;pub use algebraic::SimultaneousIncongruences;pub use algebraic::SparseMatrixCompression;pub use algebraic::BMF;pub use algebraic::ILP;pub use algebraic::QUBO;pub use decision::Decision;pub use formula::CNFClause;pub use formula::CircuitSAT;pub use formula::KSatisfiability;pub use formula::Maximum2Satisfiability;pub use formula::NAESatisfiability;pub use formula::NonTautology;pub use formula::OneInThreeSatisfiability;pub use formula::Planar3Satisfiability;pub use formula::QuantifiedBooleanFormulas;pub use formula::Quantifier;pub use formula::Satisfiability;pub use graph::AcyclicPartition;pub use graph::BalancedCompleteBipartiteSubgraph;pub use graph::BicliqueCover;pub use graph::BiconnectivityAugmentation;pub use graph::BottleneckTravelingSalesman;pub use graph::BoundedComponentSpanningForest;pub use graph::BoundedDiameterSpanningTree;pub use graph::DegreeConstrainedSpanningTree;pub use graph::DirectedHamiltonianPath;pub use graph::DirectedTwoCommodityIntegralFlow;pub use graph::DisjointConnectingPaths;pub use graph::GeneralizedHex;pub use graph::GraphPartitioning;pub use graph::HamiltonianCircuit;pub use graph::HamiltonianPath;pub use graph::HamiltonianPathBetweenTwoVertices;pub use graph::IntegralFlowBundles;pub use graph::IntegralFlowHomologousArcs;pub use graph::IntegralFlowWithMultipliers;pub use graph::IsomorphicSpanningTree;pub use graph::KClique;pub use graph::KColoring;pub use graph::Kernel;pub use graph::KthBestSpanningTree;pub use graph::LengthBoundedDisjointPaths;pub use graph::LongestCircuit;pub use graph::LongestPath;pub use graph::MaxCut;pub use graph::MaximalIS;pub use graph::MaximumAchromaticNumber;pub use graph::MaximumClique;pub use graph::MaximumDomaticNumber;pub use graph::MaximumIndependentSet;pub use graph::MaximumLeafSpanningTree;pub use graph::MaximumMatching;pub use graph::MinMaxMulticenter;pub use graph::MinimumCoveringByCliques;pub use graph::MinimumCutIntoBoundedSets;pub use graph::MinimumDominatingSet;pub use graph::MinimumDummyActivitiesPert;pub use graph::MinimumEdgeCostFlow;pub use graph::MinimumFeedbackArcSet;pub use graph::MinimumFeedbackVertexSet;pub use graph::MinimumGeometricConnectedDominatingSet;pub use graph::MinimumGraphBandwidth;pub use graph::MinimumIntersectionGraphBasis;pub use graph::MinimumMaximalMatching;pub use graph::MinimumMultiwayCut;pub use graph::MinimumSumMulticenter;pub use graph::MinimumVertexCover;pub use graph::MixedChinesePostman;pub use graph::MonochromaticTriangle;pub use graph::MultipleChoiceBranching;pub use graph::MultipleCopyFileAllocation;pub use graph::OptimalLinearArrangement;pub use graph::PartialFeedbackEdgeSet;pub use graph::PartitionIntoCliques;pub use graph::PartitionIntoForests;pub use graph::PartitionIntoPathsOfLength2;pub use graph::PartitionIntoPerfectMatchings;pub use graph::PartitionIntoTriangles;pub use graph::PathConstrainedNetworkFlow;pub use graph::RootedTreeArrangement;pub use graph::RuralPostman;pub use graph::ShortestWeightConstrainedPath;pub use graph::SpinGlass;pub use graph::SteinerTree;pub use graph::SteinerTreeInGraphs;pub use graph::StrongConnectivityAugmentation;pub use graph::SubgraphIsomorphism;pub use graph::TravelingSalesman;pub use graph::UndirectedFlowLowerBounds;pub use graph::UndirectedTwoCommodityIntegralFlow;pub use misc::PartiallyOrderedKnapsack;pub use misc::AdditionalKey;pub use misc::Betweenness;pub use misc::BinPacking;pub use misc::CapacityAssignment;pub use misc::CbqRelation;pub use misc::Clustering;pub use misc::ConjunctiveBooleanQuery;pub use misc::ConjunctiveQueryFoldability;pub use misc::ConsistencyOfDatabaseFrequencyTables;pub use misc::CosineProductIntegration;pub use misc::CyclicOrdering;pub use misc::DynamicStorageAllocation;pub use misc::EnsembleComputation;pub use misc::ExpectedRetrievalCost;pub use misc::Factoring;pub use misc::FeasibleRegisterAssignment;pub use misc::FlowShopScheduling;pub use misc::GroupingBySwapping;pub use misc::IntExpr;pub use misc::IntegerExpressionMembership;pub use misc::JobShopScheduling;pub use misc::Knapsack;pub use misc::KthLargestMTuple;pub use misc::LongestCommonSubsequence;pub use misc::MaximumLikelihoodRanking;pub use misc::MinimumAxiomSet;pub use misc::MinimumCodeGenerationOneRegister;pub use misc::MinimumCodeGenerationParallelAssignments;pub use misc::MinimumCodeGenerationUnlimitedRegisters;pub use misc::MinimumDecisionTree;pub use misc::MinimumDisjunctiveNormalForm;pub use misc::MinimumExternalMacroDataCompression;pub use misc::MinimumFaultDetectionTestSet;pub use misc::MinimumInternalMacroDataCompression;pub use misc::MinimumRegisterSufficiencyForLoops;pub use misc::MinimumTardinessSequencing;pub use misc::MinimumWeightAndOrGraph;pub use misc::MultiprocessorScheduling;pub use misc::NonLivenessFreePetriNet;pub use misc::Numerical3DimensionalMatching;pub use misc::NumericalMatchingWithTargetSums;pub use misc::OpenShopScheduling;pub use misc::OptimumCommunicationSpanningTree;pub use misc::PaintShop;pub use misc::Partition;pub use misc::PrecedenceConstrainedScheduling;pub use misc::PreemptiveScheduling;pub use misc::ProductionPlanning;pub use misc::QueryArg;pub use misc::RectilinearPictureCompression;pub use misc::RegisterSufficiency;pub use misc::ResourceConstrainedScheduling;pub use misc::SchedulingToMinimizeWeightedCompletionTime;pub use misc::SchedulingWithIndividualDeadlines;pub use misc::SequencingToMinimizeMaximumCumulativeCost;pub use misc::SequencingToMinimizeTardyTaskWeight;pub use misc::SequencingToMinimizeWeightedCompletionTime;pub use misc::SequencingToMinimizeWeightedTardiness;pub use misc::SequencingWithDeadlinesAndSetUpTimes;pub use misc::SequencingWithReleaseTimesAndDeadlines;pub use misc::SequencingWithinIntervals;pub use misc::ShortestCommonSupersequence;pub use misc::SquareTiling;pub use misc::StackerCrane;pub use misc::StaffScheduling;pub use misc::StringToStringCorrection;pub use misc::SubsetProduct;pub use misc::SubsetSum;pub use misc::SumOfSquaresPartition;pub use misc::Term;pub use misc::ThreePartition;pub use misc::TimetableDesign;pub use set::ComparativeContainment;pub use set::ConsecutiveSets;pub use set::ExactCoverBy3Sets;pub use set::IntegerKnapsack;pub use set::MaximumSetPacking;pub use set::MinimumCardinalityKey;pub use set::MinimumHittingSet;pub use set::MinimumSetCovering;pub use set::PrimeAttributeName;pub use set::RootedTreeStorageAssignment;pub use set::SetBasis;pub use set::SetSplitting;pub use set::ThreeDimensionalMatching;pub use set::ThreeMatroidIntersection;pub use set::TwoDimensionalConsecutiveSets;