Skip to main content

Semidefinite programming approach for the quadratic assignment problem with a sparse graph

Author(s): Ferreira, Jose FS Bravo; Khoo, Yuehaw; Singer, Amit

Download
To refer to this page use: http://arks.princeton.edu/ark:/88435/pr1n95r
Full metadata record
DC FieldValueLanguage
dc.contributor.authorFerreira, Jose FS Bravo-
dc.contributor.authorKhoo, Yuehaw-
dc.contributor.authorSinger, Amit-
dc.date.accessioned2018-07-20T15:07:30Z-
dc.date.available2018-07-20T15:07:30Z-
dc.date.issued2018-04en_US
dc.identifier.citationFerreira, Jose FS Bravo, Khoo, Yuehaw, Singer, Amit. (2018). Semidefinite programming approach for the quadratic assignment problem with a sparse graph. COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 69 (677 - 712. doi:10.1007/s10589-017-9968-8en_US
dc.identifier.issn0926-6003-
dc.identifier.urihttp://arks.princeton.edu/ark:/88435/pr1n95r-
dc.description.abstractThe matching problem between two adjacency matrices can be formulated as the NP-hard quadratic assignment problem (QAP). Previous work on semidefinite programming (SDP) relaxations to the QAP have produced solutions that are often tight in practice, but such SDPs typically scale badly, involving matrix variables of dimension where n is the number of nodes. To achieve a speed up, we propose a further relaxation of the SDP involving a number of positive semidefinite matrices of dimension no greater than the number of edges in one of the graphs. The relaxation can be further strengthened by considering cliques in the graph, instead of edges. The dual problem of this novel relaxation has a natural three-block structure that can be solved via a convergent Alternating Direction Method of Multipliers in a distributed manner, where the most expensive step per iteration is computing the eigendecomposition of matrices of dimension . The new SDP relaxation produces strong bounds on quadratic assignment problems where one of the graphs is sparse with reduced computational complexity and running times, and can be used in the context of nuclear magnetic resonance spectroscopy to tackle the assignment problem.en_US
dc.format.extent677 - 712en_US
dc.language.isoen_USen_US
dc.relation.ispartofCOMPUTATIONAL OPTIMIZATION AND APPLICATIONSen_US
dc.rightsAuthor's manuscripten_US
dc.titleSemidefinite programming approach for the quadratic assignment problem with a sparse graphen_US
dc.typeJournal Articleen_US
dc.identifier.doidoi:10.1007/s10589-017-9968-8-
dc.date.eissued2017-11-17en_US
dc.identifier.eissn1573-2894-
pu.type.symplectichttp://www.symplectic.co.uk/publications/atom-terms/1.0/journal-articleen_US

Files in This Item:
File Description SizeFormat 
1703.09339.pdf726.08 kBAdobe PDFView/Download


Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.