Two classes of Quadratic Assignment Problems that are solvable as Linear Assignment Problems

Authors:
GüNeş ErdoğAn;BarbarosÇ. Tansel
Affiliations:
Department of Industrial Engineering, Özyeğin University, KuşbakışıSk. No: 2, Altunizade, Istanbul, 34662, Turkey;Department of Industrial Engineering, Bilkent University, Bilkent, Ankara, 06800, Turkey
Venue:
Discrete Optimization
Year:
2011

Citing 4
Cited 0

P-Complete Approximation Problems

Journal of the ACM (JACM)
QAPLIB – A Quadratic Assignment ProblemLibrary

Journal of Global Optimization
Assignment Problems

Assignment Problems
A solvable case of the quadratic assignment problem11This research has been supported by the Spezialforschungsbereich F 003 ``Optimierung und Kontrolle", Projektbereich Diskrete Optimierung.

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

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.