Parsimonious Binary-Encoding in Integer Programming

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. Article Download View Parsimonious Binary-Encoding in Integer Programming

A Polytope for a Product of Real Linear Functions in 0/1 Variables

In the context of integer programming, we develop a polyhedral method for linearizing a product of a pair of real linear functions in 0/1 variables. As an example, by writing a pair of integer variables in binary expansion, we have a technique for linearizing their product. We give a complete linear description for the resulting … Read more