A.R. Conn, Nick Gould, et al.
Mathematics of Computation
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
R.B. Morris, Y. Tsuji, et al.
International Journal for Numerical Methods in Engineering
David W. Jacobs, Daphna Weinshall, et al.
IEEE Transactions on Pattern Analysis and Machine Intelligence
Fernando Martinez, Juntao Chen, et al.
AAAI 2025