Two classes of quadratic assignment problems that are solvable as linear assignment problems
Author
Erdoǧan, G.
Tansel, B. Ç.
Date
2011Source Title
Discrete Optimization
Print ISSN
1572-5286
Electronic ISSN
1873-636X
Publisher
Elsevier
Volume
8
Issue
3
Pages
446 - 451
Language
English
Type
ArticleItem Usage Stats
132
views
views
108
downloads
downloads
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.
Keywords
Quadratic Assignment ProblemLinear Assignment Problem
Computational complexity
Polynomial time solvability