A solver for the (unicost) set covering problem
-
Updated
Nov 18, 2026 - C++
A solver for the (unicost) set covering problem
Minimum Hitting Set solver described in my master thesis and a subsequent research paper
Hitting Set Solver
Hitting Set Problem Lab Project for my Algorithms & Complexity course (Spring Semester 2025)
Rust algorithms for metabolic minimal cut sets: MMCS and reverse-search hitting-set enumeration, exact elementary modes, and a census of redundant search work.
A Haskell HittingSetModule.hs module exporting a function that finds (in an Integer-Programming free way) the lexicographically minimal blocking set, of minimum cardinality, of a family of sets of integers. In the spirit of Theorem 9.12(ii) and Example 9.13 from the monograph A.O. Matveev, Symmetric Cycles, Jenny Stanford Publishing, 2023.
A bounded hypergraph library that enumerates inclusion-minimal hitting sets and supplies a private-edge witness for every selected vertex, with explicit completeness and exhausted-budget states.
To associate your repository with the hitting-set topic, visit your repo's landing page and select "manage topics."