Erdogan, Gunes and Tansel, Barbaros
Two classes of quadratic assignment problems that are solvable as linear assignment problems
Discrete Optimization, 8, (3), . (doi:10.1016/j.disopt.2011.03.002).
Full text not available from this repository.
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
|Digital Object Identifier (DOI):
||quadratic assignment problem, linear assignment problem, computational complexity, polynomial time solvability
||Centre of Excellence for International Banking, Finance & Accounting
|1 April 2011||e-pub ahead of print|
||02 Dec 2011 10:13
||18 Apr 2017 01:07
|Further Information:||Google Scholar|
Actions (login required)