Skip to main content
Log in

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

  • Section II Algorithms For Parallel Computers
  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  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.

  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. 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. 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. INMOS Ltd.,Transputer Reference Manual (Prentice-Hall, London, 1988)

    Google Scholar 

  6. INMOS Ltd.,The Transputer Databook, INMOS Databook Series, 2nd ed. (INMOS Ltd., 1989).

  7. T. Lai and S. Sahni, Anomalies in parallel branch-and-bound algorithms, Commun. ACM 27(1984)594–602.

    Google Scholar 

  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. 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. 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. 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.

  12. S.A. Rush, Using a transputer ring to transform raster images, Research Report R171, University of Exeter, Exeter, England (1989).

    Google Scholar 

  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. H.M. Salkin,Integer Programming (Addison-Wesley, 1975).

  15. A. Schrijver,Theory of Linear and Integer Programming, Wiley-Interscience Series in Discrete Mathematics and Optimization (Wiley, 1986).

  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. R.W. Topor, Termination detection for distributed computations, Infor. Proc. Lett. 18(1984)33–36.

    Google Scholar 

  18. H.J. Turpin, The branch-and-bound paradigm, Ph.D. Thesis, School of Information Systems, Norwich (1991).

    Google Scholar 

  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. B.W. Weide, Modelling unusual behaviour of parallel algorithms, IEEE Trans. Comput. C-31(1982)1126–1130.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

This research was sponsored by the Science and Engineering Research Council and the MOD under Grant No. GR/F 33063.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Rayward-Smith, V.J., Rush, S.A. & McKeown, G.P. Efficiency considerations in the implementation of parallel branch-and-bound. Ann Oper Res 43, 123–145 (1993). https://doi.org/10.1007/BF02024489

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02024489

Keywords

Navigation