My own research on the Set Covering Problem and Weighted Set Covering Problem

This is some of my own research on SCP and WSCP. There are several programs here:

• genrandomscp and genrandomwscp are random data generators.
• scpgreedy is the Greedy Approximation of SCP.
• scpbb is the Branch-And-Bound Approximation of SCP.
• The rest are several attempts at optimizing SCP and WSCP, with different rates of success.

This is Work-In-Progress. I haven't touched these in over a year. I've been working on other things since then. I'm just using Github as a file backup. :-)

There are two Makefiles here: Makefile.gcc and Makefile.clang. It should be pretty obvious what they are and what they do. :-)

The sample-data directory contains sample data to be used with these programs.

Saying <program-name> --help will show you how to use each program.

All of this work was done on Linux (Fedora 39+).