Ronen Feldman, Martin Charles Golumbic
Ann. Math. Artif. Intell.
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.
Ronen Feldman, Martin Charles Golumbic
Ann. Math. Artif. Intell.
Minghong Fang, Zifan Zhang, et al.
CCS 2024
John R. Kender, Rick Kjeldsen
IEEE Transactions on Pattern Analysis and Machine Intelligence
David L. Shealy, John A. Hoffnagle
SPIE Optical Engineering + Applications 2007