On Large Scale Nonlinear Network Optimization. - Philippe L. Toint; Daniel Tuyttens (Math. Program., 1990)

LSNNO, a FORTRAN subroutine for solving large-scale nonlinear network optimization problems. - Philippe L. Toint; Daniel Tuyttens (ACM Trans. Math. Softw., 1992)

Homogeneous grouping of nuclear fuel cans through simulated annealing and tabu search. - Daniel Tuyttens; Marc Pirlot; Jacques Teghem; E. Trauwaert; B. Liégeois (Ann. Oper. Res., 1994)

An interactive heuristic method for multi-objective combinatorial optimization. - Jacques Teghem; Daniel Tuyttens; Ekunda L. Ulungu (Comput. Oper. Res., 2000)

Performance of the MOSA Method for the Bicriteria Assignment Problem. - Daniel Tuyttens; Jacques Teghem; Philippe Fortemps; K. Van Nieuwenhuyze (J. Heuristics, 2000)

A Particular Multiobjective Vehicle Routing Problem Solved by Simulated Annealing. - Daniel Tuyttens; Jacques Teghem; Nasser El-Sherbeny (Metaheuristics for Multiobjective Optimisation, 2004)

Solving multi-objective production scheduling problems using metaheuristics. - Taïcir Loukil; Jacques Teghem; Daniel Tuyttens (Eur. J. Oper. Res., 2005)

Metaheuristics in multiple objective optimization. - Andrzej Jaszkiewicz; Daniel Tuyttens (Eur. J. Oper. Res., 2006)

Exploiting grid computation for solving the Vehicle Routing Problem. - Fabian Lecron; Pierre Manneback; Daniel Tuyttens (AICCSA, 2010)

A parallel island-based hybrid genetic algorithm for precedence-constrained applications to minimize energy consumption and makespan. - Mohand-Said Mezmaz; Yacine Kessaci; Young Choon Lee; Nouredine Melab; El-Ghazali Talbi; Albert Y. Zomaya; Daniel Tuyttens (GRID, 2010)

Using a greedy random adaptative search procedure to solve the cover printing problem. - Daniel Tuyttens; Arnaud Vandaele (Comput. Oper. Res., 2010)

Very Large-Scale Neighborhood Search for Solving Multiobjective Combinatorial Optimization Problems. - Thibaut Lust; Jacques Teghem; Daniel Tuyttens (EMO, 2011)

A parallel bi-objective hybrid metaheuristic for energy-aware scheduling for cloud computing systems. - Mohand-Said Mezmaz; Nouredine Melab; Yacine Kessaci; Young Choon Lee; El-Ghazali Talbi; Albert Y. Zomaya; Daniel Tuyttens (J. Parallel Distributed Comput., 2011)

Parallel Evolutionary Algorithms for Energy Aware Scheduling. - Yacine Kessaci; Mohand Mezmaz; Nouredine Melab; El-Ghazali Talbi; Daniel Tuyttens (Intelligent Decision Systems in Large-Scale Distributed Environments, 2011)

A GPU-accelerated Branch-and-Bound Algorithm for the Flow-Shop Scheduling Problem. - Nouredine Melab; Imen Chakroun; Mohand Mezmaz; Daniel Tuyttens (CLUSTER, 2012)

Two-Phase Pareto Local Search to Solve the Biobjective Set Covering Problem. - Thibaut Lust; Daniel Tuyttens (TAAI, 2013)

Combining multi-core and GPU computing for solving combinatorial optimization problems. - Imen Chakroun; Nordine Melab; Mohand-Said Mezmaz; Daniel Tuyttens (J. Parallel Distributed Comput., 2013)

A Multi-core Parallel Branch-and-Bound Algorithm Using Factorial Number System. - Mohand Mezmaz; Rudi Leroy; Nouredine Melab; Daniel Tuyttens (IPDPS, 2014)

Work Stealing Strategies For Multi-Core Parallel Branch-and-Bound Algorithm Using Factorial Number System. - Rudi Leroy; Mohand Mezmaz; Nouredine Melab; Daniel Tuyttens (PMAM, 2014)

Solving the three dimensional quadratic assignment problem on a computational grid. - Mohand Mezmaz; Malika Mehdi; Pascal Bouvry; Nordine Melab; El-Ghazali Talbi; Daniel Tuyttens (Clust. Comput., 2014)

Towards an efficient resolution of printing problems. - Daniel Tuyttens; Arnaud Vandaele (Discret. Optim., 2014)

Variable and large neighborhood search to solve the multiobjective set covering problem. - Thibaut Lust; Daniel Tuyttens (J. Heuristics, 2014)

A bi-objective approach to reschedule new jobs in a one machine model. - Jacques Teghem; Daniel Tuyttens (Int. Trans. Oper. Res., 2014)

Parallel Branch-and-Bound using private IVM-based work stealing on Xeon Phi MIC coprocessor. - Nouredine Melab; Rudi Leroy; Mohand Mezmaz; Daniel Tuyttens (HPCS, 2015)

IVM-Based Work Stealing for Parallel Branch-and-Bound on GPU. - Jan Gmys; Mohand Mezmaz; Nouredine Melab; Daniel Tuyttens (PPAM (1), 2015)

A GPU-Based Backtracking Algorithm for Permutation Combinatorial Problems. - Tiago Carneiro Pessoa; Jan Gmys; Nouredine Melab; Francisco Heron de Carvalho Junior; Daniel Tuyttens (ICA3PP, 2016)

Vectorization of local search for solving flow-shop scheduling problem on Xeon Phi™ MIC co-processors. - Gautier Vaillant; Mohand Mezmaz; Daniel Tuyttens; Nouredine Melab (HPCS, 2016)

Work stealing with private integer-vector-matrix data structure for multi-core branch-and-bound algorithms. - Jan Gmys; Rudi Leroy; Mohand Mezmaz; Nouredine Melab; Daniel Tuyttens (Concurr. Comput. Pract. Exp., 2016)

Heuristics for exact nonnegative matrix factorization. - Arnaud Vandaele; Nicolas Gillis; François Glineur; Daniel Tuyttens (J. Glob. Optim., 2016)

A GPU-based Branch-and-Bound algorithm using Integer-Vector-Matrix data structure. - Jan Gmys; Mohand-Said Mezmaz; Nouredine Melab; Daniel Tuyttens (Parallel Comput., 2016)

Parallel multi-core hyper-heuristic GRASP to solve permutation flow-shop problem. - Ekaterina Alekseeva; Mohand Mezmaz; Daniel Tuyttens; Nouredine Melab (Concurr. Comput. Pract. Exp., 2017)

IVM-based parallel branch-and-bound using hierarchical work stealing on multi-GPU systems. - Jan Gmys; Mohand Mezmaz; Nouredine Melab; Daniel Tuyttens (Concurr. Comput. Pract. Exp., 2017)

An Adaptive Evolution Control based on Confident Regions for Surrogate-assisted Optimization. - Guillaume Briffoteaux; Nouredine Melab; Mohand Mezmaz; Daniel Tuyttens (HPCS, 2018)

Dynamic Configuration of CUDA Runtime Variables for CDP-Based Divide-and-Conquer Algorithms. - Tiago Carneiro 001; Jan Gmys; Nouredine Melab; Francisco Heron de Carvalho Junior; Pedro Pedrosa Rebouças Filho; Daniel Tuyttens (VECPAR, 2018)

GPU-accelerated backtracking using CUDA Dynamic Parallelism. - Tiago Carneiro Pessoa; Jan Gmys; Francisco Heron de Carvalho Junior; Nouredine Melab; Daniel Tuyttens (Concurr. Comput. Pract. Exp., 2018)

Multi-core versus many-core computing for many-task Branch-and-Bound applied to big optimization problems. - Nouredine Melab; Jan Gmys; Mohand-Said Mezmaz; Daniel Tuyttens (Future Gener. Comput. Syst., 2018)

A bi-objective parallel machine problem with eligibility, release dates and delivery times of the jobs. - Manuel Mateo; Jacques Teghem; Daniel Tuyttens (Int. J. Prod. Res., 2018)

Surrogate-Assisted Optimization for Multi-stage Optimal Scheduling of Virtual Power Plants. - Maxime Gobert 002; Jan Gmys; Jean-François Toubeau; François Vallée; Nouredine Melab; Daniel Tuyttens (HPCS, 2019)

A computationally efficient Branch-and-Bound algorithm for the permutation flow-shop scheduling problem. - Jan Gmys; Mohand Mezmaz; Nouredine Melab; Daniel Tuyttens (Eur. J. Oper. Res., 2020)

Evolution Control for parallel ANN-assisted simulation-based optimization application to Tuberculosis Transmission Control. - Guillaume Briffoteaux; Romain Ragonnet; Mohand-Said Mezmaz; Nouredine Melab; Daniel Tuyttens (Future Gener. Comput. Syst., 2020)

Towards ultra-scale Branch-and-Bound using a high-productivity language. - Tiago Carneiro 001; Jan Gmys; Nouredine Melab; Daniel Tuyttens (Future Gener. Comput. Syst., 2020)

Parallel surrogate-assisted optimization: Batched Bayesian Neural Network-assisted GA versus q-EGO. - Guillaume Briffoteaux; Maxime Gobert 002; Romain Ragonnet; Jan Gmys; Mohand Mezmaz; Nouredine Melab; Daniel Tuyttens (Swarm Evol. Comput., 2020)

A comparative study of high-productivity high-performance programming languages for parallel metaheuristics. - Jan Gmys; Tiago Carneiro 001; Nouredine Melab; El-Ghazali Talbi; Daniel Tuyttens (Swarm Evol. Comput., 2020)

Many-Core Branch-and-Bound for GPU Accelerators and MIC Coprocessors. - Nouredine Melab; Jan Gmys; Mohand Mezmaz; Daniel Tuyttens (High-Performance Simulation-Based Optimization, 2020)

Hybrid Acquisition Processes in Surrogate-Based Optimization. Application to Covid-19 Contact Reduction. - Guillaume Briffoteaux; Nouredine Melab; Mohand Mezmaz; Daniel Tuyttens (BIOMA, 2022)

Parallel Bayesian Optimization for Optimal Scheduling of Underground Pumped Hydro-Energy Storage Systems. - Maxime Gobert 002; Jan Gmys; Jean-François Toubeau; Nouredine Melab; Daniel Tuyttens; François Vallée (IPDPS Workshops, 2022)

Comparing Parallel Surrogate-Based and Surrogate-Free Multi-objective Optimization of COVID-19 Vaccines Allocation. - Guillaume Briffoteaux; Romain Ragonnet; Pierre Tomenko; Mohand Mezmaz; Nouredine Melab; Daniel Tuyttens (OLA, 2022)

Batch Acquisition for Parallel Bayesian Optimization - Application to Hydro-Energy Storage Systems Scheduling. - Maxime Gobert 002; Jan Gmys; Jean-François Toubeau; Nouredine Melab; Daniel Tuyttens; François Vallée (Algorithms, 2022)

Observations in applying Bayesian versus evolutionary approaches and their hybrids in parallel time-constrained optimization. - Maxime Gobert 002; Guillaume Briffoteaux; Jan Gmys; Nouredine Melab; Daniel Tuyttens (Eng. Appl. Artif. Intell., 2024)

Investigating surrogate-based hybrid acquisition processes. Application to Covid-19 contact mitigation. - Guillaume Briffoteaux; Nouredine Melab; Mohand Mezmaz; Daniel Tuyttens (Appl. Soft Comput., 2024)