|Start Page Number:||1027|
|End Page Number:||1032|
|Publication Date:||Jun 2010|
|Journal:||Computers and Operations Research|
In this article, we propose a Lagrangian smoothing algorithm for quadratic assignment problems, where the continuation subproblems are solved by the truncated Frank–Wolfe algorithm. We establish practical stopping criteria and show the algorithm finitely terminates at a KKT point of a continuation subproblem. The quality of the returned solution is studied in detail. Finally, limited numerical results are provided.