Two classes of Quadratic Assignment Problems that are solvable as Linear Assignment Problems
446 - 451
MetadataShow full item record
Please cite this item using this persistent URLhttp://hdl.handle.net/11693/21836
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. © 2011 Elsevier B.V. All rights reserved.
- Research Paper 7144
Showing items related by title, author, creator and subject.
Atmaca, A.; Oruç, A.Y. (2010)In many assignment problems, a set of documents such as research proposals, promotion dossiers, resumes of job applicants is assigned to a set of experts for ordinal evaluation, ranking, and classification. A desirable ...
Atmaca, A.; Oruc, A.Y. (2010)A frequently encountered problem in peer review systems is to facilitate pairwise comparisons of a given set of documents by as few experts as possible. In , it was shown that, if each expert is assigned to review k ...
Karsu O.; Azizoglu, M. (John Wiley and Sons Inc., 2014)In this study,we consider a bicriteria multiresource generalized assignment problem. Our criteria are the total assignment load and maximum assignment load over all agents. We aim to generate all nondominated objective ...