Daniel Tuyttens

1.9k total citations · 1 hit paper
42 papers, 1.2k citations indexed

About

Daniel Tuyttens is a scholar working on Industrial and Manufacturing Engineering, Computer Networks and Communications and Computational Theory and Mathematics. According to data from OpenAlex, Daniel Tuyttens has authored 42 papers receiving a total of 1.2k indexed citations (citations by other indexed papers that have themselves been cited), including 23 papers in Industrial and Manufacturing Engineering, 14 papers in Computer Networks and Communications and 13 papers in Computational Theory and Mathematics. Recurrent topics in Daniel Tuyttens's work include Scheduling and Optimization Algorithms (16 papers), Optimization and Packing Problems (11 papers) and Optimization and Search Problems (10 papers). Daniel Tuyttens is often cited by papers focused on Scheduling and Optimization Algorithms (16 papers), Optimization and Packing Problems (11 papers) and Optimization and Search Problems (10 papers). Daniel Tuyttens collaborates with scholars based in Belgium, France and Australia. Daniel Tuyttens's co-authors include Jacques Teghem, Philippe Fortemps, Nouredine Melab, Mohand Mezmaz, Taïcir Loukil, Philippe L. Toint, Yacine Kessaci, El‐Ghazali Talbi, Albert Y. Zomaya and Young Choon Lee and has published in prestigious journals such as European Journal of Operational Research, PLoS Medicine and International Journal of Production Economics.

In The Last Decade

Daniel Tuyttens

40 papers receiving 1.1k citations

Hit Papers

A parallel bi-objective hybrid metaheuristic for energy-a... 2011 2026 2016 2021 2011 50 100 150 200
What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

  1. A parallel bi-objective hybrid metaheuristic for energy-aware scheduling for cloud computing systems
    2011 246 citations Mohand Mezmaz, Nouredine Melab et al. Journal of Parallel and Distributed Computing profile →

Peers

Daniel Tuyttens
John W. Chinneck Canada
Nouredine Melab France
Rachid Chelouah France
Ted K. Ralphs United States
Martin Skutella Germany
Gunar E. Liepins United States
Emilie Danna United States
Yuming Xu China
Rohit Khandekar United States
J.E. Rooda Netherlands
John W. Chinneck Canada
Daniel Tuyttens
Citations per year, relative to Daniel Tuyttens Daniel Tuyttens (= 1×) peers John W. Chinneck

Countries citing papers authored by Daniel Tuyttens

Since Specialization
Citations

This map shows the geographic impact of Daniel Tuyttens's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Daniel Tuyttens with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Daniel Tuyttens more than expected).

Fields of papers citing papers by Daniel Tuyttens

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Daniel Tuyttens. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Daniel Tuyttens. The network helps show where Daniel Tuyttens may publish in the future.

Co-authorship network of co-authors of Daniel Tuyttens

This figure shows the co-authorship network connecting the top 25 collaborators of Daniel Tuyttens. A scholar is included among the top collaborators of Daniel Tuyttens based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Daniel Tuyttens. Daniel Tuyttens is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Ragonnet, Romain, Michael T. Meehan, Nouredine Melab, et al.. (2025). Estimating the impact of school closures on the COVID-19 dynamics in 74 countries: A modelling analysis. PLoS Medicine. 22(1). e1004512–e1004512.
2.
Tuyttens, Daniel, et al.. (2024). Observations in applying Bayesian versus evolutionary approaches and their hybrids in parallel time-constrained optimization. Engineering Applications of Artificial Intelligence. 137. 109075–109075. 1 indexed citations
3.
4.
Melab, Nouredine, et al.. (2023). Investigating surrogate-based hybrid acquisition processes. Application to Covid-19 contact mitigation. Applied Soft Computing. 151. 111134–111134.
5.
Toubeau, Jean‐François, et al.. (2022). Batch Acquisition for Parallel Bayesian Optimization—Application to Hydro-Energy Storage Systems Scheduling. Algorithms. 15(12). 446–446. 3 indexed citations
6.
Mezmaz, Mohand, et al.. (2020). A computationally efficient Branch-and-Bound algorithm for the permutation flow-shop scheduling problem. European Journal of Operational Research. 284(3). 814–833. 57 indexed citations
7.
Carneiro, Tiago, et al.. (2019). Towards ultra-scale Branch-and-Bound using a high-productivity language. Future Generation Computer Systems. 105. 196–209. 1 indexed citations
8.
Tuyttens, Daniel, et al.. (2017). Multi-core versus many-core computing for many-task Branch-and-Bound applied to big optimization problems. Future Generation Computer Systems. 82. 472–481. 9 indexed citations
9.
Otero-Mateo, Manuel, Jacques Teghem, & Daniel Tuyttens. (2017). A bi-objective parallel machine problem with eligibility, release dates and delivery times of the jobs. International Journal of Production Research. 56(3). 1030–1053. 14 indexed citations
10.
Mezmaz, Mohand, et al.. (2016). Work stealing with private integer–vector–matrix data structure for multi‐core branch‐and‐bound algorithms. Concurrency and Computation Practice and Experience. 28(18). 4463–4484. 4 indexed citations
11.
Gillis, Nicolas, et al.. (2015). Heuristics for exact nonnegative matrix factorization. Journal of Global Optimization. 65(2). 369–400. 22 indexed citations
12.
Tuyttens, Daniel, et al.. (2014). Towards an efficient resolution of printing problems. Discrete Optimization. 14. 126–146. 7 indexed citations
13.
Lust, Thibaut & Daniel Tuyttens. (2014). Variable and large neighborhood search to solve the multiobjective set covering problem. Journal of Heuristics. 20(2). 165–188. 17 indexed citations
14.
Mezmaz, Mohand, et al.. (2013). Solving the three dimensional quadratic assignment problem on a computational grid. Cluster Computing. 17(2). 205–217. 3 indexed citations
15.
Mezmaz, Mohand, Nouredine Melab, Yacine Kessaci, et al.. (2011). A parallel bi-objective hybrid metaheuristic for energy-aware scheduling for cloud computing systems. Journal of Parallel and Distributed Computing. 71(11). 1497–1508. 246 indexed citations breakdown →
16.
Lecron, Fabian, Pierre Manneback, & Daniel Tuyttens. (2010). Exploiting grid computation for solving the Vehicle Routing Problem. 2723. 1–6. 2 indexed citations
17.
Tuyttens, Daniel, et al.. (2009). Using a greedy random adaptative search procedure to solve the cover printing problem. Computers & Operations Research. 37(4). 640–648. 9 indexed citations
18.
Fortemps, Philippe, et al.. (1996). Using metaheuristics for solving a production scheduling problem in a chemical firm. A case study. International Journal of Production Economics. 46-47. 13–26. 20 indexed citations
19.
Tuyttens, Daniel, et al.. (1994). Homogeneous grouping of nuclear fuel cans through simulated annealing and tabu search. Annals of Operations Research. 50(1). 575–607. 8 indexed citations
20.
Bierlaire, Michel, Philippe L. Toint, & Daniel Tuyttens. (1991). On iterative algorithms for linear least squares problems with bound constraints. Linear Algebra and its Applications. 143. 111–143. 49 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by John W. Chinneck Breakdown of academic impact, for papers by Nouredine Melab Breakdown of academic impact, for papers by Rachid Chelouah Breakdown of academic impact, for papers by Ted K. Ralphs Breakdown of academic impact, for papers by Martin Skutella Breakdown of academic impact, for papers by Gunar E. Liepins Breakdown of academic impact, for papers by Emilie Danna Breakdown of academic impact, for papers by Yuming Xu Breakdown of academic impact, for papers by Rohit Khandekar Breakdown of academic impact, for papers by J.E. Rooda
Rankless by CCL
2026