الفهرس Only 14 pages are availabe for public view
 |  | from | 139 |  |  |
| | | from | 139 | | |
Abstract
Branch-and-Bound technique is commonly used for solving integer optimization problems .The corresponding binary tree structure provides a natural parallelism allowing concurrent evalution of subproblems using parallel computing technology . While the master-worker paradigm is successfully used in many parallel applications as a common framework to impelement parallel applications , it has drawbacks when a large number of computing resources are connected.