Well solvable cases of the quadratic assignment problem with monotone and bimonotone matrices
From MaRDI portal
Publication:853797
DOI10.1007/S10852-005-9013-2zbMATH Open1121.90107OpenAlexW2002576440MaRDI QIDQ853797FDOQ853797
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
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
- The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases
- Assignment Problems and the Location of Economic Activities
- Title not available (Why is that?)
- Title not available (Why is that?)
- Optimal product and server locations in one-dimensional storage racks
- Some problems in optimal allocation of large-volume memories
- Generalization of conditions for the strong solvability of a quadratic assignment problem with anti-Monge and Toeplitz matrices
- Title not available (Why is that?)
- 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
Cited In (16)
- Polynomially solvable special cases of the quadratic bottleneck assignment problem
- Using well-solvable quadratic assignment problems for VLSI interconnect applications
- Quadratic assignment problems with additively monotone matrices and incomplete anti-Monge matrices: conditions for effective solvability
- The quadratic assignment problem is easy for Robinsonian matrices with Toeplitz structure
- New special cases of the quadratic assignment problem with diagonally structured coefficient matrices
- A new tractable case of the QAP with a Robinson matrix
- A linear time algorithm for the Koopmans-Beckmann QAP linearization and related problems
- Another well-solvable case of the QAP: maximizing the job completion time variance
- Generalization of conditions for the strong solvability of a quadratic assignment problem with anti-Monge and Toeplitz matrices
- Well-solvable cases of the QAP with block-structured matrices
- The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: easy and hard cases
- A method of estimating computational complexity based on input conditions for \(N\)-vehicle problem
- Efficiently solvable cases of quadratic assignment problem with generalized monotonic and incomplete anti-Monge matrices
- A new algorithm for solving a special matching problem with a general form value function under constraints
- A parallel water flow algorithm with local search for solving the quadratic assignment problem
- Dynamic programming for the quadratic assignment problem on trees
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)
