Parallel Branch-and-Branch Algorithms: Survey and Synthesis

Bernard Gendron and Teodor Gabriel Crainic
Additional contact information
Bernard Gendron: University of Montreal, Montreal, Quebec, Canada
Teodor Gabriel Crainic: DSA, University of Quebec at Montreal and CRT, University of Montreal, Montreal, Quebec, Canada

Operations Research, 1994, vol. 42, issue 6, 1042-1066

Abstract: We present a detailed and up-to-date survey of the literature on parallel branch-and-bound algorithms. We synthesize previous work in this area and propose a new classification of parallel branch-and-bound algorithms. This classification is used to analyze the methods proposed in the literature. To facilitate our analysis, we give a new characterization of branch-and-bound algorithms, which consists of isolating the performed operations without specifying any particular order for their execution.

Keywords: programming; implementation on parallel architectures; programming; integer; algorithms: survey (search for similar items in EconPapers)
Date: 1994
References: Add references at CitEc
Citations: View citations in EconPapers (19)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.42.6.1042 (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:42:y:1994:i:6:p:1042-1066

Access Statistics for this article

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