default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaniel Tuyttens
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j30]Guillaume Briffoteaux
, Nouredine Melab, Mohand Mezmaz, Daniel Tuyttens:
Investigating surrogate-based hybrid acquisition processes. Application to Covid-19 contact mitigation. Appl. Soft Comput. 151: 111134 (2024)- [j29]Maxime Gobert, Guillaume Briffoteaux, Jan Gmys, Nouredine Melab, Daniel Tuyttens:
Observations in applying Bayesian versus evolutionary approaches and their hybrids in parallel time-constrained optimization. Eng. Appl. Artif. Intell. 137: 109075 (2024) - 2022
- [j28]Maxime Gobert, Jan Gmys, Jean-François Toubeau, Nouredine Melab, Daniel Tuyttens, François Vallée:
Batch Acquisition for Parallel Bayesian Optimization - Application to Hydro-Energy Storage Systems Scheduling. Algorithms 15(12): 446 (2022) - [c17]Guillaume Briffoteaux, Nouredine Melab, Mohand Mezmaz, Daniel Tuyttens:
Hybrid Acquisition Processes in Surrogate-Based Optimization. Application to Covid-19 Contact Reduction. BIOMA 2022: 127-141 - [c16]Maxime Gobert, Jan Gmys, Jean-François Toubeau, Nouredine Melab, Daniel Tuyttens, François Vallée:
Parallel Bayesian Optimization for Optimal Scheduling of Underground Pumped Hydro-Energy Storage Systems. IPDPS Workshops 2022: 790-797 - [c15]Guillaume Briffoteaux, Romain Ragonnet, Pierre Tomenko, Mohand Mezmaz, Nouredine Melab, Daniel Tuyttens:
Comparing Parallel Surrogate-Based and Surrogate-Free Multi-objective Optimization of COVID-19 Vaccines Allocation. OLA 2022: 201-212 - 2020
- [j27]Jan Gmys, Mohand Mezmaz, Nouredine Melab, Daniel Tuyttens:
A computationally efficient Branch-and-Bound algorithm for the permutation flow-shop scheduling problem. Eur. J. Oper. Res. 284(3): 814-833 (2020) - [j26]Tiago Carneiro, Jan Gmys, Nouredine Melab, Daniel Tuyttens:
Towards ultra-scale Branch-and-Bound using a high-productivity language. Future Gener. Comput. Syst. 105: 196-209 (2020) - [j25]Guillaume Briffoteaux, Romain Ragonnet, Mohand-Said Mezmaz, Nouredine Melab, Daniel Tuyttens:
Evolution Control for parallel ANN-assisted simulation-based optimization application to Tuberculosis Transmission Control. Future Gener. Comput. Syst. 113: 454-467 (2020) - [j24]Guillaume Briffoteaux, Maxime Gobert, Romain Ragonnet, Jan Gmys, Mohand Mezmaz, Nouredine Melab, Daniel Tuyttens:
Parallel surrogate-assisted optimization: Batched Bayesian Neural Network-assisted GA versus q-EGO. Swarm Evol. Comput. 57: 100717 (2020) - [j23]Jan Gmys, Tiago Carneiro, Nouredine Melab, El-Ghazali Talbi, Daniel Tuyttens:
A comparative study of high-productivity high-performance programming languages for parallel metaheuristics. Swarm Evol. Comput. 57: 100720 (2020) - [p3]Nouredine Melab, Jan Gmys, Mohand Mezmaz, Daniel Tuyttens:
Many-Core Branch-and-Bound for GPU Accelerators and MIC Coprocessors. High-Performance Simulation-Based Optimization 2020: 275-291
2010 – 2019
- 2019
- [c14]Maxime Gobert, Jan Gmys, Jean-François Toubeau, François Vallée, Nouredine Melab, Daniel Tuyttens:
Surrogate-Assisted Optimization for Multi-stage Optimal Scheduling of Virtual Power Plants. HPCS 2019: 113-120 - 2018
- [j22]Tiago Carneiro Pessoa, Jan Gmys, Francisco Heron de Carvalho Junior, Nouredine Melab, Daniel Tuyttens:
GPU-accelerated backtracking using CUDA Dynamic Parallelism. Concurr. Comput. Pract. Exp. 30(9) (2018) - [j21]Nouredine Melab, Jan Gmys, Mohand-Said Mezmaz, Daniel Tuyttens:
Multi-core versus many-core computing for many-task Branch-and-Bound applied to big optimization problems. Future Gener. Comput. Syst. 82: 472-481 (2018) - [j20]Manuel Mateo, Jacques Teghem, Daniel Tuyttens:
A bi-objective parallel machine problem with eligibility, release dates and delivery times of the jobs. Int. J. Prod. Res. 56(3): 1030-1053 (2018) - [c13]Guillaume Briffoteaux, Nouredine Melab, Mohand Mezmaz, Daniel Tuyttens:
An Adaptive Evolution Control based on Confident Regions for Surrogate-assisted Optimization. HPCS 2018: 802-809 - [c12]Tiago Carneiro, Jan Gmys, Nouredine Melab, Francisco Heron de Carvalho Junior, Pedro Pedrosa Rebouças Filho, Daniel Tuyttens:
Dynamic Configuration of CUDA Runtime Variables for CDP-Based Divide-and-Conquer Algorithms. VECPAR 2018: 16-30 - 2017
- [j19]Ekaterina Alekseeva, Mohand Mezmaz, Daniel Tuyttens, Nouredine Melab:
Parallel multi-core hyper-heuristic GRASP to solve permutation flow-shop problem. Concurr. Comput. Pract. Exp. 29(9) (2017) - [j18]Jan Gmys, Mohand Mezmaz, Nouredine Melab, Daniel Tuyttens:
IVM-based parallel branch-and-bound using hierarchical work stealing on multi-GPU systems. Concurr. Comput. Pract. Exp. 29(9) (2017) - 2016
- [j17]Jan Gmys, Rudi Leroy, Mohand Mezmaz, Nouredine Melab, Daniel Tuyttens:
Work stealing with private integer-vector-matrix data structure for multi-core branch-and-bound algorithms. Concurr. Comput. Pract. Exp. 28(18): 4463-4484 (2016) - [j16]Arnaud Vandaele, Nicolas Gillis, François Glineur, Daniel Tuyttens:
Heuristics for exact nonnegative matrix factorization. J. Glob. Optim. 65(2): 369-400 (2016) - [j15]Jan Gmys, Mohand-Said Mezmaz, Nouredine Melab, Daniel Tuyttens:
A GPU-based Branch-and-Bound algorithm using Integer-Vector-Matrix data structure. Parallel Comput. 59: 119-139 (2016) - [c11]Tiago Carneiro Pessoa, Jan Gmys, Nouredine Melab, Francisco Heron de Carvalho Junior, Daniel Tuyttens:
A GPU-Based Backtracking Algorithm for Permutation Combinatorial Problems. ICA3PP 2016: 310-324 - [c10]Gautier Vaillant, Mohand Mezmaz, Daniel Tuyttens, Nouredine Melab:
Vectorization of local search for solving flow-shop scheduling problem on Xeon Phi™ MIC co-processors. HPCS 2016: 729-735 - 2015
- [c9]Nouredine Melab, Rudi Leroy, Mohand Mezmaz, Daniel Tuyttens:
Parallel Branch-and-Bound using private IVM-based work stealing on Xeon Phi MIC coprocessor. HPCS 2015: 394-399 - [c8]Jan Gmys, Mohand Mezmaz, Nouredine Melab, Daniel Tuyttens:
IVM-Based Work Stealing for Parallel Branch-and-Bound on GPU. PPAM (1) 2015: 548-558 - 2014
- [j14]Mohand Mezmaz, Malika Mehdi, Pascal Bouvry, Nordine Melab, El-Ghazali Talbi, Daniel Tuyttens:
Solving the three dimensional quadratic assignment problem on a computational grid. Clust. Comput. 17(2): 205-217 (2014) - [j13]Daniel Tuyttens, Arnaud Vandaele:
Towards an efficient resolution of printing problems. Discret. Optim. 14: 126-146 (2014) - [j12]Thibaut Lust, Daniel Tuyttens:
Variable and large neighborhood search to solve the multiobjective set covering problem. J. Heuristics 20(2): 165-188 (2014) - [j11]Jacques Teghem, Daniel Tuyttens:
A bi-objective approach to reschedule new jobs in a one machine model. Int. Trans. Oper. Res. 21(6): 871-898 (2014) - [c7]Mohand Mezmaz, Rudi Leroy, Nouredine Melab, Daniel Tuyttens:
A Multi-core Parallel Branch-and-Bound Algorithm Using Factorial Number System. IPDPS 2014: 1203-1212 - [c6]Rudi Leroy, Mohand Mezmaz, Nouredine Melab, Daniel Tuyttens:
Work Stealing Strategies For Multi-Core Parallel Branch-and-Bound Algorithm Using Factorial Number System. PMAM 2014: 111 - [i2]Arnaud Vandaele, Nicolas Gillis, François Glineur, Daniel Tuyttens:
Heuristics for Exact Nonnegative Matrix Factorization. CoRR abs/1411.7245 (2014) - 2013
- [j10]Imen Chakroun, Nordine Melab, Mohand-Said Mezmaz, Daniel Tuyttens:
Combining multi-core and GPU computing for solving combinatorial optimization problems. J. Parallel Distributed Comput. 73(12): 1563-1577 (2013) - [c5]Thibaut Lust, Daniel Tuyttens:
Two-Phase Pareto Local Search to Solve the Biobjective Set Covering Problem. TAAI 2013: 397-402 - 2012
- [c4]Nouredine Melab, Imen Chakroun, Mohand Mezmaz, Daniel Tuyttens:
A GPU-accelerated Branch-and-Bound Algorithm for the Flow-Shop Scheduling Problem. CLUSTER 2012: 10-17 - [i1]Nouredine Melab, Imen Chakroun, Mohand-Said Mezmaz, Daniel Tuyttens:
A GPU-accelerated Branch-and-Bound Algorithm for the Flow-Shop Scheduling Problem. CoRR abs/1208.3933 (2012) - 2011
- [j9]Mohand-Said Mezmaz, Nouredine Melab, Yacine Kessaci, Young Choon Lee, El-Ghazali Talbi, Albert Y. Zomaya, Daniel Tuyttens:
A parallel bi-objective hybrid metaheuristic for energy-aware scheduling for cloud computing systems. J. Parallel Distributed Comput. 71(11): 1497-1508 (2011) - [c3]Thibaut Lust, Jacques Teghem, Daniel Tuyttens:
Very Large-Scale Neighborhood Search for Solving Multiobjective Combinatorial Optimization Problems. EMO 2011: 254-268 - [p2]Yacine Kessaci, Mohand Mezmaz, Nouredine Melab, El-Ghazali Talbi, Daniel Tuyttens:
Parallel Evolutionary Algorithms for Energy Aware Scheduling. Intelligent Decision Systems in Large-Scale Distributed Environments 2011: 75-100 - 2010
- [j8]Daniel Tuyttens, Arnaud Vandaele:
Using a greedy random adaptative search procedure to solve the cover printing problem. Comput. Oper. Res. 37(4): 640-648 (2010) - [c2]Fabian Lecron, Pierre Manneback, Daniel Tuyttens:
Exploiting grid computation for solving the Vehicle Routing Problem. AICCSA 2010: 1-6 - [c1]Mohand-Said Mezmaz, Yacine Kessaci, Young Choon Lee, Nouredine Melab, El-Ghazali Talbi, Albert Y. Zomaya, Daniel Tuyttens:
A parallel island-based hybrid genetic algorithm for precedence-constrained applications to minimize energy consumption and makespan. GRID 2010: 274-281
2000 – 2009
- 2006
- [j7]Andrzej Jaszkiewicz, Daniel Tuyttens:
Metaheuristics in multiple objective optimization. Eur. J. Oper. Res. 169(3): 873-874 (2006) - 2005
- [j6]Taïcir Loukil, Jacques Teghem, Daniel Tuyttens:
Solving multi-objective production scheduling problems using metaheuristics. Eur. J. Oper. Res. 161(1): 42-61 (2005) - 2004
- [p1]Daniel Tuyttens, Jacques Teghem, Nasser El-Sherbeny:
A Particular Multiobjective Vehicle Routing Problem Solved by Simulated Annealing. Metaheuristics for Multiobjective Optimisation 2004: 133-152 - 2000
- [j5]Jacques Teghem, Daniel Tuyttens, Ekunda L. Ulungu:
An interactive heuristic method for multi-objective combinatorial optimization. Comput. Oper. Res. 27(7-8): 621-634 (2000) - [j4]Daniel Tuyttens, Jacques Teghem, Philippe Fortemps, K. Van Nieuwenhuyze:
Performance of the MOSA Method for the Bicriteria Assignment Problem. J. Heuristics 6(3): 295-310 (2000)
1990 – 1999
- 1994
- [j3]Daniel Tuyttens, Marc Pirlot, Jacques Teghem, E. Trauwaert, B. Liégeois:
Homogeneous grouping of nuclear fuel cans through simulated annealing and tabu search. Ann. Oper. Res. 50(1): 575-607 (1994) - 1992
- [j2]Philippe L. Toint, Daniel Tuyttens:
LSNNO, a FORTRAN subroutine for solving large-scale nonlinear network optimization problems. ACM Trans. Math. Softw. 18(3): 308-328 (1992) - 1990
- [j1]Philippe L. Toint, Daniel Tuyttens:
On Large Scale Nonlinear Network Optimization. Math. Program. 48: 125-159 (1990)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-10 01:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
