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.
