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).

Download

Full text not available from this repository.

Description/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.

Item Type: Article
Digital Object Identifier (DOI): doi:10.1016/j.disopt.2006.04.001
ISSNs: 1572-5286 (print)
Related URLs:
Subjects: H Social Sciences > HA Statistics
Divisions : Faculty of Business and Law > Southampton Business School > Centre of Excellence for International Banking, Finance & Accounting
ePrint ID: 204807
Accepted Date and Publication Date:
Status
1 December 2006Published
Date Deposited: 01 Dec 2011 14:09
Last Modified: 31 Mar 2016 13:47
URI: http://eprints.soton.ac.uk/id/eprint/204807

Actions (login required)

View Item View Item