Abstract
We present 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 neighboring 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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
T.S. Abdelrahman and T.N. Mudge, Parallel branch and bound algorithms on hypercube multiprocessors, in:3rd Conf. on Hypercube Concurrent Computers and Applications, Vol. II (ACM Press, 1988) pp. 1492–1499.
F. Barahona, A solvable case of quadratic 0–1 programming, Discr. Appl. Math. 13(1986)23–26.
R.L. Boehning, R.M. Butler and B.E. Gillett, A parallel integer linear programming algorithm, Eur. J. Oper. Res. 34(1988)393–398.
S. Colley, J.P. Hayes, T.N. Mudge, J. Palmer and Q.F. Stout, Architecture of a hypercube supercomputer, in:Int. Conf. on Parallel Processing (1986).
E.W. Felten, Best-first branch and bound on a hypercube, in:3rd Conf. on Hypercube Concurrent Computers and Applications, Vol. II (ACM Press, 1988) pp. 1500–1504.
P.L. Hammer and S. Rudeanu,Boolean Methods in Operations Research and Related Areas (Springer-Verlag, 1968).
P. Hansen, Methods of nonlinear 0–1 programming, Ann. Discr. Math. 5(1979)53–70.
T. Ibaraki,Enumerative Approaches to Combinatorial Optimization, Ann. Oper. Res., ed. P.L. Hammer, Vols. 10–11 (J.C. Baltzer AG, Basel, Switzerland, 1987).
iPSC User's Guide (Intel Corporation, CA, 1985).
iPSC Concurrent Debugger Manual, 2nd ed. (Intel Corporation, CA, 1987).
S. Jha and P.M. Pardalos, Graph separation techniques for quadratic zero-one programming, Technical Report CS-87-39, Computer Science Department, The Pennsylvania State University (1987).
R.M. Karp and Y. Zhang, A randomized parallel branch and bound procedure, in:Proc. 20th Annual ACM Symp. on Theory of Computing (1988) pp. 290–300.
T.-H. Lai and S. Sahni,Anomalies in Parallel Branch and Bound Algorithms, Supercomputing, ed. A. Lichnewsky and C. Seguez (Elsevier, 1987) pp. 111–129.
R.P. Ma, F.-S. Tsung and M.-H. Ma, A dynamic load balancer for a parallel branch and bound algorithm, in:3rd Conf. on Hypercube Concurrent Computers and Applications, Vol. II (ACM Press, 1988) pp. 1505–1513.
P.M. Pardalos and J.B. Rosen,Constrained Global Optimization: Algorithms and Applications, Lecture Notes in Computer Science 268 (Springer-Verlag, 1987).
R.P. Pargas and D.E. Wooster, Branch and Bound algorithms on a hypercube, in:3rd Conf. on Hypercube Concurrent Computers and Applications, Vol. II (ACM Press, 1988) pp. 1514–1519.
J.C. Picard and H.D. Ratliff, Minimum cuts and related problems, Networks 5(1975)357–370.
G. Rodgers, Algorithms for unconstrained quadratic zero-one programming on contemporary computer architectures, Ph.D. Thesis, Computer Science Department, The Pennsylvania State University (1989).
C. Roucairol, A parallel branch and bound algorithm for the quadratic assignment problem, Discr. Appl. Math. 18(1987)211–255.
K. Schwan, J. Gawkowski and B. Blake, Process and workload migration for a parallel branch and bound algorithm on a hypercube multicomputer, in:3rd Conf. on Hypercube Concurrent Computers and Applications, Vol. II (ACM Press, 1988) pp. 1520–1530.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Pardalos, P.M., Rodgers Parallel branch and bound algorithms for quadratic zero–one programs on the hypercube architecture. Ann Oper Res 22, 271–292 (1990). https://doi.org/10.1007/BF02023057
Issue Date:
DOI: https://doi.org/10.1007/BF02023057