Article ID: | iaor19931542 |
Country: | United Kingdom |
Volume: | 43 |
Issue: | 5 |
Start Page Number: | 519 |
End Page Number: | 531 |
Publication Date: | May 1992 |
Journal: | Journal of the Operational Research Society |
Authors: | Ashford R.W., Connard P., Daniel R. |
Keywords: | computers: calculation |
The time-consuming process of solving large-scale Mixed Integer Programming problems using the branch-and-bound technique can be speeded up by introducing a degree of parallelism into the basic algorithm. This paper describes the development and implementation of a parallel branch-and-bound algorithm created by adapting a commercial MIP solver. Inherent in the design of this software are certain