R.A. Brualdi, A.J. Hoffman
Linear Algebra and Its Applications
Paper
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.
Related
Joy Y. Cheng, Daniel P. Sanders, et al.
SPIE Advanced Lithography 2008
Zhengxin Zhang, Ziv Goldfeld, et al.
Foundations of Computational Mathematics
Laxmi Parida, Pier F. Palamara, et al.
BMC Bioinformatics