Publication: Two classes of quadratic assignment problems that are solvable as linear assignment problems
Institution Authors
Authors
Journal Title
Journal ISSN
Volume Title
Type
article
Access
restrictedAccess
Publication Status
published
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.
Date
2011-08
Publisher
Elsevier
Description
Due to copyright restrictions, the access to the full text of this article is only available via subscription.