Sánchez García, MiguelSobrón Fernández, María InésVitoriano, Begoña2023-06-202023-06-201998E. Balas and M. Ng, On the set covering polytope: I. All the facets with coefficients in {0, 1, 2}, Mathematical Programming 43(1989]57–69. E. Balas and M. Ng, On the set covering polytope: II. All the facets with coefficients in {0, 1, 2}, Mathematical Programming 45(1989)1–20. G. Cornuéjols and A. Sassano, On the 0, 1 facets of the set covering polytope, Mathematical Programming 43(1989)45–55. M. Sánchez, M.I. Sobrón and C. Espinel, Facetas del politopo de recubrimiento con coeficientes en {0, 1, 2, 3}, Trabajos de Investigación Operativa 7(1992)31–41. A. Sassano, On the facial structure of the set covering polytope, Mathematical Programming 44 (1989)181–202. B. Vitoriano, Bloques –Antibloques. Relación con los problemas de recubrimiento y empaquetado, Doctoral Thesis, Universidad Complutense de Madrid, 1994.0254-533010.1023/A:1018969410431https://hdl.handle.net/20.500.14352/57923Balas and Ng [1,2] 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.engjournal articlehttp://download.springer.com/static/pdf/772/art%253A10.1023%252FA%253A1018969410431.pdf?auth66=1362498077_a20ac7d2d50f37e5cf4ba2af58951e31&ext=.pdfhttp://link.springer.com/restricted access519.8Polyhedral combinatoricsCombinatorial optimizationValid inequalitiesSet coveringFacetsInvestigación operativa (Matemáticas)1207 Investigación Operativa