The Quadratic Assignment Problem is Easy for Robinsonian Matrices

M. Laurent, M. Seminaroti

Research output: Book/ReportReportProfessional

Abstract

We present a new polynomially solvable case of the Quadratic Assignment Problem in Koopmans-Beckman form QAP(A;B), by showing that the identity permutation is optimal when A and B are respectively a Robinson similarity and dissimilarity matrix and one of A or B is a Toeplitz matrix. A Robinson (dis)similarity matrix is a symmetric matrix whose entries (increase) decrease monotonically along rows and columns when moving away from the diagonal, and such matrices arise in the classical seriation problem.
Original languageEnglish
Place of PublicationIthaca
PublisherCornell University Library
Number of pages14
Volume1407.2801
Publication statusPublished - 10 Jul 2014

Publication series

NamePreprint at arXiv
Volume1407.2801v1

Keywords

  • quadratic assignment problem
  • Robinson (dis)similarity
  • seriation
  • well solvable special case

Fingerprint Dive into the research topics of 'The Quadratic Assignment Problem is Easy for Robinsonian Matrices'. Together they form a unique fingerprint.

  • Cite this

    Laurent, M., & Seminaroti, M. (2014). The Quadratic Assignment Problem is Easy for Robinsonian Matrices. (Preprint at arXiv; Vol. 1407.2801v1). Cornell University Library. http://arxiv.org/pdf/1407.2801v1.pdf