Abstract
Given a bipartite graphG = (V, U, E), a cover ofG is a subset\(D \subseteq V\) with the property that each nodeu ∈ U is adjacent to at least one nodev ∈D. If a positive weightc v is associated with each nodev ∈V, the covering problem (CP) is to find a cover ofG having minimum total weight.
In this paper we study the properties of the polytopeQ(G) ⊂ ℝ |V|, the convex hull of the incidence vectors of all the covers inG. After discussing some general properties ofQ(G) we introduce a large class of bipartite graphs with special structure and describe several types of rank facets of the associated polytopes.
Furthermore we present two lifting procedures to derive valid inequalities and facets of the polytopeQ(G) from the facets of any polytopeQ(G′) associated with a subgraphG′ ofG. An example of the application of the theory to a class of hard instances of the covering problem is also presented.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
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 MSRR-522, Graduate School of Industrial Administration, Carnegie Mellon University (Pittsburgh, 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).
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. Majoub, “K i -covers I: complexity and polytopes,”Discrete Mathematics 58 (1986) 121–142.
G. Cornuejols and A. Sassano, “On the 0, 1 facets of the set covering polytope,” IASI-CNR Report 153 (Rome, 1986).
D.R. Fulkerson, “Blocking and antiblocking pairs of polyhedra,”Mathematical Programming 1 (1971) 168–194.
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.
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. Nemhauser and L. Trotter, “Properties of vertex packing and independence system polyhedra,”Mathematical Programming 6 (1974) 48–61.
Shu-Ming Ng, “On the set covering problem,” Summer paper, Graduate School of Industrial Administration, Carnegie Mellon University (Pittsburgh, 1982).
M.W. Padberg, “On the facial structure of set packing polyhedra,”Mathematical Programming 5 (1973) 199–215.
M.W. Padberg, “Covering packing and knapsack problems,”Annals of Discrete Mathematics 4 (1979) 265–287.
U. Peled, “Properties of the facets of binary polytopes,”Annals of Discrete Mathematics 1 (1977) 435–456.
H.J. Ryser,Combinatorial Mathematics (John Wiley, New York, 1963).
L. Wolsey, “Faces for a linear inequality in 0–1 variables,”Mathematical Programming 8 (1975) 165–178.
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
Sassano, A. On the facial structure of the set covering polytope. Mathematical Programming 44, 181–202 (1989). https://doi.org/10.1007/BF01587087
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01587087