Does anyone know of any tools that solve the approximate minimum set cover problem?I know of the greedy algorithm (which is straightforward to implement myself), but I've also been reading about more sophisticated algorithms/heuristic that do better on many problems in practice.  (e.g., Algorithms for the Set Covering Problem by Caprara et al.)  Are there any implementations generally available?  Any tools that others can use to find approximately optimal solutions, for large problem instances?  I'd prefer to use an existing tool, rather than try to understand and implement these sophisticated algorithms myself.
Implementation that solves minimum set cover
ds.algorithms;optimization;set cover;implementation