The University of Southampton
University of Southampton Institutional Repository

Two classes of quadratic assignment problems that are solvable as linear assignment problems

Erdogan, Gunes and Tansel, Barbaros (2011) Two classes of quadratic assignment problems that are solvable as linear assignment problems Discrete Optimization, 8, (3), pp. 446-451. (doi:10.1016/j.disopt.2011.03.002).

Record type: Article


The Quadratic Assignment Problem is one of the hardest combinatorial optimization problems known. We present two new classes of instances of the Quadratic Assignment Problem that can be reduced to the Linear Assignment Problem and give polynomial time procedures to check whether or not an instance is an element of these classes

Full text not available from this repository.

More information

e-pub ahead of print date: 1 April 2011
Published date: August 2011
Keywords: quadratic assignment problem, linear assignment problem, computational complexity, polynomial time solvability
Organisations: Centre of Excellence for International Banking, Finance & Accounting


Local EPrints ID: 204835
ISSN: 1572-5286
PURE UUID: a686f71e-eb72-445b-babd-ba60e40aecb8

Catalogue record

Date deposited: 02 Dec 2011 10:13
Last modified: 18 Jul 2017 11:05

Export record



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 supports OAI 2.0 with a base URL of

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.