A note on a polynomial time solvable case of the quadratic assignment problem
Date
2006
Authors
Erdoǧan, G.
Tansel, B.
Editor(s)
Advisor
Supervisor
Co-Advisor
Co-Supervisor
Instructor
Source Title
Discrete Optimization
Print ISSN
1572-5286
Electronic ISSN
1873-636X
Publisher
Elsevier
Volume
3
Issue
4
Pages
382 - 384
Language
English
Type
Journal Title
Journal ISSN
Volume Title
Series
Abstract
We identify a class of instances of the Koopmans-Beckmann form of the Quadratic Assignment Problem that are solvable in polynomial time. This class is characterized by a path structure in the flow data and a grid structure in the distance data. Chr18b, one of the test problems in the QAPLIB, is in this class even though this feature of it has not been noticed until now.