Implicit Enumeration Based Algorithms for Post-optimizing Zero-One Programs.
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. The paper extends the approach as follows: (1) Improved parameter ranging formulae are obtained by higher resolution classification criteria. (2) Parameters may be changed so as to tighten the original problem, in adddition 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. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Mar 01, 1973
- Accession Number
- AD0773319
Entities
People
- Andris A. Zoltners
- Christopher J. Piper
Organizations
- Carnegie Mellon University