The bipartite quadratic assignment problem and extensions ?
We introduced a new model that subsumes the well-known quadratic assignment problem. We developed meta-heuristic algorithms using three neighborhoods and their unions. Experimental analysis disclosed the superiority of hybrid algorithms. Complexity results and polynomially solvable special cases are also established.
quadratic assignment complexity bilinear programs metaheuristics local search