Symmetric Triangular Factorization for Approximating Solutions of the Quadratic Assignment Problem
摘要
Abstract
Permutation matrices resulting from triangular factorization of shifted symmetric matrices with pivoting are used as initial approximations for a series of elementary permutations improving the objective function value in the quadratic assignment problem. The proposed method is tested on 128 test problems from QAPLIB.