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

B.L. Dietrich; L.F. Escudero

doi:10.1016/0167-6377(90)90034-3

Operations Research Letters

Paper

01 Jan 1990

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

View publication

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.

Paper