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), 446-451. (doi:10.1016/j.disopt.2011.03.002).

Download

Full text not available from this repository.

Description/Abstract

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

Item Type: Article
Digital Object Identifier (DOI): doi:10.1016/j.disopt.2011.03.002
ISSNs: 1572-5286 (print)
Keywords: quadratic assignment problem, linear assignment problem, computational complexity, polynomial time solvability
Subjects: Q Science > QA Mathematics
Divisions: Faculty of Business and Law > Southampton Business School > Centre of Excellence for International Banking, Finance & Accounting
ePrint ID: 204835
Date :
Date Event
1 April 2011Made publicly available
August 2011Published
Date Deposited: 02 Dec 2011 10:13
Last Modified: 31 Mar 2016 13:47
URI: http://eprints.soton.ac.uk/id/eprint/204835

Actions (login required)

View Item View Item