Skip to main content
SpringerLink
Log in

Parallel Branch and Bound Algorithms on Internet Connected Workstations

  • Conference paper
High Performance Computing and Communications (HPCC 2005)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 3726))

Abstract

By the use of the GRIBB software for distributed computing across the Internet, we are investigating the obstacles and the potential for efficient parallelization of Branch and Bound algorithms. Experiments have been carried out using two different applications, i.e. the Quadratic Assignment Problem (QAP) and the Traveling Salesman Problem (TSP). The results confirm the potential of the approach, and underline the requirements of the problem, algorithm and architecture for the approach to be successful.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Applegate, D., Bixby, R.E., Chvatal, V., Cook, W.: On the solution of traveling salesman problems. Documenta Mathematica, ICM(III) 645–656 (1998)

    Google Scholar 

  2. Anstreicher, K.M., Brixius, N.W., Goux, J.-P., Linderoth, J.T.: Solving Large Quadratic Assignment Problems on Computational Grids. Mathematical Programming, Series B 91, 563–588 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  3. Atkins, D., Graff, M., Lenstra, A.K., Leyland, P.C.: The magic words are squeamish ossifrage. In: Safavi-Naini, R., Pieprzyk, J.P. (eds.) ASIACRYPT 1994. LNCS, vol. 917, Springer, Heidelberg (1995)

    Chapter  Google Scholar 

  4. Compute Against Cancer, http://www.parabon.com/cac.jsp/

  5. FightAIDS@home, http://www.fightaidsathome.org/

  6. Folding@home, http://folding.stanford.edu/

  7. GIMPS-Great Internet Mersenne Prime Search, http://www.mersenne.org/

  8. Hahn, P., Grant, T.: Lower Bounds for the Quadratic Assignment Problem Based Upon a Dual Formulation. Operations Research 46(6) (November-December 1998)

    Google Scholar 

  9. Hahn, P., Grant, T., Hall, N.: A Branch-and-Bound Algorithm for the Quadratic Assignment Problem Based on the Hungarian Method. European Journal of Operational Research (August 1998)

    Google Scholar 

  10. Held, M., Karp, R.M.: The traveling-salesman problem and minimum spanning trees. Operations Research 18, 1138–1162 (1970)

    Article  MATH  MathSciNet  Google Scholar 

  11. Held, M., Karp, R.M.: The traveling-salesman problem and minimum spanning trees: Part ii. Math. Programming 1, 6–26 (1971)

    Article  MATH  MathSciNet  Google Scholar 

  12. Moe, R.: GRIBB - An Infrastructure for Internet Computing. In: Haugland, D., Ho, S.C. (eds.) Proceedings of Nordic MPS 2002. The Eight Meeting of the Nordic Section of the Math. Prog. Society, Norway (2002)

    Google Scholar 

  13. Moe, R.: GRIBB - A User Guide. Technical report, Dep. of Informatics, Univ. of Bergen, Norway (2004)

    Google Scholar 

  14. Moe, R.: GRIBB – branch-and-bound methods on the internet. In: Wyrzykowski, R., Dongarra, J., Paprzycki, M., Waśniewski, J. (eds.) PPAM 2004. LNCS, vol. 3019, pp. 1020–1027. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  15. Burkard, R.E., Çela, E., Karisch, S.E., Rendl, F. (eds.): QAPLIB - A Quadratic Assignment Problem Library, http://www.seas.upenn.edu/qaplib/

  16. SETI@home, http://www.setiathome.ssl.berkeley.edu/

  17. TSPLIB - A library of sample instances for the TSP (and related problems) from various sources and of various types, http://www.iwr.uni-heidelberg.de/groups/comopt/software/TSPLIB95/

Download references

Author information

Authors and Affiliations

  1. Dept. of Informatics, University of Bergen, Norway

    Randi Moe

  2. Dept. of Mathematics, University of Bergen, Norway

    Tor Sørevik

Authors
  1. Randi Moe
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tor Sørevik
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, St. Francis Xavier University, Antigonish, Canada

    Laurence T. Yang

  2. School of Computer Science/Welsh eScience Centre, Cardiff University, UK

    Omer F. Rana

  3. Dipartimento di Ingegneria dell’ Informazione - Second, University of Naples - Italy, Real Casa dell’Annunziata - via Roma, 29 81031, Aversa (CE), Italy

    Beniamino Di Martino

  4. Computer Science Department, University of Tennessee, 37996-3450, Knoxville, TN, USA

    Jack Dongarra

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Moe, R., Sørevik, T. (2005). Parallel Branch and Bound Algorithms on Internet Connected Workstations. In: Yang, L.T., Rana, O.F., Di Martino, B., Dongarra, J. (eds) High Performance Computing and Communications. HPCC 2005. Lecture Notes in Computer Science, vol 3726. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11557654_87

Download citation

  • DOI: https://doi.org/10.1007/11557654_87

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29031-5

  • Online ISBN: 978-3-540-32079-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation