The quadratic assignment problem with a monotone anti-monge and a symmetric toeplitz matrix: Easy and hard cases [chapter]

Rainer E. Burkard, Eranda Çela, Günther Rote, Gerhard J. Woeginger
1996 Lecture Notes in Computer Science  
This paper investigates a restricted version of the Quadratic Assignment Problem (QAP), where one of the coefficient matrices is an Anti-Monge matrix with non-decreasing rows and columns and the other coefficient matrix is a symmetric Toeplitz matrix. This restricted version is called the Anti-Monge Toeplitz QAP. There are three well-known combinatorial problems that can be modeled via the Anti-Monge Toeplitz QAP: (P1) The "Turbine Problem", i.e. the assignment of given masses to the vertices
more » ... a regular polygon such that the distance of the center of gravity of the resulting system to the center of the polygon is minimized. (P2) The Traveling Salesman Problem on symmetric Monge distance matrices. (P3) The arrangement of data records with given access probabilities in a linear storage medium in order to minimize the average access time. We identify conditions on the Toeplitz matrix B that lead to a simple solution for the Anti-Monge-Toeplitz QAP: The optimal permutation can be given in advance without regarding the numerical values of the data. The resulting theorems generalize and unify several known results on problems (P1), (P2), and (P3). We also show that the Turbine Problem is NP-hard and consequently, that the Anti-Monge Toeplitz QAP is NPhard in general.
doi:10.1007/3-540-61310-2_16 fatcat:454nnukfd5hdldfolnjghef5uq