On One Approach to Realization
of the Branch-and-Bound Method
on a Distributed System

A. V. Gulyaev and V. S. Makhnychev

Department of the Automation of the Systems of Computer Complexes,
Faculty of Computational Mathematics and Cybernetics, Moscow State University, Moscow, 119992 Russia

e-mail: makhnich@ldis.cs.msu.su; gav@cs.msu.su

Received November 7, 2007

Abstract—The branch-and-bound method is one of most efficient search algorithms. However, parallel
decomposition of this method is difficult even on architectures with common memory, not to mention
distributed systems. The paper describes an algorithm for solution of the problems that can be solved
with the branch-and-bound method on a distributed computer system. The results of testing of the pro-
posed algorithm via solution of the chess-game problem are presented.

DOI:10.3103/S0278641908030102

Pleiades Publishing home page | journal home page | top

If you have any problems with this server, contact webmaster.