-

 

 

 




Optimization Online





 

A LINEAR TIME ALGORITHM FOR THE KOOPMANS-BECKMANN QAP LINEARIZATION AND RELATED PROBLEMS

Abraham Punnen(apunnen***at***sfu.ca)
Santosh Kabadi (kabadi***at***unb.ca)

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 O(n^2). We show that the QAP linearization problem for these special cases can be solved in O(n^2) time. For symmetric Koopmans-Beckmann QAP, Bookhold [4] 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.

Keywords: Quadratic Assignment problem, linearization, polynomially solvable cases

Category 1: Combinatorial Optimization

Citation: A.P. Punnen and S.N. Kabadi,A LINEAR TIME ALGORITHM FOR THE KOOPMANS-BECKMANN QAP LINEARIZATION AND RELATED PROBLEMS, Manuscript, Department of Mathematics, Simon Fraser University, June 27, 2011.

Download: [PDF]

Entry Submitted: 11/24/2011
Entry Accepted: 11/24/2011
Entry Last Modified: 11/24/2011

Modify/Update this entry


  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository

 

Submit
Update
Policies
Coordinator's Board
Classification Scheme
Credits
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society