Article ID: | iaor1996575 |
Country: | Netherlands |
Volume: | 58 |
Issue: | 2 |
Start Page Number: | 236 |
End Page Number: | 249 |
Publication Date: | Apr 1992 |
Journal: | European Journal of Operational Research |
Authors: | Oral Muhittin, Kettani Ossama |
It is important to develop computationally efficient algorithms to solve combinatorial optimization problems. Equally important, if not more so, is to find a way to reformulate the original combinatorial optimization problem, provided this is possible, so that the resulting equivalent problem can be solved easily and efficiently using commercially available codes. This paper proposes an equivalent formulation to deal basically with the linearization of nonlinear expressions in 0-1 variables. The equivalent formulation technique proposed in this paper linearizes a binary quadratic integer problem of