Richard M. Karp, Raymond E. Miller
Journal of Computer and System Sciences
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.
Richard M. Karp, Raymond E. Miller
Journal of Computer and System Sciences
Harpreet S. Sawhney
IS&T/SPIE Electronic Imaging 1994
Mario Blaum, John L. Fan, et al.
IEEE International Symposium on Information Theory - Proceedings
Ligang Lu, Jack L. Kouloheris
IS&T/SPIE Electronic Imaging 2002