A parallel branch and bound algorithm for the quadratic assignment problem
We propose a parallel branch and bound algorithm for the quadratic assignment problem; this algorithm has been implemented on an asynchronous multiprocessor machine with shared memory (the Cray X-MP). For problems with size \(n\geq 10\), the improvement in using n processors is very close to n, and moreover very good results are obtained for a classical example from the literature with size 12.
scientific article; zbMATH DE number 4029260