| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10524026 | Operations Research Letters | 2005 | 7 Pages |
Abstract
A new linearization method for mixed 0-1 polynomial programs is obtained by repeatedly applying a classical strategy introduced almost 30 years ago. Two important contributions are: the most concise known linear representations of cubic and higher-degree problems, and a simple argument for explaining and extending two alternate linearizations.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Warren P. Adams, Richard J. Forrester,