Abstract
Given a family of subsetsℱ of an arbitrary groundsetE, acover ofℱ is any setC ⊂E having non-empty intersection with every subset inℱ.
In this paper we deal with thecovering polytope, i.e., the convex hull of the incidence vectors of all the covers ofℱ. In Section 2 we review all the known properties of the covering polytope. In Sections 3 and 4 we introduce two new classes of non-Boolean facets of such a polytope. In Sections 5 and 6 we describe some non-sequential lifting procedures. In Section 7 a generalization of the notion ofweb introduced by L.E. Trotter is presented together with the facets of the covering polytope produced by such a structure.
Moreover, the strong connections between several combinatorial problems and the covering problem are pointed out and, exploiting those connections, some examples are presented of new facets for the Knapsack and Acyclic Subdigraph polytopes.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
E. Balas, “Facets of the knapscak polytope,”Mathematical Programming 8 (1975) 146–164.
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 S.M. Ng, “On the set covering polytope: I. All the facets with coefficients in {0, 1, 2},” Management Science Research Report n. MSRR-522, Graduate School of Industrial Administration, Carnegie Mellon University (Pittsburgh, PA, 1986).
E. Balas and E. Zemel, “Facets of the knapsack polytope from minimal covers,”SIAM Journal on Applied Mathematics 34 (1978) 119–148.
N. Christofides and S. Korman, “A computational survey of methods for the set covering problem,” Report 73/2, Imperial College of Science and Technology (London, 1973).
M. Conforti and M. Laurent, “On the facial structure of independence systems polyhedra,” preprint New York University (New York, NY, 1986).
G. Cornuejols and A. Sassano, “On the 0, 1 facets of the set covering polytope,”Mathematical Programming, 43 (1989) 45–55.
H. Crowder, E.L. Johnson and M.W. Padberg, “Solving large-scale zero–one linear programming problems,”Operations Research 31 (1983) 803–834.
R. Euler, M. Jünger and G. Reinelt, “Generalization of cliques, odd cycles and anticyles and their relation to independence system polyhedra,” Preprint n. 16, Matematisches Institut Universität Augsburg (Augsburg, 1984).
D.R. Fulkerson, G.L. Nemhauser and L.E. Trotter, “Two computationally difficult set covering problems that arise in computing the 1-width of incidence matrices of Steiner triple systems,”Mathematical Programming Study 2 (1974) 72–81.
E.S. Gottlieb and M.R. Rao, “Facets of the knapsack polytope derived from disjoint and overlapping index configurations,” Technical Report, New York University (New York, NY, 1987).
M. Grötschel, M. Jünger and G. Reinelt, “On the acyclic subgraph polytope,”Mathematical Programming 53 (1985) 28–42.
M. Grötschel, M. Jünger and G. Reinelt, “A cutting plane algorithm for the linear ordering problem,”Operations Research 32 (1984) 1195–1220.
M. Laurent, “A generalization of antiwebs to independence systems and their canonical facets,”Mathematical Programming 45 (1989) 97–108, this issue.
C.E. Lemke, H.M. Salkin and K. Spielberg, “Set covering by single-branch enumeration with linear programming subproblems,”Operations Research 19 (1971) 998–1022.
G.L. Nemhauser and L.E. Trotter, “Properties of vertex packing and independence system polyhedra,”Mathematical Programming 6 (1974) 48–61.
M.W. Padberg, “Covering, packing and knapsack problems,”Annals of Discrete Mathematics 4 (1979) 265–287.
M.W. Padberg, “(1,k)-Configurations and facets for packing problems,”Mathematical Programming 18 (1980) 94–99.
U. Peled, “Properties of the facets of binary polytopes,”Annals of Discrete Mathematics 1 (1977) 435–456.
A. Sassano, “On the facial structure of the set covering polytope,”Mathematical Programming 44 (1989) 181–202.
Y. Sekiguchi, “A note on node packing polytopes on hypergraphs,”Operations Research Letters 5 (1983) 243–247.
L.E. Trotter, “A class of facet producing graphs for vertex packing polyhedra,”Discrete Mathematics 12 (1975) 373–388.
L.A. Wolsey, “Faces for a linear inequality in 0–1 variables,”Mathematical Programming 8 (1975) 165–178.
L.A. Wolsey, “Further facet generating procedures for vertex packing polytopes,”Mathematical Programming 11 (1976) 158–163.
E. Zemel, “Lifting the facets of zero–one polytopes,”Mathematical Programming 15 (1978) 268–277.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Nobili, P., Sassano, A. Facets and lifting procedures for the set covering polytope. Mathematical Programming 45, 111–137 (1989). https://doi.org/10.1007/BF01589100
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01589100