A parallel branch and bound algorithm for the quadratic assignment problem (Q1095791)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A parallel branch and bound algorithm for the quadratic assignment problem |
scientific article; zbMATH DE number 4029260
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A parallel branch and bound algorithm for the quadratic assignment problem |
scientific article; zbMATH DE number 4029260 |
Statements
A parallel branch and bound algorithm for the quadratic assignment problem (English)
0 references
1987
0 references
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.
0 references
parallel branch and bound
0 references
quadratic assignment
0 references
asynchronous multiprocessor machine
0 references
