Implicit enumeration based algorithms for postoptimizing zero‐one programs

Christopher J. Piper and Andris A. Zoltners

Naval Research Logistics Quarterly, 1975, vol. 22, issue 4, 791-809

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.

Date: 1975
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/nav.3800220413

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navlog:v:22:y:1975:i:4:p:791-809

Access Statistics for this article

More articles in Naval Research Logistics Quarterly from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().