Article ID Journal Published Year Pages File Type
1141648 Discrete Optimization 2011 6 Pages PDF
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
Related Topics
Physical Sciences and Engineering Mathematics Control and Optimization
Preview
Two classes of Quadratic Assignment Problems that are solvable as Linear Assignment Problems
Authors
, ,