Python implementation of the 'Greedy' and 'Branch and Bound' algorithms to resolve the Set Cover problem
-
Updated
Dec 13, 2019 - Python
Python implementation of the 'Greedy' and 'Branch and Bound' algorithms to resolve the Set Cover problem
Scientific production thought my academic life (under graduation, masters, PhD)
Given a number of sets with a number of universes,this algorithm finds the least sets with the most universes
Implementation of the algorithms described in "A new formulation and resolution method for the p-center problem" (Elloumi et al, 2004) for the P-center problem.
Solver to use PGA for experimental purpose
To associate your repository with the setcoveringproblem topic, visit your repo's landing page and select "manage topics."