Article ID: | iaor1990267 |
Country: | Switzerland |
Volume: | 22 |
Start Page Number: | 253 |
End Page Number: | 269 |
Publication Date: | Jan 1990 |
Journal: | Annals of Operations Research |
Authors: | Park Haesun |
The paper presents a parallel branch and bound algorithm for unconstrained quadratic zero-one programs on the hypercube architecture. Subproblems parallelize well without the need of a shared data structure to store expanded nodes of the search tree. Load balancing is achieved by demand splitting of neighbouring subproblems. Computational results on a variety of large-scale problems are reported on an iPSC/1 32-node hypercube and an iPSC/2 16-node hypercube.