Now showing items 1-6 of 6
P2P design and implementation of a parallel branch and bound algorithm for grids
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 computational resources. To harness such huge amount of ...
An adaptive hierarchical master-worker (AHMW) framework for grids - Application to B&B algorithms
Well-suited to embarrassingly parallel applications, the master–worker (MW) paradigm has largely and successfully used in parallel distributed computing. Nevertheless, such a paradigm is very limited in scalability in large ...
FTH-B&B: a Fault-Tolerant Hierarchical Branch and Bound for Large Scale Unreliable Environment
Solving to optimality large instances of combinatorial optimization problems using Brand and Bound (B&B) algorithms requires a huge amount of computing resources. In this paper, we investigate the design and implementation ...
GPU-accelerated Bounding for Branch-and-Bound applied to a Permutation Problem using Data Access Optimization
(John Wiley & Sons, 2013-11)
Branch-and-Bound (B\&B) algorithms are attractive methods for solving to optimality combinatorial optimization problems using an implicit enumeration of a dynamically built tree-based search space. Nevertheless, they are ...
Hierarchical Branch and Bound Algorithm for Computational Grids
Branch and Bound (B&B) algorithms are efficiently used for exact resolution of combinatorial optimization problems (COPs). They are easy to parallelize using the Master/Worker paradigm (MW) but limited in scalability when ...
Reducing thread divergence in a GPU-accelerated branch-and-bound algorithm
In this paper, we address the design and implementation of GPU-accelerated Branch-and-Bound algorithms (B&B) for solving Flow-shop scheduling optimization problems (FSP). Such applications are CPU-time consuming and highly ...