Semidefinite relaxations of the quadratic assignment problem in a Lagrangian framework
by Frederic Roupin
International Journal of Mathematics in Operational Research (IJMOR), Vol. 1, No. 1/2, 2009

Abstract: In this article, we consider partial Lagrangian relaxations of continuous quadratic formulations of the quadratic assignment problem (QAP) where the assignment constraints are not relaxed. These relaxations are a theoretical limit for semidefinite relaxations of the QAP using any linearised quadratic equalities made from the assignment constraints. Using this framework, we survey and compare standard semidefinite relaxations of this classical NP-hard problem. In particular, this approach is a simple way to prove that some well-known semidefinite relaxations for the QAP are equivalent. Nevertheless, these relaxations have a different numerical behaviour and practical usefulness depending on the semidefinite programming solver. We discuss such issues by reporting some computational experiments.

Online publication date: Sat, 31-Jan-2009

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Mathematics in Operational Research (IJMOR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com