The quadratic assignment problem with a monotone anti-monge and a symmetric toeplitz matrix: Easy and hard cases

DOI10.1007/3-540-61310-2_16zbMath1414.90192OpenAlexW2109149676MaRDI QIDQ4645924

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

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

Toeplitz matrixquadratic assignment problemtraveling salesman problemregular polygonToeplitz matrice

Mathematics Subject Classification ID

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

Related Items

A survey for the quadratic assignment problem ⋮ 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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Extreme Hamiltonian lines
• Solving large quadratic assignment problems in parallel
• Assignment Problems and the Location of Economic Activities
• Balanced Loading
• The quadratic assignment problem with a monotone anti-monge and a symmetric toeplitz matrix: Easy and hard cases