A. Gupta, R. Gross, et al.
SPIE Advances in Semiconductors and Superconductors 1990
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
Michael E. Henderson
International Journal of Bifurcation and Chaos in Applied Sciences and Engineering
Satoshi Hada
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Laxmi Parida, Pier F. Palamara, et al.
BMC Bioinformatics