A note on a polynomial time solvable case of the quadratic assignment problem
Erdogan, Gunes and Tansel, Barbaros (2006) A note on a polynomial time solvable case of the quadratic assignment problem. Discrete Optimization, 3, (4), 382-384. (doi:10.1016/j.disopt.2006.04.001).
Full text not available from this repository.
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.
|Subjects:||H Social Sciences > HA Statistics|
|Divisions:||Faculty of Business and Law > Southampton Management School > Management Science
|Date Deposited:||01 Dec 2011 14:09|
|Last Modified:||01 Dec 2011 14:09|
|Contributors:||Erdogan, Gunes (Author)
Tansel, Barbaros (Author)
|Date:||1 December 2006|
|RDF:||RDF+N-Triples, RDF+N3, RDF+XML, Browse.|
Actions (login required)