Erdoğan, GüneşTansel, B. Ç.2012-08-172012-08-172011-081572-5286http://hdl.handle.net/10679/241https://doi.org/10.1016/j.disopt.2011.03.002Due to copyright restrictions, the access to the full text of this article is only available via subscription.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.engrestrictedAccessarticle8344645100029393190000510.1016/j.disopt.2011.03.002Quadratic Assignment ProblemLinear Assignment ProblemComputational complexityPolynomial time solvability2-s2.0-79960104932