Mario Blaum, John L. Fan, et al.
IEEE International Symposium on Information Theory - Proceedings
Paper
Parsimonious binary-encoding in integer programming
Abstract
We describe an effective method for doing binary-encoded modeling, in the context of 0/1 linear programming, when the number of feasible configurations is not a power of two. Our motivation comes from modeling all-different restrictions. © 2005 Elsevier B.V. All rights reserved.
Related
David Cash, Dennis Hofheinz, et al.
Journal of Cryptology
Yixiong Chen, Weichuan Fang
Engineering Analysis with Boundary Elements
Tong Zhang, G.H. Golub, et al.
Linear Algebra and Its Applications