IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v81y1998i0p343-35610.1023-a1018969410431.html
   My bibliography  Save this article

On the set covering polytope:Facets with coefficients in {0, 1, 2, 3}

Author

Listed:
  • M. Sánchez-García
  • M. Sobrón
  • B. Vitoriano

Abstract

Balas and Ng [1, 2] characterized the class of valid inequalities for the set coveringpolytope with coefficients equal to 0, 1 or 2, and gave necessary and sufficient conditionsfor such an inequality to be facet defining. We extend this study, characterizing the class ofvalid inequalities with coefficients equal to 0, 1, 2 or 3, and giving necessary and sufficientconditions for such an inequality to be not dominated, and to be facet defining. Copyright Kluwer Academic Publishers 1998

Suggested Citation

  • M. Sánchez-García & M. Sobrón & B. Vitoriano, 1998. "On the set covering polytope:Facets with coefficients in {0, 1, 2, 3}," Annals of Operations Research, Springer, vol. 81(0), pages 343-356, June.
    • Handle: RePEc:spr:annopr:v:81:y:1998:i:0:p:343-356:10.1023/a:1018969410431
    DOI: 10.1023/A:1018969410431
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/A:1018969410431
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1023/A:1018969410431?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Wei, Ningji & Walteros, Jose L., 2022. "Integer programming methods for solving binary interdiction games," European Journal of Operational Research, Elsevier, vol. 302(2), pages 456-469.
    2. Araújo, Paulo H. M. & Campêlo, Manoel & Corrêa, Ricardo C. & Labbé, Martine, 2024. "Integer programming models and polyhedral study for the geodesic classification problem on graphs," European Journal of Operational Research, Elsevier, vol. 314(3), pages 894-911.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:81:y:1998:i:0:p:343-356:10.1023/a:1018969410431. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.