| Article ID: | iaor1999988 |
| Country: | Netherlands |
| Volume: | 81 |
| Issue: | 1 |
| Start Page Number: | 343 |
| End Page Number: | 356 |
| Publication Date: | Jul 1998 |
| Journal: | Annals of Operations Research |
| Authors: | Snchez-Garca M., Sobrn M.I., Vitoriano B. |
| Keywords: | combinatorial analysis, combinatorial optimization |
Balas and Ng characterized the class of valid inequalities for the set covering polytope with coefficients equal to 0, 1 or 2, and gave necessary and sufficient conditions for such an inequality to be facet defining. We extend this study, characterizing the class of valid inequalities with coefficients equal to 0, 1, 2, or 3, and giving necessary and sufficient conditions for such an inequality to be not dominated, and to be facet defining.