IDEAS home Printed from https://ideas.repec.org/a/wly/navlog/v22y1975i4p791-809.html
   My bibliography  Save this article

Implicit enumeration based algorithms for postoptimizing zero‐one programs

Author

Listed:
  • Christopher J. Piper
  • Andris A. Zoltners

Abstract

It has been shown by G. Roodman that useful postoptimization capabilities for the 0‐1 integer programming problem can be obtained from an implicit enumeration algorithm modified to classify and collect all fathomed partial solutions. This paper extends the the approach as follows: 1) Improved parameter ranging formulas are obtained by higher resolution classification criteria. 2) Parameters may be changed so as to tighten the original problem, in addition to relaxing it. 3) An efficient storage structure is presented to cope with difficult data collection task implicit in this approach. 4) Finally, computer implementation is facilitated by the elaboration of a unified set of algorithms.

Suggested Citation

  • Christopher J. Piper & Andris A. Zoltners, 1975. "Implicit enumeration based algorithms for postoptimizing zero‐one programs," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 22(4), pages 791-809, December.
    • Handle: RePEc:wly:navlog:v:22:y:1975:i:4:p:791-809
    DOI: 10.1002/nav.3800220413
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.3800220413
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.3800220413?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:wly:navlog:v:22:y:1975:i:4:p:791-809. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1931-9193 .

    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.