Two classes of quadratic assignment problems that are solvable as linear assignment problems
Type :
Article
Publication Status :
published
Access :
restrictedAccess
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.
Source :
Discrete Optimization
Date :
2011-08
Volume :
8
Issue :
3
Publisher :
Elsevier
URI
http://hdl.handle.net/10679/241http://www.sciencedirect.com/science/article/pii/S1572528611000168
Collections
Share this page