Branch and bound method on desktop grid systems

The Branch and Bound method (B&B) is an efficient and well-known technique to solve combinatorial optimization problems. However for real-life problems B&B can consume tremendous amount of resources thereby making reasonable the use of parallel and distributed systems. In this paper we discuss an efficient implementation of B&B method on desktop grid systems. Technical details of the implementation and the results of the experimental evaluation are discussed. Based on the analysis of the experimental data we suggest ways to improve the application performance.