◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

D. Tuyttens

2 papers hereh-index 201.9k citations80 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • last author2

Across the 2 of 2 papers where every author was matched, so the position is known.

fields
  • cs.DC1
  • math.OC1

identity via Semantic Scholar / OpenAlex

most citedHeuristics for Exact Nonnegative Matrix Factorization

39 citations · 39 across the 2 of their papers we have counts for

collaborators

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 m-by-n nonnegative matrix X and a factorization rank r, find, if possible, an m-…

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…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.