Semidefinite relaxation approaches for the quadratic assignment problem [thesis]

Marko Lange, Siegfried M. Rump, TUHH Universitätsbibliothek, TUHH Universitätsbibliothek
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.
doi:10.15480/882.1304 fatcat:x6vkuax3nfhplfr65vzqxisstq