| Article ID: | iaor19931541 |
| Country: | United Kingdom |
| Volume: | 43 |
| Issue: | 5 |
| Start Page Number: | 483 |
| End Page Number: | 493 |
| Publication Date: | May 1992 |
| Journal: | Journal of the Operational Research Society |
| Authors: | Mitra G., El-Darzi E. |
| Keywords: | sets |
Graph theoretic relaxations are used to design tree search algorithms for set-covering and set-partitioning problems. In this paper two assignment relaxations for the set-covering and set-partitioning problems are presented and a tree search method is developed which makes use of these relaxations. Computational experience of processing a collection of test problems is reported.