Bounds for the quadratic assignment problem using the bundle method
Bounds for the quadratic assignment problem using the bundle method
复制标题
DOI：
10.1007/s10107-006-0038-8
复制
发表时间：
2007-01
影响因子：
2.7
通讯作者：
F. Rendl;R. Sotirov
中科院分区：
文献类型：
--
作者：
F. Rendl;R. Sotirov
Semidefinite programming (SDP) has recently turned out to be a very powerful tool for approximating some NP-hard problems. The nature of the quadratic assignment problem (QAP) suggests SDP as a way to derive tractable relaxations. We recall some SDP relaxations of QAP and solve them approximately using a dynamic version of the bundle method. The computational results demonstrate the efficiency of the approach. Our bounds are currently among the strongest ones available for QAP. We investigate their potential for branch and bound settings by looking also at the bounds in the first levels of the branching tree.
