Now showing items 1-1 of 1
Quadratic assignment problem : linearizations and polynomial time solvable cases
(Bilkent University, 2006)
The Quadratic Assignment Problem (QAP) is one of the hardest combinatorial optimization problems known. Exact solution attempts proposed for instances of size larger than 15 have been generally unsuccessful even ...