A Queueing Network Model for Analyzing a Class of Branch-and-Bound Algorithms on a Master–Slave Architecture

O. J. Boxma and G. A. P. Kindervater
Additional contact information
O. J. Boxma: CWI, Amsterdam, The Netherlands, and Tilburg University, Tilburg, The Netherlands
G. A. P. Kindervater: Erasmus University, Rotterdam, The Netherlands

Operations Research, 1991, vol. 39, issue 6, 1005-1017

Abstract: Partitioning methods lend themselves very well to implementation on parallel computers. In recent years, branch-and-bound algorithms have been tested on various types of architectures. In this paper, we develop a queueing network model for the analysis of a class of branch-and-bound algorithms on a master–slave architecture. The analysis is based on a fluid flow approximation. Numerical examples illustrate the concepts developed. Finally, related branch-and-bound algorithms are studied using a machine repair queueing model.

Keywords: computers/computer science: master–slave architecture; programming: analysis of parallel branch-and-bound algorithms; queues: fluid flow approximations (search for similar items in EconPapers)
Date: 1991
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.39.6.1005 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:39:y:1991:i:6:p:1005-1017

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().