The Library
Well-solvable cases of the QAP with block-structured matrices
Tools
Tools
Tools
Çela, Eranda, Deineko, Vladimir G. and Woeginger, Gerhard J. (2015) Well-solvable cases of the QAP with block-structured matrices. Discrete Applied Mathematics, Volume 186 . pp. 56-65. doi:10.1016/j.dam.2015.01.005 ISSN 0166-218X.
Research output not available from this repository.
Request-a-Copy directly from author or use local Library Get it For Me service.
Official URL: http://dx.doi.org/10.1016/j.dam.2015.01.005
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
| Item Type: | Journal Article | ||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|
| Divisions: | Faculty of Social Sciences > Warwick Business School > Operational Research & Management Sciences Faculty of Social Sciences > Warwick Business School |
||||||||||
| Journal or Publication Title: | Discrete Applied Mathematics | ||||||||||
| Publisher: | Elsevier Science Ltd. | ||||||||||
| ISSN: | 0166-218X | ||||||||||
| Official Date: | 11 May 2015 | ||||||||||
| Dates: |
|
||||||||||
| Volume: | Volume 186 | ||||||||||
| Page Range: | pp. 56-65 | ||||||||||
| DOI: | 10.1016/j.dam.2015.01.005 | ||||||||||
| Status: | Peer Reviewed | ||||||||||
| Publication Status: | Published | ||||||||||
| Access rights to Published version: | Open Access (Creative Commons) |
Request changes or add full text files to a record
Repository staff actions (login required)
 |
View Item |
