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

DOI10.1007/S10852-005-9013-2MaRDI QIDQ853797zbMATHOpenAlexFDO

Authors Vitali M. Demidenko, Gerd Finke, V. 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)

Recommendations

• Efficiently solvable cases of quadratic assignment problem with generalized monotonic and incomplete anti-Monge matrices
• Quadratic assignment problems with additively monotone matrices and incomplete anti-Monge matrices: conditions for effective solvability
• The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases
• The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: easy and hard cases
• A solvable case of the quadratic assignment problem
• Generalization of conditions for the strong solvability of a quadratic assignment problem with anti-Monge and Toeplitz matrices
• Exact solution of emerging quadratic assignment problems
• A note on a polynomial time solvable case of the quadratic assignment problem
• Two classes of quadratic assignment problems that are solvable as linear assignment problems

Cites work

• scientific article; zbMATH DE number 3982880 (Why is no real title available?)
• scientific article; zbMATH DE number 3480380 (Why is no real title available?)
• scientific article; zbMATH DE number 714526 (Why is no real title available?)
• A unified approach to simple special cases of extremal permutation problems
• Assignment Problems and the Location of Economic Activities
• Generalization of conditions for the strong solvability of a quadratic assignment problem with anti-Monge and Toeplitz matrices
• Optimal product and server locations in one-dimensional storage racks
• Quadratic assignment problems with additively monotone matrices and incomplete anti-Monge matrices: conditions for effective solvability
• Some problems in optimal allocation of large-volume memories
• The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases

Cited in

(15)

• Efficiently solvable cases of quadratic assignment problem with generalized monotonic and incomplete anti-Monge matrices
• Dynamic programming for the quadratic assignment problem on trees
• Using well-solvable quadratic assignment problems for VLSI interconnect applications
• The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: easy and hard cases
• Generalization of conditions for the strong solvability of a quadratic assignment problem with anti-Monge and Toeplitz matrices
• A parallel water flow algorithm with local search for solving the quadratic assignment problem
• A new tractable case of the QAP with a Robinson matrix
• Another well-solvable case of the QAP: maximizing the job completion time variance
• Quadratic assignment problems with additively monotone matrices and incomplete anti-Monge matrices: conditions for effective solvability
• Well-solvable cases of the QAP with block-structured matrices
• 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 linear time algorithm for the Koopmans-Beckmann QAP linearization and related problems
• New special cases of the quadratic assignment problem with diagonally structured coefficient matrices
• A new algorithm for solving a special matching problem with a general form value function under constraints

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q853797)