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

6Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.

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 and NP-hard, respectively.

Cite

CITATION STYLE

APA

Çela, E., Deineko, V. G., & Woeginger, G. J. (2015). Well-solvable cases of the QAP with block-structured matrices. Discrete Applied Mathematics, 186(1), 56–65. https://doi.org/10.1016/j.dam.2015.01.005

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free