Parsimonious binary-encoding in integer programming

Authors:
Don Coppersmith;Jon Lee
Affiliations:
IBM T.J. Watson Research Center, P.O. Box 218, Yorktown Heights, NY 10598, USA;IBM T.J. Watson Research Center, P.O. Box 218, Yorktown Heights, NY 10598, USA
Venue:
Discrete Optimization
Year:
2005

Citing 1
Cited 1

Geometric comparison of combinatorial polytopes

Discrete Applied Mathematics

Mixed-Integer Models for Nonseparable Piecewise-Linear Optimization: Unifying Framework and Extensions

Operations Research

Quantified Score

Hi-index	0.00

Visualization

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.