GridRPC, which is an RPC mechanism tailored for the Grid, is an attractive programming
model for Grid computing. This paper reports on the design and implementation of a …

This paper discusses the impact of the hierarchical master-worker paradigm on performance
of an application program, which solves an optimization problem by a parallel branch and …

We investigate the design of parallel B&B in large scale heterogeneous compute
environments where processing units can be composed of a mixture of multiple shared …

The most popular parallelization approach of the branch and bound algorithm consists in
building and exploring in parallel the search tree representing the problem being tackled …

Рассматривается проблема эффективной параллельной реализации метода ветвей и
границ в задачах дискретной оптимизации. Приводится описание конкретных …

Solving optimally large instances of combinatorial optimisation problems using Branch and
Bound (B&B) algorithms is CPU-time intensive and requires a large number of …

As the Grid proliferates as the next-generation computing infrastructure, a user interface in
the form of" Grid Portals" is becoming increasingly important, especially for computational …

The state-of-the-art large scale approach for solving NP-hard permutation-based problems
using parallel Branch-and-Bound (B&B) techniques is based on a Master-Slave model …

Branch and Bound (B&B) algorithms are attractive for solving to optimality combinatorial
optimization problems (COPs) by exploring a tree-based search space. Nevertheless, they …

The exact resolution of large instances of combinatorial optimization problems, such as
three dimensional quadratic assignment problem (Q3AP), is a real challenge for grid …