Abstract
The GRIBB project (GReat International Branch-and-Bound search) is seeking to establish a software library for solving a large class of parallel search problems by the use of numerous computers around the world accessed by Internet. GRIBB is a lean JAVA-based software package targeting compute intensive combinatorial optimization problems solved by the use of branch-and-bound methods. The Quadratic Assignment Problem has been chosen as the first major test application due to its high computation complexity, and preliminary results from test runs are presented.
This work was supported by the NFR grant no. 141772
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Compute Against Cancer, http://www.parabon.com/cac.jsp/
Entropia, http://www.entropia.com/
FightAIDS@home, http://www.fightaidsathome.org/
Foster, I., Kesselman, C. (eds.): The Grid: Blueprint for a New Computing Infrastructure. Morgan Kaufmann Publisher, Englewood Cliffs (1998)
GIMPS - Great Internet Mersenne Prime Search, http://www.mersenne.org/
The Global Grid Forum, http://www.gridforum.org/
GRISK: the GReat International Search for K-optimal lattices, http://www.ii.uib.no/grisk/
Hahn, P., Grant, T.: Lower Bounds for the Quadratic Assignment Problem Based Upon a Dual Formulation. Operations Research 46 (1998)
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 (1998)
Myklebust, J.F., Sørevik, T.: GRISK: An Internet based search for K-optimal Lattice Rules. In: Sørevik, T., Manne, F., Moe, R., Gebremedhin, A. (eds.) Proceedings from PARA2000, Bergen, Philadelphia, June. Lecture Notes in Computer Sciences, vol. 1947, pp. 196–205. Springer, Heidelberg (2000)
Burkard, R.E., Çela, E., Karisch, S.E., Rendl, F. (eds.): QAPLIB - A Quadratic Assignment Problem Library., http://www.seas.upenn.edu/qaplib/
SETI@home, http://www.setiathome.ssl.berkeley.edu/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Moe, R. (2004). GRIBB – Branch-and-Bound Methods on the Internet. In: Wyrzykowski, R., Dongarra, J., Paprzycki, M., Waśniewski, J. (eds) Parallel Processing and Applied Mathematics. PPAM 2003. Lecture Notes in Computer Science, vol 3019. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24669-5_132
Download citation
DOI: https://doi.org/10.1007/978-3-540-24669-5_132
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21946-0
Online ISBN: 978-3-540-24669-5
eBook Packages: Springer Book Archive