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

Technical Note—Stronger Inequalities for 0-1 Integer Programming: Computational Refinements

Author

Listed:
  • Ferydoon Kianfar

    (Arya-Mehr University of Technology, Teheran, Iran)

Abstract

This paper presents computational refinements to minimize the number of iterations involved in finding stronger cuts and constraints for 0-1 integer programming by the method presented in an earlier paper, “Stronger Inequalities for 0, 1 integer Programming Using Knapsack Functions.” We show that the savings in number of iterations between an optimally-sequenced cut-strengthening procedure and the procedure of the author's earlier paper can be very substantial. For example, for strengthening a cut with 200 0-1 variables this reduction can be 17,250 iterations.

Suggested Citation

  • Ferydoon Kianfar, 1976. "Technical Note—Stronger Inequalities for 0-1 Integer Programming: Computational Refinements," Operations Research, INFORMS, vol. 24(3), pages 581-585, June.
    • Handle: RePEc:inm:oropre:v:24:y:1976:i:3:p:581-585
    DOI: 10.1287/opre.24.3.581
    as

    Download full text from publisher

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

    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:inm:oropre:v:24:y:1976:i:3:p:581-585. 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.