Article ID: | iaor20061843 |
Country: | Netherlands |
Volume: | 140 |
Issue: | 1 |
Start Page Number: | 235 |
End Page Number: | 261 |
Publication Date: | Nov 2005 |
Journal: | Annals of Operations Research |
Authors: | Michelon Philippe, Gueye Serigne |
Keywords: | programming: integer |
In order to solve a quadratic 0/1 problem, some techniques, consisting in deriving a linear integer formulation, are used. Those techniques, called “linearization”, usually involve a huge number of additional variables. As a consequence, the exact resolution of the linear model is, in general, very difficult. Our aim, in this paper, is to propose “economical” linear models. Starting from an existing linearization (typically the so-called “classical linearization”), we find a new linearization with fewer variables. The resulting model is called “Miniaturized” linearization. Based on this approach, we propose a new linearization scheme for which numerical tests have been performed.