A framework for coordinating parallel branch and bound algorithms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2315, Issue , 2002, Pages 332-339

  Stam, Andries ^a,b  

^a LEIDEN UNIVERSITY   (Netherlands)

^b Ordina Institute for Research and Innovation   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

COORDINATION REACTIONS;

BRANCH-AND-BOUND ALGORITHMS; COORDINATION LANGUAGE; COORDINATION STRATEGY; OPTIMIZATION PROBLEMS; PARALLEL BRANCH AND BOUNDS; PARALLEL SYSTEM; PARALLELIZATIONS; USEFUL PROPERTIES;

BRANCH AND BOUND METHOD;

EID: 35048816903     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46000-4_30     Document Type: Conference Paper

References (12)

1. S. Ahuja, N. Carriero, and D. Gelernter. Linda and friends. IEEE Computer, 19(8):26–34, 1986.
2. F. Arbab. Manifold version 2: Language reference manual. Technical report, Centrum voor Wiskunde en Informatica, Kruislaan 413, 1098 SJ Amsterdam, The Netherlands, 1995.
3. F. Arbab. The IWIM model for coordination of concurrent activities. In Coordination ’96, Lecture Notes in Computer Science. Springer-Verlag, 1996.
4. F. Arbab and E.B.G. Monfroy. Distributed splitting of constraint satisfaction problems. In Coordination 2000, Lecture Notes in Computer Science. Springer-Verlag, 2000.
5. C.L. Blom, F. Arbab, S. Hummel, and I.J.P. Elshof. Coordination of a heterogeneous coastal hydrodynamics application in manifold. Technical Report SEN–R9833, Centrum voor Wiskunde en Informatica, Kruislaan 413, 1098 SJ Amsterdam, The Netherlands, 1998.
6. B. Le Cun and C. Roucairol et al. BoB: a unified platform for implementing branch-and-bound like algorithms. Technical Report 95/16, Laboratoire PRiSM, Universit´e de Versailles, Saint Quentin en Yvelines, 1995.
7. J. Eckstein, C.A. Phillips, and W.E. Hart. PICO: An object-oriented framework for parallel branch and bound. Technical report, Rutgers Center for Operations Research, Rutgers University, New Jersey, 2000.
8. L.G. Mitten. Branch-and-bound methods: General formulation and properties. In Operations Research 18, pages 25–35, 1970.
9. Michael J. Quinn. Parallel Computing - Theoryand Practice. McGraw Hill, inc., 1994.
10. Y. Shinano, M. Higaki, and R. Hirabayashi. A generalized utility for parallel branch and bound algorithms. Technical report, Department of Management Science, Science University of Tokyo, 1994.
11. H.W.J.M. Trienekens and A. de Bruin. Towards a taxonomy of parallel branch and bound algorithms. Technical Report EUR-CS-92-01, Erasmus University Rotterdam, Dept. of Computer Science, 1992.
12. S. Tschöke and T. Polzer. Portable parallel branch-and-bound library PPBBLib user manual, library version 2.0. Technical report, Department of Computer Science, University of Paderborn, 1996.