A new matrix splitting based relaxation for the quadratic assignment problem

Marko Lange*

*この研究の対応する著者

研究成果: Conference contribution

抄録

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.

本文言語English
ホスト出版物のタイトルMathematical Aspects of Computer and Information Sciences - 6th International Conference, MACIS 2015, Revised Selected Papers
出版社Springer Verlag
ページ535-549
ページ数15
9582
ISBN(印刷版)9783319328584
DOI
出版ステータスPublished - 2016
外部発表はい
イベント6th International Conference on Mathematical Aspects of Computer and Information Sciences, MACIS 2015 - Berlin, Germany
継続期間: 2015 11月 112015 11月 13

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
9582
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

Other

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

ASJC Scopus subject areas

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

「A new matrix splitting based relaxation for the quadratic assignment problem」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル