Expand description
Problem model implementations.
Each sub-module groups related problem types by input structure.
Re-exports§
pub use algebraic::ClosestVectorProblem;pub use algebraic::BMF;pub use algebraic::ILP;pub use algebraic::QUBO;pub use formula::CNFClause;pub use formula::CircuitSAT;pub use formula::KSatisfiability;pub use formula::Satisfiability;pub use graph::BicliqueCover;pub use graph::GraphPartitioning;pub use graph::KColoring;pub use graph::MaxCut;pub use graph::MaximalIS;pub use graph::MaximumClique;pub use graph::MaximumIndependentSet;pub use graph::MaximumMatching;pub use graph::MinimumDominatingSet;pub use graph::MinimumFeedbackVertexSet;pub use graph::MinimumVertexCover;pub use graph::SpinGlass;pub use graph::TravelingSalesman;pub use misc::BinPacking;pub use misc::Factoring;pub use misc::Knapsack;pub use misc::PaintShop;pub use misc::SubsetSum;pub use set::MaximumSetPacking;pub use set::MinimumSetCovering;