39 citations · 39 across the 2 of their papers we have counts for
2 papers
math.OC2014★ 39 cited
Heuristics for Exact Nonnegative Matrix Factorization
Arnaud Vandaele, Nicolas Gillis, François Glineur +1
The exact nonnegative matrix factorization (exact NMF) problem is the following: given an -by- nonnegative matrix and a factorization rank , find, if possible, an -…
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…