Well-solvable cases of the QAP with block-structured matrices

E. Çela, V.G. Deineko, G.J. Woeginger

Research output: Book/ReportReportAcademic

84 Downloads (Pure)

Abstract

We investigate special cases of the quadratic assignment problem (QAP) where one of the two underlying matrices carries a simple block structure. For the special case where the second underlying matrix is a monotone anti-Monge matrix, we derive a polynomial time result for a certain class of cut problems. For the special case where the second underlying matrix is a product matrix, we identify two sets of conditions on the block structure that make this QAP polynomially solvable respectively NP-hard.
Original languageEnglish
Publishers.n.
Number of pages16
Publication statusPublished - 2014

Publication series

NamearXiv
Volume1402.3500 [math.OC]

Fingerprint Dive into the research topics of 'Well-solvable cases of the QAP with block-structured matrices'. Together they form a unique fingerprint.

Cite this