A Parallel Branch and Bound Algorithm for Solving Large Scale Integer Programming Problems


Branch and Bound technique is commonly used for intelligent search in finding a set of integer solutions within a space of interest. The corresponding binary tree structure provides a natural parallelism allowing concurrent evaluation of subproblems using parallel computing technology. While the master-worker paradigm is successfully used in many parallel… (More)


5 Figures and Tables

Slides referencing similar topics