ESTIMATING BOUNDS FOR QUADRATIC ASSIGNMENT PROBLEMS ASSOCIATED WITH HAMMING AND MANHATTAN DISTANCE MATRICES BASED ON SEMIDEFINITE PROGRAMMING

Quadratic assignment problems (QAPs) with a Hamming distance matrix for a hypercube or a Manhattan distance matrix for a rectangular grid arise frequently from communications and facility locations and are known to be among the hardest discrete optimization problems. In this paper we consider the issue of how to obtain lower bounds for those two classes of QAPs based on semidefinite programming (SDP). By exploiting the data structure of the distance matrix B, we first show that for any permutation matrix X, the matrix Y = alpha E - XBXT is positive semidefinite, where a is a properly chosen parameter depending only on the associated graph in the underlying QAP and E = ee(T) is a rank-1 matrix whose elements have value 1. This results in a natural way to approximate the original QAPs via SDP relaxation based on the matrix-splitting technique. Our new SDP relaxations have a smaller size compared with other SDP relaxations in the literature and can be solved efficiently by most open source SDP solvers. Experimental results show that for the underlying QAPs of size up to n = 200, strong bounds can be obtained effectively.