Skip to main content

Module prelude

Module prelude 

Source
Expand description

Prelude module for convenient imports.

Re-exportsยง

pub use crate::models::algebraic::AlgebraicEquationsOverGF2;
pub use crate::models::algebraic::ConsecutiveOnesMatrixAugmentation;
pub use crate::models::algebraic::MinimumWeightSolutionToLinearEquations;
pub use crate::models::algebraic::QuadraticAssignment;
pub use crate::models::algebraic::QuadraticCongruences;
pub use crate::models::algebraic::SimultaneousIncongruences;
pub use crate::models::algebraic::SparseMatrixCompression;
pub use crate::models::algebraic::BMF;
pub use crate::models::algebraic::QUBO;
pub use crate::models::formula::CNFClause;
pub use crate::models::formula::CircuitSAT;
pub use crate::models::formula::KSatisfiability;
pub use crate::models::formula::Maximum2Satisfiability;
pub use crate::models::formula::NAESatisfiability;
pub use crate::models::formula::NonTautology;
pub use crate::models::formula::OneInThreeSatisfiability;
pub use crate::models::formula::Planar3Satisfiability;
pub use crate::models::formula::QuantifiedBooleanFormulas;
pub use crate::models::formula::Satisfiability;
pub use crate::models::graph::AcyclicPartition;
pub use crate::models::graph::BalancedCompleteBipartiteSubgraph;
pub use crate::models::graph::BicliqueCover;
pub use crate::models::graph::BiconnectivityAugmentation;
pub use crate::models::graph::BottleneckTravelingSalesman;
pub use crate::models::graph::BoundedComponentSpanningForest;
pub use crate::models::graph::DegreeConstrainedSpanningTree;
pub use crate::models::graph::DirectedTwoCommodityIntegralFlow;
pub use crate::models::graph::DisjointConnectingPaths;
pub use crate::models::graph::GeneralizedHex;
pub use crate::models::graph::GraphPartitioning;
pub use crate::models::graph::HamiltonianCircuit;
pub use crate::models::graph::HamiltonianPath;
pub use crate::models::graph::HamiltonianPathBetweenTwoVertices;
pub use crate::models::graph::IntegralFlowBundles;
pub use crate::models::graph::IntegralFlowHomologousArcs;
pub use crate::models::graph::IntegralFlowWithMultipliers;
pub use crate::models::graph::IsomorphicSpanningTree;
pub use crate::models::graph::KClique;
pub use crate::models::graph::Kernel;
pub use crate::models::graph::KthBestSpanningTree;
pub use crate::models::graph::LengthBoundedDisjointPaths;
pub use crate::models::graph::LongestPath;
pub use crate::models::graph::MixedChinesePostman;
pub use crate::models::graph::SpinGlass;
pub use crate::models::graph::SteinerTree;
pub use crate::models::graph::StrongConnectivityAugmentation;
pub use crate::models::graph::SubgraphIsomorphism;
pub use crate::models::graph::KColoring;
pub use crate::models::graph::LongestCircuit;
pub use crate::models::graph::MaxCut;
pub use crate::models::graph::MaximalIS;
pub use crate::models::graph::MaximumClique;
pub use crate::models::graph::MaximumIndependentSet;
pub use crate::models::graph::MaximumLeafSpanningTree;
pub use crate::models::graph::MaximumMatching;
pub use crate::models::graph::MinMaxMulticenter;
pub use crate::models::graph::MinimumCutIntoBoundedSets;
pub use crate::models::graph::MinimumDominatingSet;
pub use crate::models::graph::MinimumDummyActivitiesPert;
pub use crate::models::graph::MinimumFeedbackArcSet;
pub use crate::models::graph::MinimumFeedbackVertexSet;
pub use crate::models::graph::MinimumGeometricConnectedDominatingSet;
pub use crate::models::graph::MinimumGraphBandwidth;
pub use crate::models::graph::MinimumMultiwayCut;
pub use crate::models::graph::MinimumSumMulticenter;
pub use crate::models::graph::MinimumVertexCover;
pub use crate::models::graph::MonochromaticTriangle;
pub use crate::models::graph::MultipleChoiceBranching;
pub use crate::models::graph::MultipleCopyFileAllocation;
pub use crate::models::graph::OptimalLinearArrangement;
pub use crate::models::graph::PartialFeedbackEdgeSet;
pub use crate::models::graph::PartitionIntoCliques;
pub use crate::models::graph::PartitionIntoPathsOfLength2;
pub use crate::models::graph::PartitionIntoTriangles;
pub use crate::models::graph::PathConstrainedNetworkFlow;
pub use crate::models::graph::RootedTreeArrangement;
pub use crate::models::graph::RuralPostman;
pub use crate::models::graph::ShortestWeightConstrainedPath;
pub use crate::models::graph::SteinerTreeInGraphs;
pub use crate::models::graph::TravelingSalesman;
pub use crate::models::graph::UndirectedFlowLowerBounds;
pub use crate::models::graph::UndirectedTwoCommodityIntegralFlow;
pub use crate::models::misc::AdditionalKey;
pub use crate::models::misc::BinPacking;
pub use crate::models::misc::BoyceCoddNormalFormViolation;
pub use crate::models::misc::CapacityAssignment;
pub use crate::models::misc::CbqRelation;
pub use crate::models::misc::ConjunctiveBooleanQuery;
pub use crate::models::misc::ConjunctiveQueryFoldability;
pub use crate::models::misc::ConsistencyOfDatabaseFrequencyTables;
pub use crate::models::misc::CosineProductIntegration;
pub use crate::models::misc::EnsembleComputation;
pub use crate::models::misc::ExpectedRetrievalCost;
pub use crate::models::misc::Factoring;
pub use crate::models::misc::FlowShopScheduling;
pub use crate::models::misc::GroupingBySwapping;
pub use crate::models::misc::IntegerExpressionMembership;
pub use crate::models::misc::JobShopScheduling;
pub use crate::models::misc::Knapsack;
pub use crate::models::misc::LongestCommonSubsequence;
pub use crate::models::misc::MinimumTardinessSequencing;
pub use crate::models::misc::MultiprocessorScheduling;
pub use crate::models::misc::OpenShopScheduling;
pub use crate::models::misc::PaintShop;
pub use crate::models::misc::Partition;
pub use crate::models::misc::PreemptiveScheduling;
pub use crate::models::misc::ProductionPlanning;
pub use crate::models::misc::QueryArg;
pub use crate::models::misc::RectilinearPictureCompression;
pub use crate::models::misc::ResourceConstrainedScheduling;
pub use crate::models::misc::SchedulingWithIndividualDeadlines;
pub use crate::models::misc::SequencingToMinimizeMaximumCumulativeCost;
pub use crate::models::misc::SequencingToMinimizeTardyTaskWeight;
pub use crate::models::misc::SequencingToMinimizeWeightedCompletionTime;
pub use crate::models::misc::SequencingToMinimizeWeightedTardiness;
pub use crate::models::misc::SequencingWithDeadlinesAndSetUpTimes;
pub use crate::models::misc::SequencingWithReleaseTimesAndDeadlines;
pub use crate::models::misc::SequencingWithinIntervals;
pub use crate::models::misc::ShortestCommonSupersequence;
pub use crate::models::misc::StackerCrane;
pub use crate::models::misc::StaffScheduling;
pub use crate::models::misc::StringToStringCorrection;
pub use crate::models::misc::SubsetProduct;
pub use crate::models::misc::SubsetSum;
pub use crate::models::misc::SumOfSquaresPartition;
pub use crate::models::misc::Term;
pub use crate::models::misc::ThreePartition;
pub use crate::models::misc::TimetableDesign;
pub use crate::models::set::ComparativeContainment;
pub use crate::models::set::ConsecutiveSets;
pub use crate::models::set::ExactCoverBy3Sets;
pub use crate::models::set::IntegerKnapsack;
pub use crate::models::set::MaximumSetPacking;
pub use crate::models::set::MinimumCardinalityKey;
pub use crate::models::set::MinimumHittingSet;
pub use crate::models::set::MinimumSetCovering;
pub use crate::models::set::PrimeAttributeName;
pub use crate::models::set::RootedTreeStorageAssignment;
pub use crate::models::set::SetBasis;
pub use crate::models::set::SetSplitting;
pub use crate::models::set::ThreeMatroidIntersection;
pub use crate::rules::ReduceTo;
pub use crate::rules::ReductionResult;
pub use crate::solvers::BruteForce;
pub use crate::solvers::Solver;
pub use crate::traits::Problem;
pub use crate::error::ProblemError;
pub use crate::error::Result;
pub use crate::types::And;
pub use crate::types::Extremum;
pub use crate::types::ExtremumSense;
pub use crate::types::Max;
pub use crate::types::Min;
pub use crate::types::One;
pub use crate::types::Or;
pub use crate::types::ProblemSize;
pub use crate::types::Sum;
pub use crate::types::Unweighted;