Author:
de Bruin A.,Kindervater G. A. P.,Trienekens H. W. J. M.
Publisher
Springer Berlin Heidelberg
Reference30 articles.
1. O.J. Boxma, G.A.P. Kindervater (1991). A queueing network model for analyzing a class of branch-and-bound algorithms on a master-slave architecture. Oper. Res. 39, 1005–1017.
2. J. Clausen, J.L. Träff (1991). Implementation of parallel branch and bound algorithms — experiences with the graph partitioning problem. Ann. Oper. Res. 33, 341–349.
3. Lecture Notes in Computer Science;R. Corrêa,1995
4. Lecture Notes in Computer Science;V.-D. Cung,1995
5. A. de Bruin, H.W.J.M. Trienekens (1992). Towards a Taxonomy of Parallel Branch and Bound Algorithms, Report EUR-CS-92-01, Department of Computer Science, Erasmus University, Rotterdam.