Python implementation of the 'Greedy' and 'Branch and Bound' algorithms to resolve the Set Cover problem
-
Updated
Dec 13, 2019 - Python
#
setcoveringproblem
Here are 4 public repositories matching this topic...
Given a number of sets with a number of universes,this algorithm finds the least sets with the most universes
-
Updated
Jan 17, 2019 - C
Scientific production thought my academic life (under graduation, masters, PhD)
java
real-time
cplusplus
graph-algorithms
snmp
simulations
cplex
wsn
optimization-algorithms
qos
algorithms-and-data-structures
approximation-algorithms
setcoveringproblem
-
Updated
Nov 21, 2023 - TeX
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.
-
Updated
Jul 22, 2020 - Python
Improve this page
Add a description, image, and links to the setcoveringproblem topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the setcoveringproblem topic, visit your repo's landing page and select "manage topics."