A note on a polynomial time solvable case of the quadratic assignment problem
A note on a polynomial time solvable case of the quadratic assignment problem
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.
382-384
Erdogan, Gunes
468310a1-5c36-4c3d-8b39-079bd621b34b
Tansel, Barbaros
3933683b-8a6f-4623-9b67-35ba9915ba03
1 December 2006
Erdogan, Gunes
468310a1-5c36-4c3d-8b39-079bd621b34b
Tansel, Barbaros
3933683b-8a6f-4623-9b67-35ba9915ba03
Erdogan, Gunes and Tansel, Barbaros
(2006)
A note on a polynomial time solvable case of the quadratic assignment problem.
Discrete Optimization, 3 (4), .
(doi:10.1016/j.disopt.2006.04.001).
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.
This record has no associated files available for download.
More information
Published date: 1 December 2006
Organisations:
Centre of Excellence for International Banking, Finance & Accounting
Identifiers
Local EPrints ID: 204807
URI: http://eprints.soton.ac.uk/id/eprint/204807
ISSN: 1572-5286
PURE UUID: d895cd85-0951-4684-b97d-a3973916a3db
Catalogue record
Date deposited: 01 Dec 2011 14:09
Last modified: 14 Mar 2024 04:33
Export record
Altmetrics
Contributors
Author:
Gunes Erdogan
Author:
Barbaros Tansel
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics