| 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. |
