Semidefinite relaxation approaches for the quadratic assignment problem
Citation Link: https://doi.org/10.15480/882.1304
Publikationstyp
Doctoral Thesis
Date Issued
2016
Sprache
English
Author(s)
Advisor
Referee
Title Granting Institution
Technische Universität Hamburg
Place of Title Granting Institution
Hamburg
Examination Date
2016-06-13
Institut
TORE-DOI
TORE-URI
This thesis deals with known and new relaxation techniques for the quadratic assignment problem; a fundamental combinatorial optimization problem which is often considered as one of the hardest of NP-hard problems. The focus of this thesis is on techniques for the construction of semidefinite programming relaxations.
Subjects
QAP
SDP
Relaxation
Facial Reduction
Verification
DDC Class
510: Mathematik