| Tekijä: | Grendon, B. Crainic, T. |
| Otsikko: | Parallel branch-and-bound algorithms: survey and synthesis |
| Lehti: | Operations Research
1994 : NOV/DEC, VOL. 42:6, p. 1042-1066 |
| Asiasana: | ALGORITHMS ECONOMICS SURVEYS |
| Kieli: | eng |
| Tiivistelmä: | The authors present a detailed and up-to-date survey of the literature on parallel branch-and-bound algorithms. They 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 their analysis, the authors give a new characterization of branch-and-bound algorithms, which consists of isolating the performed operations without specifying any particular order for their execution. |
SCIMA