No abstract

No abstract

SUMMARYas a practical computational procedure for mixed integer programming and has been extended to various problems in a combinatorial optimization. Branch-and-bound is the most widely adopted and useful approach for obtaining optimal solutions or near-optimal solutions for Np-hard This paper describes a parallel branch-and-bound algorithm for general integer linear programming problems and its implementation on a distributed memory multiprocessor nCUBE2.problems [ 13.With a branch-and-bound algorithm, the amount of computation on each search tree node varies, and in general, is large. This has led to development of an effective communication strategy for the algorithm presented herein. Its implementation and performance evaluation also are described.The results show that the more difficult the problem instances become in terms of time to solve on a sequential computer, the more efficient the algorithm presented here proves to be.Key words: Parallel processing, branch-and-bound algorithm, integer linear programming, nCUBE2 distributed memory multiprocessor.

No abstract

No abstract