Learn More
The Quadratic Assignment Problem (QAP) has remained one of the great challenges in combinatorial optimization. It is still considered a computationally nontrivial task to solve modest size problems, say of size n = 20: The QAPLIB was rst published in 1991, in order to provide a uniied testbed for QAP, accessible to the scientiic community. It consisted of(More)
This paper aims at describing the state of the art on quadratic assignment problems (QAPs). It discusses the most important developments in all aspects of the QAP such as linearizations, QAP polyhedra, algorithms to solve the problem to optimality, heuristics, polynomially solvable special cases, and asymptotic behavior. Moreover, it also considers problems(More)
Page 55 line 6: replace " among the matched " with " among the unmatched " ; 229 line 13: replace " Palubeckis [544] " with the following (missing) reference: G. Palubeckis. The use of special graphs for obtaining lower bounds in the geometric quadratic assignment problem. 289 eqn (9.27): replace " s ∈ F " with " S ∈ F " ; 308 line 14: replace "(More)
Given three n-element sequences a i ; b i and c i of nonnega-tive real numbers, the aim is to nd two permutations and such that the sum P n i=1 a i b (i) c (i) is minimized (maximized, respectively). We show that the maximization version of this problem can be solved in polynomial time, whereas we present an NP-completeness proof for the minimization(More)