IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v33y1985i4p928-933.html
   My bibliography  Save this article

Technical Note—On Generating Cutting Planes from Combinatorial Disjunctions

Author

Listed:
  • Hanif D. Sherali

    (Virginia Polytechnic Institute and State University, Blacksburg, Virginia)

  • Suvrajeet Sen

    (University of Arizona, Tucson, Arizona)

Abstract

This paper develops a technique for generating deep valid inequalities based on combinatorial disjunctions that state that at least p out of some q (≥ p ) constraints must be satisfied. This technique provides a general framework, which subsumes existing methods, for generating cutting planes based on such disjunctions. It has potential applications, for example, in multiple choice and generalized lattice point programming problems, including mixed-integer zero-one programming problems and the extreme point mathematical programming problem.

Suggested Citation

  • Hanif D. Sherali & Suvrajeet Sen, 1985. "Technical Note—On Generating Cutting Planes from Combinatorial Disjunctions," Operations Research, INFORMS, vol. 33(4), pages 928-933, August.
    • Handle: RePEc:inm:oropre:v:33:y:1985:i:4:p:928-933
    DOI: 10.1287/opre.33.4.928
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.33.4.928
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.33.4.928?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
    ---><---

    Citations

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


    Cited by:

    1. Ali Tuncel & Felisa Preciado & Ronald Rardin & Mark Langer & Jean-Philippe Richard, 2012. "Strong valid inequalities for fluence map optimization problem under dose-volume restrictions," Annals of Operations Research, Springer, vol. 196(1), pages 819-840, July.

    More about this item

    Keywords

    628 cutting plane algorithms;

    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:inm:oropre:v:33:y:1985:i:4:p:928-933. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.