A low-rank bilinear programming approach for sub-optimal solution of the quadratic assignment problem |
| |
| Institution: | 1. Department of Civil Engineering and Applied Mechanics, McGill University, Montréal, QC H3A 0C3, Canada;2. Department of Earth Sciences, Schweizerischer Erdbebendienst, ETH, Zürich 8092, Switzerland;3. Department of Applied Mathematics, Moscow State University of Civil Engineering (MGSU), Moscow, Russia |
| |
| Abstract: | This paper is concerned with a new approach for solving quadratic assignment problems (QAP). We first reformulate QAP as a concave quadratic programming problem and apply an outer approximation algorithm. In addition, an improvement routine is incorporated in the final stage of the algorithm. Computational experiments on a set of standard data demonstrate that this algorithm can yield favorable results with a relatively low computational effort. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
