A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

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

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

doi:10.1007/3-540-61310-2_16
fatcat:454nnukfd5hdldfolnjghef5uq