Browsing Industrial Engineering by Subject "Polynomial time solvability"
Now showing items 1-1 of 1
-
Two classes of quadratic assignment problems that are solvable as linear assignment problems
(Elsevier, 2011-08)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 ...
Share this page