The University of Southampton
University of Southampton Institutional Repository

A note on a polynomial time solvable case of the quadratic assignment problem

Record type: Article

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.

Full text not available from this repository.

Citation

Erdogan, Gunes and Tansel, Barbaros (2006) A note on a polynomial time solvable case of the quadratic assignment problem Discrete Optimization, 3, (4), pp. 382-384. (doi:10.1016/j.disopt.2006.04.001).

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: 18 Jul 2017 11:05

Export record

Altmetrics

Contributors

Author: Gunes Erdogan
Author: Barbaros Tansel

University divisions


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

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×