Abstract
In this paper, we consider inequalities of the formΣ α jxj ≥ β, whereα j equals 0 or 1, andβ is a positive integer. We give necessary and sufficient conditions for such inequalities to define facets of the set covering polytope associated with a 0, 1 constraint matrixA. These conditions are in terms of critical edges and critical cutsets defined in the bipartite incidence graph ofA, and are in the spirit of the work of Balas and Zemel on the set packing problem where similar notions were defined in the intersection graph ofA. Furthermore, we give a polynomial characterization of a class of 0, 1 facets defined from chorded cycles of the bipartite incidence graph. This characterization also yields all the 0, 1 liftings of odd-hole inequalities for the simple plant location polytope.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
E. Balas, “Set covering with cutting planes from conditional bounds,” in: A. Prekopa, ed.,Survey of Mathematical Programming (North-Holland, Amsterdam, 1979) pp. 393–422.
E. Balas, “Cutting planes from conditional bounds: A new approach to set covering,”Mathematical Programming Study 12 (1980) 19–36.
E. Balas and A. C. Ho, “Set covering algorithms using cutting planes, heuristics, and subgradient optimization: a computational study,”Mathematical Programming Study 12 (1980) 37–60.
E. Balas and M. Padberg, “Set Partitioning: A Survey,”SIAM Review 18 (1976) 710–760.
E. Balas and Shu-Ming Ng, “Some classes of facets of the set covering polytope,” Research Report, Graduate School of Industrial Administration, Carnegie Mellon University (Pittsburgh, PA, 1984).
E. Balas and Shu-Ming Ng, “On the set covering polytope: I. All the facets with coefficients in {0, 1, 2},” Research Report MSRR-522, Graduate School of Industrial Administration, Carnegie Mellon University (Pittsburgh, PA, 1986).
E. Balas and E. Zemel, “Critical cutsets of graphs and canonical facets of set-packing polytopes,”Mathematics of Operations Research 2 (1977) 15–19.
C. Berge, “Balanced Matrices,”Mathematical Programming 2 (1972) 19–31.
D.C. Cho, M. Padberg and M.R. Rao, “On the uncapacitated plant location problem. II. Facets and Lifting theorems,”Mathematics of Operations Research 8 (1983) 590–612.
V. Chvàtal, “On certain polytopes associated with graphs,”Journal of Combinatorial Theory B 18 (1975) 138–154.
M. Conforti, D.G. Corneil and A.R. Mahjoub, “K i-covers I: Complexity and polytopes,”Discrete Mathematics 58 (1986) 121–142.
G. Cornuéjols and J.M. Thizy, “Some facets of the simple plant location polytope,”Mathematical Programming 23 (1982) 50–74.
D.R. Fulkerson, A.J. Hoffman and R. Oppenheim, “On balanced matrices,”Mathematical Programming Study 1 (1974) 120–132.
J. Hooker, “Generalized resolution and cutting planes,” Research Report n. MSRR 524, Graduate School of Industrial Administration, Carnegie Mellon University (Pittsburgh, PA, 1986).
M. Laurent, “A generalization of antiwebs to independence systems and their relation to set covering polytopes,” Technical Report, CNET PAATIM (Issy les Moulineaux, France, 1987).
G.L. Nemhauser and L.E. Trotter, “Properties of vertex packing and independence system polyhedra,”Mathematical Programming 6 (1974) 48–61.
M.W. Padberg, “On the facial structure of set packing polyhedra,”Mathematical Programming 5 (1973) 199–215.
A. Sassano, “On the facial structure of the set covering polytope,” IASI-CNR Report nr. 132 (Rome, 1985).
L.E. Trotter, “A class of facet producing graphs for vertex packing polyhedra,”Discrete Mathematics 12 (1975) 373–388.
L.A. Wolsey, “Further facet generating procedures for vertex packing polytopes,”Mathematical Programming 11 (1976) 158–163.
Author information
Authors and Affiliations
Additional information
Research partially supported by NSF grant ECS-8601660 and AFORS grant 87-0292.
Rights and permissions
About this article
Cite this article
Cornuéjols, G., Sassano, A. On the 0, 1 facets of the set covering polytope. Mathematical Programming 43, 45–55 (1989). https://doi.org/10.1007/BF01582277
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01582277