Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method

Let ( QP ) be a 0-1 quadratic program which consists in minimizing a quadratic function subject to linear equality constraints. In this paper, we present QCR, a general method to reformulate ( QP ) into an equivalent 0-1 program with a convex quadratic objective function. The reformulated problem ca...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Discrete Applied Mathematics Ročník 157; číslo 6; s. 1185 - 1197
Hlavní autori: Billionnet, Alain, Elloumi, Sourour, Plateau, Marie-Christine
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Elsevier B.V 28.03.2009
Elsevier
Predmet:
Computational Complexity
Computer Science
Convex quadratic programming
Densest [formula omitted]-subgraph
Experiments
Graph bisection
Quadratic 0-1 programming
Semidefinite programming
Task allocation
Semidefinite programming
Densest k -subgraph
Task allocation
Quadratic 0-1 programming
Convex quadratic programming
Graph bisection
Experiments
Répartition des tâches
Programmation quadratique convexe
Programmation semi-définie
K-sous-graphe plus dense
Expériences
Quadratique 0-1 programmation
Densest k-subgraph
Bissection graphique
ISSN:0166-218X, 1872-6771
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:Let ( QP ) be a 0-1 quadratic program which consists in minimizing a quadratic function subject to linear equality constraints. In this paper, we present QCR, a general method to reformulate ( QP ) into an equivalent 0-1 program with a convex quadratic objective function. The reformulated problem can then be efficiently solved by a classical branch-and-bound algorithm, based on continuous relaxation. This idea is already present in the literature and used in standard solvers such as CPLEX. Our objective in this work was to find a convex reformulation whose continuous relaxation bound is, moreover, as tight as possible. From this point of view, we show that QCR is optimal in a certain sense. State-of-the-art reformulation methods mainly operate a perturbation of the diagonal terms and are valid for any { 0 , 1 } vector. The innovation of QCR comes from the fact that the reformulation also uses the equality constraints and is valid on the feasible solution domain only. Hence, the superiority of QCR holds by construction. However, reformulation by QCR requires the solution of a semidefinite program which can be costly from the running time point of view. We carry out a computational experience on three different combinatorial optimization problems showing that the costly computational time of reformulation by QCR can however result in a drastically more efficient branch-and-bound phase. Moreover, our new approach is competitive with very specific methods applied to particular optimization problems.
ISSN:0166-218X
1872-6771
DOI:10.1016/j.dam.2007.12.007