Coefficient reduction for knapsack-like constraints in 0-1 programs with variable upper bounds

Abstract

The notion of coefficient reduction is extended for 0-1 knapsack-like constraints by taking advantage of the special structure of variable bounding constraints. Our procedure produces reductions not detected by myopic coefficient reduction methods. © 1990.