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

DOI10.1007/s10852-005-9013-2zbMath1121.90107OpenAlexW2002576440MaRDI QIDQ853797

Gerd Finke, Vitali M. Demidenko, Valery S. Gordon

Publication date: 17 November 2006

Published in: JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10852-005-9013-2

zbMATH Keywords

quadratic assignment problemspecial case

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (7)

A linear time algorithm for the Koopmans-Beckmann QAP linearization and related problems ⋮ A parallel water flow algorithm with local search for solving the quadratic assignment problem ⋮ Using well-solvable quadratic assignment problems for VLSI interconnect applications ⋮ Dynamic programming for the quadratic assignment problem on trees ⋮ A method of estimating computational complexity based on input conditions for \(N\)-vehicle problem ⋮ The quadratic assignment problem is easy for Robinsonian matrices with Toeplitz structure ⋮ A new algorithm for solving a special matching problem with a general form value function under constraints

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• Some problems in optimal allocation of large-volume memories
• Assignment Problems and the Location of Economic Activities
• A unified approach to simple special cases of extremal permutation problems
• Quadratic assignment problems with additively monotone matrices and incomplete anti-Monge matrices: conditions for effective solvability

This page was built for publication: Well solvable cases of the quadratic assignment problem with monotone and bimonotone matrices