Back to Search
Start Over
Bounds for the quadratic assignment problem using the bundle method.
- Source :
-
Mathematical Programming . Feb2007, Vol. 109 Issue 2/3, p505-524. 20p. 1 Diagram, 10 Charts, 2 Graphs. - Publication Year :
- 2007
-
Abstract
- 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. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 00255610
- Volume :
- 109
- Issue :
- 2/3
- Database :
- Academic Search Index
- Journal :
- Mathematical Programming
- Publication Type :
- Academic Journal
- Accession number :
- 24716672
- Full Text :
- https://doi.org/10.1007/s10107-006-0038-8