Template realization of generalized branch and bound algorithm

Mathematical Modelling and Analysis

Volumn 10, Issue 3, 2005, Pages 217-236

  Baravykaite, M ^a   Ciegis R ^a   Zilinskas J ^b  

^a VILNIUS GEDIMINAS TECHNICAL UNIVERSITY   (Lithuania)

^b VILNIUS UNIVERSITY   (Lithuania)

Author keywords

Branch and bound algorithms; Combinatorial optimization; Global optimization; Parallel algorithms; Templates

Indexed keywords

COMBINATORIAL OPTIMIZATION; GLOBAL OPTIMIZATION; PARALLEL ALGORITHMS;

BRANCH-AND-BOUND ALGORITHMS; COMPUTATIONAL EXPERIMENT; GLOBAL OPTIMIZATION ALGORITHM; PARALLEL BRANCH AND BOUNDS; PARALLELIZATIONS; TEMPLATES;

BRANCH AND BOUND METHOD;

EID: 27844471599     PISSN: 13926292     EISSN: 16483510     Source Type: Journal    
DOI: 10.1080/13926292.2005.9637283     Document Type: Article

References (25)

1. Alba, E., and Almeida, F., 2001. at all. Mallba:A library of skeletons for combinatorical optimization, Technical report
2. Baravykait e, M., and Šablinskas, R., 2002. The template programming of parallel algorithms. Matematical Modelling and Analysis, 7(1):11–20.
3. Čiegis, R., Šablinskas, R., and Wasniewski, J., Hyper-rectangle distribution algorithm for parallel multidimensional numerical integration. Recent advances in PVM and MPI, 6th European PVM/MPI user’s group meeting, Barcelona, Spain, volume 1697 of Lecture Notes in Computer Science. pp. 275–282. Springer.
4. Clausen, J., 1996. Parallel search-based methods in optimization. Applied Parallel Computing - Industrial Computation and Optimization, Proceedings of PARA96, volume 1184 of Lecture Notes in Computer Science. 1996, Springer. pp. 176–185.
5. Csendes, T., 2004. Generalized subinterval selection criteria for interval global optimization. Numerical Algorithms, 37(1–4):93–100.
6. Dür, M., and Stix, V., 2005. Probabilistic subproblem selection in branch-and-bound algorithms. Journal of Computational and Applied Mathematics, 182(1):67–80.
7. Eckstein, J., Hart, W.E., and Phillips, C.A., 2000. Pico:An object-oriented framework for parallel branch and bound, rutcor research report, Technical Report 40–2000 Piscataway, NJ:Rutgers University.
8. Floudas, C.A., 2000. Deterministic Global Optimization:Theory, Methods and Applications volume 37 of Nonconvex Optimization and its Applications, Kluwer Academic Publishers.
9. Foster, I., 1995. Designing and Building Parallel Programs, Addison-Wesley.
10. Gendron, B., and Crainic, T.G., 1994. Parallel branch-and-bound algorithms:survey and synthesis. Operations Research, 42(6):1042–1066.
11. Goswami, D., Preiss, B., and Singh, A., 2002. From design patterns to parallel architecture skeletons, 62(4) April:669–695.
12. Grama, A., Gupta, A., Karypis, G., and Kumar, V., 2003. Introduction to Parallel Computing Addison Wesley
13. Hammer, R., Hocks, M., Kulish, U., and Ratz, D., 1995. C++ Toolbox for Verified Computing:Basic Numerical Problems, Berlin:Springer.
14. Hansen, E., and Walster, G.W., 2003. Global Optimization Using Interval Analysis, 2nd edition, New York:Marcel Dekker.
15. Hansen, P., and Jaumard, B., 1995. “ Lipschitz optimization ”. In Handbook of Global Optimization, volume 2 of Nonconvex Optimization and Its Applications, 404–493. Dodrecht:Kluwer Academic Publishers.
16. Horst, R., Pardalos, P.M., and Thoai, N.V., 2001. Introduction to Global Optimization volume 48 of Nonconvex Optimization and its Applications, 2nd edition, Kluwer Academic Publishers.
17. Knüppel, O., 1999. PROFIL/BIAS V 2.0. Technical Report 99.1, Hamburg-Harburg:Technische Universität.
18. Kreinovich, V., and Csendes, T., 2001. Theoretical justification of a heuristic subbox selection criterion for interval global optimization. Central European Journal of Operations Research, 9(3):255–265.
19. Lawler, E.W., Lenstra, J.K., Rinnooy Kan, A., and Smoys, D.B., 1985. The Traveling Salesman Problem:A Guided Tour of Combinatorial Optimization, Wiley Series in Discrete Mathematics and Optimization. John Wiley & Sons.
20. Le Cun, B., and Roucairol, C., 1995. Bob:a unified platform for implementing branch-and-bound like algorithms, Technical Report 95/16 sep. Université de Versailles - Laboratoire PRiSM.
21. Šablinskas, R., 1999. Investigation of algorithms for distributed memory parallel computers PhD thesis
22. Shianno, Y., and Fujier, T., 1999. Pubb (parallelization utility for branch-and-bound algorithms) user manual, Technical Report Version 1.0.
23. Singh, A., Szafron, D., and Schaeffer, J., 1996. Views on template-based parallel programming. CASCON 96 CDRom Proceedings. October1996, Toronto.
24. Tschoke, S., and Polzer, T., 1996. Portable parallel branch-and-bound library ppbb-lib. user manual, Technical Report Version 2.0. Department of Computer Science, University of Paderborn.
25. Xu, C., and Lau, F., 1997. Load Balancing in Parallel Computers. Theory and Practice, Kluwer Academic Publishers.