We present a detailed and up-to-date survey of the literature on parallel branch-and-bound algorithms. We synthesize previous work in this area and propose a new classification of parallel ...

A branch-bound algorithm is then used to solve the problem. The method discussed in the article has been successfully used to solve 'practical' location problems with upwards of fifty plants.

Example 5.18: Branch and Bound Trees This example illustrates a nonstandard use of PROC NETDRAW. The TREE option in PROC NETDRAW is used to draw a branch and bound tree such as one that you obtain in ...