Article thumbnail
Location of Repository

Improved compact linearizations for the unconstrained quadratic 0–1 minimization problem

By Pierre Hansen and Christophe Meyer

Abstract

AbstractWe present and compare three new compact linearizations for the quadratic 0–1 minimization problem, two of which achieve the same lower bound as does the “standard linearization”. Two of the linearizations require the same number of constraints with respect to Glover’s one, while the last one requires n additional constraints where n is the number of variables in the quadratic 0–1 problem. All three linearizations require the same number of additional variables as does Glover’s linearization. This is an improvement on the linearization of Adams, Forrester and Glover (2004) which requires n additional variables and 2n additional constraints to reach the same lower bound as does the standard linearization. Computational results show however that linearizations achieving a weaker lower bound at the root node have better global performances than stronger linearizations when solved by Cplex

Publisher: Elsevier B.V.
Year: 2009
DOI identifier: 10.1016/j.dam.2007.12.008
OAI identifier:

Suggested articles


To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.