A note on a polynomial time solvable case of the quadratic assignment problem

DOI10.1016/j.disopt.2006.04.001zbMath1112.90042OpenAlexW2171280220MaRDI QIDQ865755

Güneş Erdoğan, Barbaros C. Tansel

Publication date: 20 February 2007

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11693/23641

zbMATH Keywords

solvabilityquadratic assignment problem

Mathematics Subject Classification ID

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

Related Items (5)

A linear time algorithm for the Koopmans-Beckmann QAP linearization and related problems ⋮ Characterizing linearizable QAPs by the level-1 reformulation-linearization technique ⋮ An LP-based characterization of solvable QAP instances with chess-board and graded structures ⋮ Exact Solution of Two Location Problems via Branch-and-Bound ⋮ Linear programming insights into solvable cases of the quadratic assignment problem

Uses Software

• QAPLIB

Cites Work

• A branch-and-cut algorithm for quadratic assignment problems based on linearizations
• 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
• QAPLIB - a quadratic assignment problem library
• The quadratic assignment problem. Theory and algorithms
• Assignment Problems and the Location of Economic Activities

This page was built for publication: A note on a polynomial time solvable case of the quadratic assignment problem