块结构矩阵的QAP的良解情形
Well-solvable cases of the QAP with block-structured matrices
摘要：
研究了二次指派问题（QAP）中两个矩阵之一具有简单块结构的特殊情况。对于第二矩阵是单调反Monge矩阵的特殊情况，我们得到了一类截问题的多项式时间结果。对于第二个底层矩阵是一个产品矩阵的特殊情况下，我们确定两组条件的块结构，使这个QAP多项式可解分别NP-困难。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
