Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem
研究了二次分配问题的半定规划松弛，通过利用问题数据中的群对称性，计算出了多个实例的最佳已知下界。
We consider semidefinite programming relaxations of the quadratic assignment problem, and show how to exploit group symmetry in the problem data. Thus we are able to compute the best known lower bounds for several instances of quadratic assignment problems from the problem library: (Burkard et al. in J Global Optim 10:291–403, 1997).