Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
475258 | Computers & Operations Research | 2010 | 6 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Yong Xia,