Zhengxin Zhang, Ziv Goldfeld, et al.
Foundations of Computational Mathematics
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
Conference paper
Generative Adversarial Symmetry Discovery
Jianke Yang, Robin Walters, et al.
ICML 2023
Frank R. Libsch, Takatoshi Tsujimura
Active Matrix Liquid Crystal Displays Technology and Applications 1997
Sankar Basu
Journal of the Franklin Institute