The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases
From MaRDI portal
Publication:1290637
DOI10.1007/BF01585868zbMath0949.90077MaRDI QIDQ1290637
Eranda Çela, Rainer E. Burkard, Gerhard J. Woeginger, Günter Rote
Publication date: 28 June 1999
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Related Items
Linearizable special cases of the QAP ⋮ Complexity and Polynomially Solvable Special Cases of QUBO ⋮ Optimal wire ordering and spacing in low power semiconductor design ⋮ Unshuffling a square is NP-hard ⋮ A survey for the quadratic assignment problem ⋮ Well solvable cases of the quadratic assignment problem with monotone and bimonotone matrices ⋮ Efficiently solvable special cases of hard combinatorial optimization problems ⋮ A note on a polynomial time solvable case of the quadratic assignment problem ⋮ A linear time algorithm for the Koopmans-Beckmann QAP linearization and related problems ⋮ Robinsonian matrices: recognition challenges ⋮ Perspectives of Monge properties in optimization ⋮ The bilinear assignment problem: complexity and polynomially solvable special cases ⋮ The doubly graded matrix cone and Ferrers matrices ⋮ A parallel water flow algorithm with local search for solving the quadratic assignment problem ⋮ Using well-solvable quadratic assignment problems for VLSI interconnect applications ⋮ Characterizing linearizable QAPs by the level-1 reformulation-linearization technique ⋮ One-Dimensional Carousel Storage Problems: Applications, Review and Generalizations ⋮ An LP-based characterization of solvable QAP instances with chess-board and graded structures ⋮ The multi-stripe travelling salesman problem ⋮ Efficiently solvable cases of quadratic assignment problem with generalized monotonic and incomplete anti-Monge matrices ⋮ The Wiener maximum quadratic assignment problem ⋮ Graph Similarity and Approximate Isomorphism ⋮ New special cases of the quadratic assignment problem with diagonally structured coefficient matrices ⋮ Another well-solvable case of the QAP: maximizing the job completion time variance ⋮ Selected topics on assignment problems ⋮ Dynamic programming for the quadratic assignment problem on trees ⋮ A New Tractable Case of the QAP with a Robinson Matrix ⋮ String shuffle: circuits and graphs ⋮ 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 ⋮ Bilinear Assignment Problem: Large Neighborhoods and Experimental Analysis of Algorithms ⋮ The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases ⋮ Linear programming insights into solvable cases of the quadratic assignment problem ⋮ A unified approach to simple special cases of extremal permutation problems ⋮ Well-solvable cases of the QAP with block-structured matrices
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Extreme Hamiltonian lines
- Balancing hydraulic turbine runners - A discrete combinatorial optimization problem
- The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases
- Solving large quadratic assignment problems in parallel
- Perspectives of Monge properties in optimization
- Some problems in optimal allocation of large-volume memories
- The Quadratic Assignment Problem
- Assignment Problems and the Location of Economic Activities
- Balanced Loading
