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)

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)

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)

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)

Heterogeneous cluster computing for many-task exact optimization - Application to permutation problems. (Optimisation massivement multi-tâche sur grappes de calcul hétérogènes - Application aux problèmes de permutation). - Jan Gmys (2017)

Optimal Solving of Permutation-based Optimization Problems on Heterogeneous CPU/GPU Clusters. - Jan Gmys (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)

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)

Solving large permutation flow-shop scheduling problems on GPU-accelerated supercomputers. - Jan Gmys (CoRR, 2020)

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)

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)

Synergy between parallel computing, optimization and simulation. - Nouredine Melab; Jan Gmys; Peter Korosec; Imen Chakroun (J. Comput. Sci., 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)

Paradiseo: from a modular framework for evolutionary computation to the automated design of metaheuristics: 22 years of Paradiseo. - Johann Dréo; Arnaud Liefooghe; Sébastien Vérel; Marc Schoenauer; Juan Julián Merelo Guervós; Alexandre Quemy; Benjamin Bouvier; Jan Gmys (GECCO Companion, 2021)

Parallel Beam Search for Combinatorial Optimization. - Nikolaus Frohner; Jan Gmys; Nouredine Melab; Günther R. Raidl; El-Ghazali Talbi (ICPP Workshops, 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)

A performance-oriented comparative study of the Chapel high-productivity language to conventional programming environments. - Guillaume Helbecque; Jan Gmys; Tiago Carneiro 001; Nouredine Melab; Pascal Bouvry (PMAM@PPoPP, 2022)

Parallel Beam Search for Combinatorial Optimization (Extended Abstract). - Nikolaus Frohner; Jan Gmys; Nouredine Melab; Günther R. Raidl; El-Ghazali Talbi (SOCS, 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)

Exactly Solving Hard Permutation Flowshop Scheduling Problems on Peta-Scale GPU-Accelerated Supercomputers. - Jan Gmys (INFORMS J. Comput., 2022)

Parallel distributed productivity-aware tree-search using Chapel. - Guillaume Helbecque; Jan Gmys; Nouredine Melab; Tiago Carneiro 001; Pascal Bouvry (Concurr. Comput. Pract. Exp., 2023)

PGAS Data Structure for Unbalanced Tree-Based Algorithms at Scale. - Guillaume Helbecque; Tiago Carneiro 001; Nouredine Melab; Jan Gmys; Pascal Bouvry (ICCS (3), 2024)

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)