Comparison of Quadratic Convex Reformulations to Solve the Quadratic Assignment Problem

Abstract : We consider the (QAP) that consists in minimizing a quadratic function subject to assignment constraints where the variables are binary. In this paper, we build two families of equivalent quadratic convex formulations of (QAP). The continuous relaxation of each equivalent formulation is then a convex problem and can be used within a B&B. In this work, we focus on finding the “best” equivalent formulation within each family, and we prove that it can be computed using semidefinite programming. Finally, we get two convex formulations of (QAP) that differ from their sizes and from the tightness of their continuous relaxation bound. We present computational experiments that prove the practical usefulness of using quadratic convex formulation to solve instances of (QAP) of medium sizes.
Document type :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01500220
Contributor : Sourour Elloumi <>
Submitted on : Sunday, April 2, 2017 - 8:10:38 PM
Last modification on : Monday, February 3, 2020 - 2:28:45 PM

Identifiers

Citation

Sourour Elloumi, Amélie Lambert. Comparison of Quadratic Convex Reformulations to Solve the Quadratic Assignment Problem. cocoa 2016, 2016, Hong Kong, China. pp.726-734, ⟨10.1007%2F978-3-319-48749-6_54⟩. ⟨hal-01500220⟩

Share

Metrics

Record views

199