PARALLEL BRANCH-AND-BOUND ALGORITHMS - SURVEY AND SYNTHESIS
成果类型：
Review
署名作者：
GENDRON, B; CRAINIC, TG
署名单位：
Universite de Montreal
刊物名称：
OPERATIONS RESEARCH
ISSN/ISSBN：
0030-364X
DOI：
10.1287/opre.42.6.1042
发表日期：
1994
页码：
1042-1066
关键词：
摘要：
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.