A. Skumanich
SPIE OE/LASE 1992
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
Leo Liberti, James Ostrowski
Journal of Global Optimization
Michael E. Henderson
International Journal of Bifurcation and Chaos in Applied Sciences and Engineering
Zhihua Xiong, Yixin Xu, et al.
International Journal of Modelling, Identification and Control