Mathematical Programming

, Volume 43, Issue 1–3, pp 57–69 | Cite as

On the set covering polytope: I. All the facets with coefficients in {0, 1, 2}

  • Egon Balas
  • Shu Ming Ng
Article

Abstract

While the set packing polytope, through its connection with vertex packing, has lent itself to fruitful investigations, little is known about the set covering polytope. We characterize the class of valid inequalities for the set covering polytope with coefficients equal to 0, 1 or 2, and give necessary and sufficient conditions for such an inequality to be minimal and to be facet defining. We show that all inequalities in the above class are contained in the elementary closure of the constraint set, and that 2 is the largest value ofk such that all valid inequalities for the set covering polytope with integer coefficients no greater thank are contained in the elementary closure. We point out a connection between minimal inequalities in the class investigated and certain circulant submatrices of the coefficient matrix. Finally, we discuss conditions for an inequality to cut off a fractional solution to the linear programming relaxation of the set covering problem and to improve the lower bound given by a feasible solution to the dual of the linear programming relaxation.

Key words

Set covering facets polyhedral combinatorics integer programming 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    E. Balas, “Cutting planes from conditional bounds: a new approach to set covering,”Mathematical Programming Study 12 (1980) 19–36.Google Scholar
  2. [2]
    E. Balas and A. Ho, “Set covering algorithms using cutting planes, heuristics and subgradient optimization,”Mathematical Programming Study 12 (1980) 37–60Google Scholar
  3. [3]
    E. Balas and M.W. Padberg, “Set partitioning: A survey,”SIAM Review 18 (1976) 710–760.Google Scholar
  4. [4]
    V. Chvatal, “Edmonds polytopes and a hierarchy of combinatorial problems,”Discrete Mathematics 4 (1973) 305–337.Google Scholar
  5. [5]
    P.L. Hammer, E. Johnson and U. Peled, “Facets of regular 0–1 polytopes,”Mathematical Programming 8 (1974) 179–207.Google Scholar
  6. [6]
    G.L. Nemhauser and L.E. Trotter, “Properties of vertex packing and independence systems polyhedra,”Mathematical Programming 6 (1974) 48–61.Google Scholar
  7. [7]
    M.W. Padberg, “On the facial structure of set packing polyhedra,”Mathematical Programming 5 (1973) 199–216.Google Scholar
  8. [8]
    E. Zemel, “Lifting the facets of 0–1 polytopes,”Mathematical Programming 15 (1978) 268–277.Google Scholar

Copyright information

© The Mathematical Programming Society, Inc. 1989

Authors and Affiliations

  • Egon Balas
    • 1
  • Shu Ming Ng
    • 2
  1. 1.Carnegie Mellon UniversityPittsburghUSA
  2. 2.University of Southern CaliforniaLos AngelesUSA

Personalised recommendations