| Article ID: | iaor19951459 |
| Country: | Netherlands |
| Volume: | 15 |
| Issue: | 3 |
| Start Page Number: | 127 |
| End Page Number: | 131 |
| Publication Date: | Apr 1994 |
| Journal: | Operations Research Letters |
| Authors: | Shepherd F.B. |
The purpose of this note is to make explicit some simple consequences of Lehman’s work on minimally nonideal matrices and their connections with related results in the study of perfect graphs. In particular, the more general notions of covered and partitionable clutters are considered and a description is given of how the minimum sets of such clutters cover the nodes.