Imran Nasim, Michael E. Henderson
Mathematics
We consider the well-known minimum quadratic assignment problem. In this problem we are given two n × n nonnegative symmetric matrices A = (a ij) and B = (bij). The objective is to compute a permutation π of V = {1,⋯,n} so that ∑ i,jεVi≠j aπ(i),π(j)bi,j is minimized. We assume that A is a 0/1 incidence matrix of a graph, and that B satisfies the triangle inequality. We analyze the approximability of this class of problems by providing polynomial bounded approximations for some special cases, and inapproximability results for other cases. © 2009 ACM.
Imran Nasim, Michael E. Henderson
Mathematics
Paul J. Steinhardt, P. Chaudhari
Journal of Computational Physics
F. Odeh, I. Tadjbakhsh
Archive for Rational Mechanics and Analysis
George Markowsky
J. Math. Anal. Appl.