| Article ID: | iaor1989703 |
| Country: | Netherlands |
| Volume: | 8 |
| Issue: | 2 |
| Start Page Number: | 67 |
| End Page Number: | 71 |
| Publication Date: | Apr 1989 |
| Journal: | Operations Research Letters |
| Authors: | Feo Thomas A., Resende Mauricio G.C. |
An efficient probabilistic set covering heuristic is presented. The heuristic is evaluated on empirically difficult to solve set covering problems that arise from Steiner triple systems. The optimal solution to only a few of these instances is known. The heuristic provides these solutions as well as the best known solutions to all other instances attempted.