Annals of Operations Research

, Volume 43, Issue 2, pp 123–145 | Cite as

Efficiency considerations in the implementation of parallel branch-and-bound

  • V. J. Rayward-Smith
  • S. A. Rush
  • G. P. McKeown
Section II Algorithms For Parallel Computers


We discuss the abstraction of the branch-and-bound paradigm and the implementation on a transputer network of kernel software supporting this paradigm. We propose a new measure, which we call thepseudo efficiency of an implementation, and use this measure to decide which kernel is appropriate under certain conditions. We then discuss someefficiency anomalies and show that these can occur for genuine problems.


Efficiency Consideration Kernel Software Genuine Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    F.W. Burton, G.P. McKeown, V.J. Rayward-Smith and M.R. Sleep, Parallel processing and combinatorial optimization, in:Proc. Combinatorial Optimization III Conf., ed. L.B. Wilson, C.S. Edwards and V.J. Rayward-Smith, Stirling (1982) pp. 19–36.Google Scholar
  2. [2]
    J. Clausen and J.L. Träff, Implementation of parallel branch-and-bound algorithms — experiences with the graph partitioning problem, Ann. Oper. Res. 33(1991)331–349.Google Scholar
  3. [3]
    V. Faber, O.M. Lubeck and B. White Jr., Superlinear speedup of an efficient sequential algorithm is not possible, Parallel Comput. 3(1986)259–260.Google Scholar
  4. [4]
    M. Imai, T. Fukumura and Y. Yoshida, A parallelized branch-and-bound algorithm: Implementation and efficiency. Syst. Comp. Controls 10(1979)62–70.Google Scholar
  5. [5]
    INMOS Ltd.,Transputer Reference Manual (Prentice-Hall, London, 1988)Google Scholar
  6. [6]
    INMOS Ltd.,The Transputer Databook, INMOS Databook Series, 2nd ed. (INMOS Ltd., 1989).Google Scholar
  7. [7]
    T. Lai and S. Sahni, Anomalies in parallel branch-and-bound algorithms, Commun. ACM 27(1984)594–602.Google Scholar
  8. [8]
    J.D.C. Little, K.G. Murty, D.W. Sweeney and C. Karel, An algorithm for the travelling salesman problem, Oper. Res. 11(1963)972–989.Google Scholar
  9. [9]
    G.P. McKeown, V.J. Rayward-Smith, S.A. Rush and H.J. Turpin, Using a transputer network to solve branch-and-bound problems, in:Proc. TRANSPUTING '91 Conf., Vol. 2, ed. P. Welch, D. Stiles, T. Kunii and A. Bakkers (IOS Press, Amsterdam, 1991) pp. 781–800.Google Scholar
  10. [10]
    G.P. McKeown, V.J. Rayward-Smith and H.J. Turpin, Branch-and-bound as a higher order function, Ann. Oper. Res. 33(1991)379–402.Google Scholar
  11. [11]
    J. Mohan, Experience with two parallel programs solving the travelling sales man problem, in:Proc. 1983 Int. Conf. on Parallel Processing (1983) pp. 191–193.Google Scholar
  12. [12]
    S.A. Rush, Using a transputer ring to transform raster images, Research Report R171, University of Exeter, Exeter, England (1989).Google Scholar
  13. [13]
    S.A. Rush, Parallel branch-and-bound on a network of transputers, PhD Thesis, School of Information Systems, University of East Anglia, Norwich, NR4 7TJ, England (1992).Google Scholar
  14. [14]
    H.M. Salkin,Integer Programming (Addison-Wesley, 1975).Google Scholar
  15. [15]
    A. Schrijver,Theory of Linear and Integer Programming, Wiley-Interscience Series in Discrete Mathematics and Optimization (Wiley, 1986).Google Scholar
  16. [16]
    M.L. Shore, L.R. Foulds and P.B. Gibbons, An algorithm for the Steiner problem in graphs, Networks 12(1982)323–333.Google Scholar
  17. [17]
    R.W. Topor, Termination detection for distributed computations, Infor. Proc. Lett. 18(1984)33–36.Google Scholar
  18. [18]
    H.J. Turpin, The branch-and-bound paradigm, Ph.D. Thesis, School of Information Systems, Norwich (1991).Google Scholar
  19. [19]
    B.W. Wah and Y.W.E. Ma, MANIP — a multicomputer architecture for solving combinatorial extreme-search problems, IEEE Trans Comput. C-33(1984)377–390.Google Scholar
  20. [20]
    B.W. Weide, Modelling unusual behaviour of parallel algorithms, IEEE Trans. Comput. C-31(1982)1126–1130.Google Scholar

Copyright information

© J.C. Baltzer AG, Science Publishers 1993

Authors and Affiliations

  • V. J. Rayward-Smith
    • 1
  • S. A. Rush
    • 1
  • G. P. McKeown
    • 1
  1. 1.School of Information SystemsUniversity of East AngliaNorwichUK

Personalised recommendations