Improved Bounds for a Class of 0-1 Integer Programs Using Combined Surrogate-Lagrangean Techniques
TEXAS UNIV AT AUSTIN CENTER FOR CYBERNETIC STUDIES
Pagination or Media Count:
A new method is described for calculating bounds for a special class of 0-1 integer programming problems. This method includes features of both Lagrangean and surrogate relaxation approaches. Certain binary knapsack calculations carried out in appropriate combinations together with an additivity principle provide the basis for computing the bounds.
- Operations Research