Abstract
An instance of the quadratic assignment problem (QAP) with cost matrix Q is said to be linearizable if there exists an instance of the linear assignment problem (LAP) with cost matrix C such that for each assignment, the QAP and LAP objective function values are identical. The QAP linearization problem can be solved in O(n4) time. However, for the special cases of Koopmans–Beckmann QAP and the multiplicative assignment problem the input size is of Ω(n2). We show that the QAP linearization problem for these special cases can be solved in O(n2) time. For symmetric Koopmans–Beckmann QAP, Bookhold [I. Bookhold, A contribution to quadratic assignment problems, Optimization 21 (1990) 933–943.] gave a sufficient condition for linearizability and raised the question if the condition is necessary. We show that Bookhold’s condition is also necessary for linearizability of symmetric Koopmans–Beckmann QAP.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
