Well solvable cases of the quadratic assignment problem with monotone and bimonotone matrices

Well solvable cases of the quadratic assignment problem with monotone and bimonotone matrices

0.00 Avg rating0 Votes
Article ID: iaor2007959
Country: Netherlands
Volume: 5
Issue: 2
Start Page Number: 167
End Page Number: 187
Publication Date: Jun 2006
Journal: Journal of Mathematical Modelling and Algorithms
Authors: , ,
Keywords: matrices
Abstract:

Conditions imposed on the matrices of the Quadratic Assignment Problem (QAP) are derived such that an optimum of the QAP is attained on a given permutation. These conditions describe four new sets of matrices, which, in the general case, are not anti-Monge and Toeplitz matrices that were used for most of the known well solvable special cases of the QAP.

Reviews

Required fields are marked *. Your email address will not be published.