Efficiently solvable cases of quadratic assignment problem with generalized monotonic and incomplete anti-Monge matrices

DOI10.1007/s10559-007-0030-1zbMath1135.90367OpenAlexW2073641974MaRDI QIDQ2458114

Yanyan Li

Publication date: 31 October 2007

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-007-0030-1

zbMATH Keywords

Toeplitz matrixquadratic assignment problemefficiently solvable caseslimited versionsmonotonic anti-Monge matrices

Mathematics Subject Classification ID

Integer programming (90C10) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items (2)

A linear time algorithm for the Koopmans-Beckmann QAP linearization and related problems ⋮ Subclasses of solvable problems from classes of combinatorial optimization problems

Cites Work

• The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases
• Optimal product and server locations in one-dimensional storage racks
• Perspectives of Monge properties in optimization
• Some problems in optimal allocation of large-volume memories
• Assignment Problems and the Location of Economic Activities
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Efficiently solvable cases of quadratic assignment problem with generalized monotonic and incomplete anti-Monge matrices