activity
20122023
most citedMulti-fidelity modeling with different input domain definitions using Deep Gaussian Processes

51 citations · 65 across the 4 of their papers we have counts for

collaborators
Showing cs.DCShow all

1 paper · 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…