On the 0, 1 facets of the set covering polytope

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.

[1]  E. Balas,et al.  Set Partitioning: A survey , 1976 .

[2]  Egon Balas,et al.  On the set covering polytope: I. All the facets with coefficients in {0, 1, 2} , 1986, Math. Program..

[3]  D. Chinhyung Cho,et al.  On the Uncapacitated Plant Location Problem. II: Facets and Lifting Theorems , 1983, Math. Oper. Res..

[4]  D. R. Fulkerson,et al.  On balanced matrices , 1974 .

[5]  Egon Balas,et al.  Critical Cutsets of Graphs and Canonical Facets of Set-Packing Polytopes , 1977, Math. Oper. Res..

[6]  V. Chvátal.  On certain polytopes associated with graphs , 1975 .

[7]  Egon Balas,et al.  Set Covering with Cutting Planes from Conditional Bounds. , 1977 .

[8]  Leslie E. Trotter,et al.  Properties of vertex packing and independence system polyhedra , 1974, Math. Program..

[9]  Manfred W. Padberg,et al.  On the facial structure of set packing polyhedra , 1973, Math. Program..

[10]  L. A. Wolsey,et al.  Further facet generating procedures for vertex packing polytopes , 1976, Math. Program..

[11]  Andrew C. Ho,et al.  Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study , 1980 .

[12]  E. Balas.  Cutting planes from conditional bounds: A new approach to set covering , 1980 .

[13]  Gérard Cornuéjols,et al.  Some facets of the simple plant location polytope , 1982, Math. Program..

[14]  Antonio Sassano,et al.  On the facial structure of the set covering polytope , 1989, Math. Program..

[15]  Ali Ridha Mahjoub,et al.  Ki-covers I: Complexity and polytopes , 1986, Discret. Math..

[16]  Leslie E. Trotter,et al.  A class of facet producing graphs for vertex packing polyhedra , 1975, Discret. Math..