Article ID Journal Published Year Pages File Type
1143096 Operations Research Letters 2007 9 Pages PDF
Abstract

We show how recent linearization methods for mixed 0–1 polynomial programs can be improved and unified through an interpretation of classical techniques. We consider quadratic expressions involving the product of a linear function and a binary variable, and extensions having products of binary variables. Computational results are reported.

Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Authors
, ,