Skip to main content
SpringerLink
Log in

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

  • Published:
Mathematical Programming Submit manuscript

Abstract

In an earlier paper (Mathematical Programming 43 (1989) 57–69) we characterized the class of facets of the set covering polytope defined by inequalities with coefficients equal to 0, 1 or 2. In this paper we connect that characterization to the theory of facet lifting. In particular, we introduce a family of lower dimensional polytopes and associated inequalities having only three nonzero coefficients, whose lifting yields all the valid inequalities in the above class, with the lifting coefficients given by closed form expressions.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. E. Balas and S.M. Ng, “On the set covering polytope: I. All the facets with coefficients in {0, 1, 2},”Mathematical Programming 43 (1989) 57–69.

    Google Scholar 

  2. E. Balas and E. Zemel, “Lifting and complementing yields all the facets of positive zero–one programming polytopes,” in: R.W. Cottle, M.I. Kelmanson and B. Korte, eds.,Mathematical Programming (Elsevier Science Publishers, Amsterdam, 1984) pp. 13–24.

    Google Scholar 

  3. V. Chvátal, “Edmonds polytopes and a hierarchy of combinatorial problems,”Discrete Mathematics 4 (1973) 305–337.

    Google Scholar 

  4. G. Cornuejols and A. Sassano, “On the 0, 1 facets of the set covering polytope,”Mathematical Programming 43 (1989) 45–46.

    Google Scholar 

  5. G.L. Nemhauser and L.E. Trotter, “Properties of vertex packing and independence systems polyhedra,”Mathematical Programming 6 (1974) 48–61.

    Google Scholar 

  6. M.W. Padberg, “On the facial structure of set packing polyhedra,”Mathematical Programming 5 (1973) 199–215.

    Google Scholar 

  7. U.N. Peled, “Properties of facets of binary polytopes,”Annals of Discrete Mathematics 1 (1977) 435–455.

    Google Scholar 

  8. A. Sassano, “On the facial structure of the set covering polytope,” Report No. 139, IASI (Rome, December 1985).

    Google Scholar 

  9. E. Zemel, “Lifting the facets of 0–1 polytopes,”Mathematical Programming 15 (1978) 268–277.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Carnegie Mellon University, 15213, Pittsburgh, PA, USA

    Egon Balas

  2. University of Southern California, Los Angeles, CA, USA

    Shu Ming Ng

Authors
  1. Egon Balas
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shu Ming Ng
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

The research underlying this report was supported by Grant ECS-8601660 of the National Science Foundation, Contract N00014-85-K-0198 with the Office of Naval Research, and Grant AFOSR-870292 of the Air Force Office of Scientific Research.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Balas, E., Ng, S.M. On the set covering polytope: II. Lifting the facets with coefficients in {0, 1, 2}. Mathematical Programming 45, 1–20 (1989). https://doi.org/10.1007/BF01589093

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01589093

Key words

Search

Navigation