Parallel implementations of a branch-and-bound algorithm for multicommodity location with balancing requirements

The authors present two parallel branch-and-bound algorithms for the multicommodity location problem with balancing requirements. The first algorithm implements a master-slave approach in order to perform a parallel exploration of the search tree. The second algorithm decomposes the problem in order to compute the lower bounds in parallel. The authors realized implementations of these algorithms on a PC-based network of Transputers. Experimental results are reported and analyzed.