15 citations · 21 across the 7 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
cs.DC2012
A GPU-accelerated Branch-and-Bound Algorithm for the Flow-Shop Scheduling Problem
Melab Nouredine, Imen Chakroun, Mezmaz Mohand +1
Branch-and-Bound (B&B) algorithms are time intensive tree-based exploration methods for solving to optimality combinatorial optimization problems. In this paper, we investigate the…
cs.DC2012
An Adaptative Multi-GPU based Branch-and-Bound. A Case Study: the Flow-Shop Scheduling Problem
Imen Chakroun, Nouredine Melab
Solving exactly Combinatorial Optimization Problems (COPs) using a Branch-and-Bound (B&B) algorithm requires a huge amount of computational resources. Therefore, we recently invest…