A Low-Dimensional Semidefinite Relaxation for the Quadratic Assignment Problem

The quadratic assignment problem (QAP) is arguably one of the hardest NP-hard discrete optimization problems. Problems of dimension greater than 25 are still considered to be large scale. Current successful solution techniques use branch-and-bound methods, which rely on obtaining strong and inexpens...

Full description

Saved in:

Bibliographic Details
Published in:	Mathematics of operations research Vol. 34; no. 4; pp. 1008 - 1022
Main Authors:	Ding, Yichuan, Wolkowicz, Henry
Format:	Journal Article
Language:	English
Published:	Linthicum INFORMS 01.11.2009 Institute for Operations Research and the Management Sciences
Subjects:	Analysis Assignment problem Branch & bound algorithms Comparative analysis Eigenvalues interior point methods Interior points large-scale problems Mathematical inequalities Mathematical permutation Mathematical theorems Mathematical vectors Matrices Objective functions quadratic assignment problem Quadratic programming Relaxation methods (Mathematics) semidefinite programming relaxations Studies United States
ISSN:	0364-765X, 1526-5471
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!