Experiments in Solving Mixed Integer Programming Problems on a Small Array of Transputers
研究如何通过并行化分支定界算法加速求解大规模混合整数规划问题，在最多9个Transputer的阵列上实现并测试了商业求解器的改编版本，报告了多种实际问题的计算结果。
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 ad hoc methods, the use of which are necessary in the effective solution of real problems. The extent to which these ad hoc methods can successfully be transferred to a parallel environment, in this case an array of at most nine transputers, is discussed. Computational results on a variety of real integer programming problems are reported.