| Article ID: | iaor20083437 |
| Country: | Netherlands |
| Volume: | 35 |
| Issue: | 4 |
| Start Page Number: | 510 |
| End Page Number: | 518 |
| Publication Date: | Jul 2007 |
| Journal: | Operations Research Letters |
| Authors: | Adams Warren P., Forrester Richard J. |
| Keywords: | programming: integer |
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.