A new matrix splitting based relaxation for the quadratic assignment problem

Marko Lange

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Nowadays, the quadratic assignment problem (QAP) is widely considered as one of the hardest of the NP-hard problems. One of the main reasons for this consideration can be found in the enormous difficulty of computing good quality bounds for branch-and-bound algorithms. The practice shows that even with the power of modern computers QAPs of size n>30 are typically recognized as huge computational problems. In this work, we are concerned with the design of a new low-dimensional semidefinite programming relaxation for the computation of lower bounds of the QAP. We discuss ways to improve the bounding program upon its semidefinite relaxation base and give numerical examples to demonstrate its applicability.

Original languageEnglish
Title of host publicationMathematical Aspects of Computer and Information Sciences - 6th International Conference, MACIS 2015, Revised Selected Papers
PublisherSpringer Verlag
Pages535-549
Number of pages15
Volume9582
ISBN (Print)9783319328584
DOIs
Publication statusPublished - 2016
Externally publishedYes
Event6th International Conference on Mathematical Aspects of Computer and Information Sciences, MACIS 2015 - Berlin, Germany
Duration: 2015 Nov 112015 Nov 13

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9582
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other6th International Conference on Mathematical Aspects of Computer and Information Sciences, MACIS 2015
CountryGermany
CityBerlin
Period15/11/1115/11/13

Keywords

  • Quadratic assignment problem
  • Relaxation
  • Semidefinite programming

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'A new matrix splitting based relaxation for the quadratic assignment problem'. Together they form a unique fingerprint.

Cite this