A branch-and-cut algorithm for quadratic assignment problems based on linearizations

DOI10.1016/j.cor.2005.05.027zbMath1102.90034MaRDI QIDQ856686

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

Publication date: 7 December 2006

Published in: Computers \& Operations Research (Search for Journal in Brave)

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

zbMATH Keywords

linearization; quadratic assignment problem; branch-and-cut

Mathematics Subject Classification ID

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90B80: Discrete location and assignment

Uses Software

• QAPLIB
• ZRAM