A parallel branch and bound algorithm for the quadratic assignment problem

Roucairol, Catherine

Open link

Publication date

November 1987

DOI

10.1016/0166-218X(87)90022-9

Publisher

Published by Elsevier B.V.

Abstract

AbstractWe 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 ≥ 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

Extracted data

We use cookies to provide a better user experience.

Data Protection

A parallel branch and bound algorithm for the quadratic assignment problem

Abstract

Extracted data

A parallel branch and bound algorithm for the quadratic assignment problem

Abstract

Extracted data

Topics

Related items

Related items

Topics