  


Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem
Etienne De Klerk (e.deklerkuvt.nl) Abstract: We consider semidefinite programming relaxations of the quadratic assignment problem, and show how to exploit group symmetry in the problem data. Thus we are able to compute the best known lower bounds for several instances of quadratic assignment problems from the problem library: [R.E. Burkard, S.E. Karisch, F. Rendl. QAPLIB  a quadratic assignment problem library. Journal on Global Optimization}, 10: 291403, 1997]. Keywords: quadratic assignment problem, semidefinite programming Category 1: Linear, Cone and Semidefinite Programming (Semidefinite Programming ) Citation: Mathematical Programming A, to appear. Note: Theorem 7.3 is incorrect as stated in the journal version, but correct in the version posted here. Download: [PDF] Entry Submitted: 06/13/2007 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  