The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: easy and hard cases

DOI10.1007/3-540-61310-2_16MaRDI QIDQ4645924zbMATH OpenOpenAlexFDO

Authors Rainer E. Burkard, Eranda Çela, Günter Rote, Gerhard J. Woeginger

Publication date 11 January 2019

Published in Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-61310-2_16

zbMATH Keywords

quadratic assignment problemregular polygonToeplitz matriceToeplitz matrixtraveling salesman problem

Mathematics Subject Classification ID

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

Recommendations

• The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases
• Well solvable cases of the quadratic assignment problem with monotone and bimonotone matrices
• The quadratic assignment problem. Theory and algorithms
• A solvable case of the quadratic assignment problem
• Quadratic assignment problems with additively monotone matrices and incomplete anti-Monge matrices: conditions for effective solvability

Cites work

• Assignment Problems and the Location of Economic Activities
• Balanced Loading
• Extreme Hamiltonian lines
• scientific article; zbMATH DE number 4199950 (Why is no real title available?)
• scientific article; zbMATH DE number 3480380 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 714526 (Why is no real title available?)
• Solving large quadratic assignment problems in parallel
• The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: easy and hard cases

Cited in

(8)

• Symmetrization of nonsymmetric quadratic assignment problems and the Hoffman-Wielandt inequality
• A solvable case of the quadratic assignment problem
• The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases
• The quadratic assignment problem is easy for Robinsonian matrices with Toeplitz structure
• Efficiently solvable cases of quadratic assignment problem with generalized monotonic and incomplete anti-Monge matrices
• The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: easy and hard cases
• A survey for the quadratic assignment problem
• Well solvable cases of the quadratic assignment problem with monotone and bimonotone matrices

This page was built for publication: The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: easy and hard cases

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