Daniel Tuyttens

Orcid: 0000-0002-2567-1324

According to our database1, Daniel Tuyttens authored at least 50 papers between 1990 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Investigating surrogate-based hybrid acquisition processes. Application to Covid-19 contact mitigation.
Appl. Soft Comput., January, 2024

Observations in applying Bayesian versus evolutionary approaches and their hybrids in parallel time-constrained optimization.
Eng. Appl. Artif. Intell., 2024

2022
Batch Acquisition for Parallel Bayesian Optimization - Application to Hydro-Energy Storage Systems Scheduling.
Algorithms, 2022

Comparing Parallel Surrogate-Based and Surrogate-Free Multi-objective Optimization of COVID-19 Vaccines Allocation.
Proceedings of the Optimization and Learning - 5th International Conference, 2022

Parallel Bayesian Optimization for Optimal Scheduling of Underground Pumped Hydro-Energy Storage Systems.
Proceedings of the IEEE International Parallel and Distributed Processing Symposium, 2022

Hybrid Acquisition Processes in Surrogate-Based Optimization. Application to Covid-19 Contact Reduction.
Proceedings of the Bioinspired Optimization Methods and Their Applications, 2022

2020
Many-Core Branch-and-Bound for GPU Accelerators and MIC Coprocessors.
Proceedings of the High-Performance Simulation-Based Optimization, 2020

A comparative study of high-productivity high-performance programming languages for parallel metaheuristics.
Swarm Evol. Comput., 2020

Parallel surrogate-assisted optimization: Batched Bayesian Neural Network-assisted GA versus q-EGO.
Swarm Evol. Comput., 2020

Towards ultra-scale Branch-and-Bound using a high-productivity language.
Future Gener. Comput. Syst., 2020

Evolution Control for parallel ANN-assisted simulation-based optimization application to Tuberculosis Transmission Control.
Future Gener. Comput. Syst., 2020

A computationally efficient Branch-and-Bound algorithm for the permutation flow-shop scheduling problem.
Eur. J. Oper. Res., 2020

2019
Surrogate-Assisted Optimization for Multi-stage Optimal Scheduling of Virtual Power Plants.
Proceedings of the 17th International Conference on High Performance Computing & Simulation, 2019

2018
A bi-objective parallel machine problem with eligibility, release dates and delivery times of the jobs.
Int. J. Prod. Res., 2018

Multi-core <i>versus</i> many-core computing for many-task Branch-and-Bound applied to big optimization problems.
Future Gener. Comput. Syst., 2018

GPU-accelerated backtracking using CUDA Dynamic Parallelism.
Concurr. Comput. Pract. Exp., 2018

Dynamic Configuration of CUDA Runtime Variables for CDP-Based Divide-and-Conquer Algorithms.
Proceedings of the High Performance Computing for Computational Science - VECPAR 2018, 2018

An Adaptive Evolution Control based on Confident Regions for Surrogate-assisted Optimization.
Proceedings of the 2018 International Conference on High Performance Computing & Simulation, 2018

2017
IVM-based parallel branch-and-bound using hierarchical work stealing on multi-GPU systems.
Concurr. Comput. Pract. Exp., 2017

Parallel multi-core hyper-heuristic GRASP to solve permutation flow-shop problem.
Concurr. Comput. Pract. Exp., 2017

2016
A GPU-based Branch-and-Bound algorithm using Integer-Vector-Matrix data structure.
Parallel Comput., 2016

Heuristics for exact nonnegative matrix factorization.
J. Glob. Optim., 2016

Work stealing with private integer-vector-matrix data structure for multi-core branch-and-bound algorithms.
Concurr. Comput. Pract. Exp., 2016

Vectorization of local search for solving flow-shop scheduling problem on Xeon Phi™ MIC co-processors.
Proceedings of the International Conference on High Performance Computing & Simulation, 2016

A GPU-Based Backtracking Algorithm for Permutation Combinatorial Problems.
Proceedings of the Algorithms and Architectures for Parallel Processing, 2016

2015
IVM-Based Work Stealing for Parallel Branch-and-Bound on GPU.
Proceedings of the Parallel Processing and Applied Mathematics, 2015

Parallel Branch-and-Bound using private IVM-based work stealing on Xeon Phi MIC coprocessor.
Proceedings of the 2015 International Conference on High Performance Computing & Simulation, 2015

2014
A bi-objective approach to reschedule new jobs in a one machine model.
Int. Trans. Oper. Res., 2014

Variable and large neighborhood search to solve the multiobjective set covering problem.
J. Heuristics, 2014

Towards an efficient resolution of printing problems.
Discret. Optim., 2014

Solving the three dimensional quadratic assignment problem on a computational grid.
Clust. Comput., 2014

Work Stealing Strategies For Multi-Core Parallel Branch-and-Bound Algorithm Using Factorial Number System.
Proceedings of the 2014 PPOPP International Workshop on Programming Models and Applications for Multicores and Manycores, 2014

A Multi-core Parallel Branch-and-Bound Algorithm Using Factorial Number System.
Proceedings of the 2014 IEEE 28th International Parallel and Distributed Processing Symposium, 2014

2013
Combining multi-core and GPU computing for solving combinatorial optimization problems.
J. Parallel Distributed Comput., 2013

Two-Phase Pareto Local Search to Solve the Biobjective Set Covering Problem.
Proceedings of the Conference on Technologies and Applications of Artificial Intelligence, 2013

2012
A GPU-accelerated Branch-and-Bound Algorithm for the Flow-Shop Scheduling Problem.
Proceedings of the 2012 IEEE International Conference on Cluster Computing, 2012

2011
Parallel Evolutionary Algorithms for Energy Aware Scheduling.
Proceedings of the Intelligent Decision Systems in Large-Scale Distributed Environments, 2011

A parallel bi-objective hybrid metaheuristic for energy-aware scheduling for cloud computing systems.
J. Parallel Distributed Comput., 2011

Very Large-Scale Neighborhood Search for Solving Multiobjective Combinatorial Optimization Problems.
Proceedings of the Evolutionary Multi-Criterion Optimization, 2011

2010
Using a greedy random adaptative search procedure to solve the cover printing problem.
Comput. Oper. Res., 2010

A parallel island-based hybrid genetic algorithm for precedence-constrained applications to minimize energy consumption and makespan.
Proceedings of the 2010 11th IEEE/ACM International Conference on Grid Computing, 2010

Exploiting grid computation for solving the Vehicle Routing Problem.
Proceedings of the 8th ACS/IEEE International Conference on Computer Systems and Applications, 2010

2006
Metaheuristics in multiple objective optimization.
Eur. J. Oper. Res., 2006

2005
Solving multi-objective production scheduling problems using metaheuristics.
Eur. J. Oper. Res., 2005

2004
A Particular Multiobjective Vehicle Routing Problem Solved by Simulated Annealing.
Proceedings of the Metaheuristics for Multiobjective Optimisation, 2004

2000
Performance of the MOSA Method for the Bicriteria Assignment Problem.
J. Heuristics, 2000

An interactive heuristic method for multi-objective combinatorial optimization.
Comput. Oper. Res., 2000

1994
Homogeneous grouping of nuclear fuel cans through simulated annealing and tabu search.
Ann. Oper. Res., 1994

1992
LSNNO, a FORTRAN subroutine for solving large-scale nonlinear network optimization problems.
ACM Trans. Math. Softw., 1992

1990
On Large Scale Nonlinear Network Optimization.
Math. Program., 1990


  Loading...