| Article ID: | iaor19961690 |
| Country: | United Kingdom |
| Volume: | 46 |
| Issue: | 10 |
| Start Page Number: | 1260 |
| End Page Number: | 1268 |
| Publication Date: | Oct 1995 |
| Journal: | Journal of the Operational Research Society |
| Authors: | Paschos Vangelis Th., Afif Mohamed, Hifi Mhand, Zissimopoulos Vassilis |
| Keywords: | heuristics |
This paper solves approximately the minimum set covering problem by developing a new heuristic, which is essentially based on the flow algorithm originally developed by Ford and Fulkerson. The paper performs a comparative study of the performances (concerning solution qualities and execution times) of the flow algorithm as well as of the natural greedy heuristic for set covering originally studied by Johnson and Lovász.