![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Thé Van Luong
Person information
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [c12]Thé Van Luong
, Éric D. Taillard:
Unsupervised Machine Learning for the Quadratic Assignment Problem. MIC 2022: 118-132
2010 – 2019
- 2013
- [j2]Thé Van Luong
, Nouredine Melab, El-Ghazali Talbi:
GPU Computing for Parallel Local Search Metaheuristic Algorithms. IEEE Trans. Computers 62(1): 173-185 (2013) - [c11]Nouredine Melab, Thé Van Luong
, Karima Boufaras, El-Ghazali Talbi:
ParadisEO-MO-GPU: a framework for parallel GPU-based local search metaheuristics. GECCO 2013: 1189-1196 - 2012
- [c10]Thé Van Luong
, Éric D. Taillard, Nouredine Melab, El-Ghazali Talbi:
Parallelization Strategies for Hybrid Metaheuristics Using a Single GPU and Multi-core Resources. PPSN (2) 2012: 368-377 - 2011
- [b1]Thé Van Luong:
Métaheuristiques parallèles sur GPU. (Parallel metaheuristics on GPU). Lille University of Science and Technology, France, 2011 - [c9]Thé Van Luong
, Nouredine Melab, El-Ghazali Talbi:
GPU-Based Approaches for Multiobjective Local Search Algorithms. A Case Study: The Flowshop Scheduling Problem. EvoCOP 2011: 155-166 - [c8]Nouredine Melab, Thé Van Luong
, Karima Boufaras, El-Ghazali Talbi:
Towards ParadisEO-MO-GPU: A Framework for GPU-Based Local Search Metaheuristics. IWANN (1) 2011: 401-408 - [c7]Thé Van Luong
, Nouredine Melab, El-Ghazali Talbi:
GPU-Based Multi-start Local Search Algorithms. LION 2011: 321-335 - 2010
- [j1]Thé Van Luong
, Nouredine Melab, El-Ghazali Talbi:
Neighborhood Structures for GPU-Based Local Search Algorithms. Parallel Process. Lett. 20(4): 307-324 (2010) - [c6]Naouel Ayari, Thé Van Luong
, Abderrazak Jemai
:
A hybrid genetic algorithm for Golomb ruler problem. AICCSA 2010: 1-4 - [c5]Thé Van Luong
, Lakhdar Loukil, Nouredine Melab, El-Ghazali Talbi:
A GPU-based iterated tabu search for solving the quadratic 3-dimensional assignment problem. AICCSA 2010: 1-8 - [c4]Thé Van Luong
, Nouredine Melab, El-Ghazali Talbi:
Parallel hybrid evolutionary algorithms on GPU. IEEE Congress on Evolutionary Computation 2010: 1-8 - [c3]Thé Van Luong
, Nouredine Melab, El-Ghazali Talbi:
Local Search Algorithms on Graphics Processing Units. A Case Study: The Permutation Perceptron Problem. EvoCOP 2010: 264-275 - [c2]Thé Van Luong
, Nouredine Melab, El-Ghazali Talbi:
GPU-based island model for evolutionary algorithms. GECCO 2010: 1089-1096 - [c1]Thé Van Luong
, Nouredine Melab, El-Ghazali Talbi:
Large neighborhood local search optimization on graphics processing units. IPDPS Workshops 2010: 1-8
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-04-24 23:02 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint