default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDuc-Cuong Dang
Person information
- affiliation: University of Passau, Germany
- affiliation: University of Southampton, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j12]Duc-Cuong Dang
, Andre Opris, Dirk Sudholt:
Crossover can guarantee exponential speed-ups in evolutionary multi-objective optimisation. Artif. Intell. 330: 104098 (2024)- [c27]Duc-Cuong Dang, Per Kristian Lehre:
The SLO Hierarchy of pseudo-Boolean Functions and Runtime of Evolutionary Algorithms. GECCO 2024 - [c26]Duc-Cuong Dang, Andre Opris, Dirk Sudholt:
Illustrating the Efficiency of Popular Evolutionary Multi-Objective Algorithms Using Runtime Analysis. GECCO 2024 - [c25]Andre Opris, Duc-Cuong Dang, Frank Neumann, Dirk Sudholt:
Runtime Analyses of NSGA-III on Many-Objective Problems. GECCO 2024 - [c24]Andre Opris, Duc-Cuong Dang, Dirk Sudholt:
Hot of the Press: Crossover Can Guarantee Exponential Speed-Ups in Evolutionary Multi-Objective Optimisation. GECCO Companion 2024: 51-52 - [c23]Duc-Cuong Dang, Anton V. Eremeev, Xiaoyu Qin:
Empirical Evaluation of Evolutionary Algorithms with Power-Law Ranking Selection. Intelligent Information Processing (1) 2024: 217-232 - [c22]Duc-Cuong Dang, Andre Opris, Dirk Sudholt:
On the Equivalence Between Stochastic Tournament and Power-Law Ranking Selection and How to Implement Them Efficiently. PPSN (3) 2024: 230-245 - [c21]Duc-Cuong Dang, Andre Opris, Dirk Sudholt:
Level-Based Theorems for Runtime Analysis of Multi-objective Evolutionary Algorithms. PPSN (3) 2024: 246-263 - [i12]Andre Opris, Duc-Cuong Dang, Frank Neumann, Dirk Sudholt:
Runtime Analyses of NSGA-III on Many-Objective Problems. CoRR abs/2404.11433 (2024) - [i11]Duc-Cuong Dang, Andre Opris, Dirk Sudholt:
Illustrating the Efficiency of Popular Evolutionary Multi-Objective Algorithms Using Runtime Analysis. CoRR abs/2405.13572 (2024) - 2023
- [j11]Duc-Cuong Dang, Christine S. M. Currie, Bhakti Stephan Onggo, Diah Chaerani, Audi Luqmanul Hakim Achmad:
Budget allocation of food procurement for natural disaster response. Eur. J. Oper. Res. 311(2): 754-768 (2023) - [c20]Duc-Cuong Dang, Andre Opris, Bahare Salehi, Dirk Sudholt:
A Proof That Using Crossover Can Guarantee Exponential Speed-Ups in Evolutionary Multi-Objective Optimisation. AAAI 2023: 12390-12398 - [c19]Duc-Cuong Dang, Andre Opris, Bahare Salehi, Dirk Sudholt:
Analysing the Robustness of NSGA-II under Noise. GECCO 2023: 642-651 - [i10]Duc-Cuong Dang, Andre Opris, Bahare Salehi, Dirk Sudholt:
A Proof that Using Crossover Can Guarantee Exponential Speed-Ups in Evolutionary Multi-Objective Optimisation. CoRR abs/2301.13687 (2023) - [i9]Duc-Cuong Dang, Andre Opris, Bahare Salehi, Dirk Sudholt:
Analysing the Robustness of NSGA-II under Noise. CoRR abs/2306.04525 (2023) - 2022
- [c18]Duc-Cuong Dang, Anton V. Eremeev, Per Kristian Lehre, Xiaoyu Qin:
Fast non-elitist evolutionary algorithms with power-law ranking selection. GECCO 2022: 1372-1380 - [c17]Vijay Dhanjibhai Bhuva, Duc-Cuong Dang, Liam Huber, Dirk Sudholt:
Evolutionary Algorithms for Cardinality-Constrained Ising Models. PPSN (2) 2022: 456-469 - 2021
- [c16]Duc-Cuong Dang, Anton V. Eremeev, Per Kristian Lehre:
Escaping Local Optima with Non-Elitist Evolutionary Algorithms. AAAI 2021: 12275-12283 - [c15]Duc-Cuong Dang, Anton V. Eremeev, Per Kristian Lehre:
Non-elitist evolutionary algorithms excel in fitness landscapes with sparse deceptive regions and dense valleys. GECCO 2021: 1133-1141
2010 – 2019
- 2019
- [j10]Duc-Cuong Dang, Per Kristian Lehre, Phan Trung Hai Nguyen:
Level-Based Analysis of the Univariate Marginal Distribution Algorithm. Algorithmica 81(2): 668-702 (2019) - [i8]Duc-Cuong Dang, Anton V. Eremeev, Per Kristian Lehre:
Runtime Analysis of Fitness-Proportionate Selection on Linear Functions. CoRR abs/1908.08686 (2019) - 2018
- [j9]Duc-Cuong Dang, Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Per Kristian Lehre, Pietro S. Oliveto, Dirk Sudholt, Andrew M. Sutton:
Escaping Local Optima Using Crossover With Emergent Diversity. IEEE Trans. Evol. Comput. 22(3): 484-497 (2018) - [j8]Dogan Corus, Duc-Cuong Dang, Anton V. Eremeev, Per Kristian Lehre:
Level-Based Analysis of Genetic Algorithms and Other Search Processes. IEEE Trans. Evol. Comput. 22(5): 707-719 (2018) - [i7]Duc-Cuong Dang, Per Kristian Lehre, Phan Trung Hai Nguyen:
Level-Based Analysis of the Univariate Marginal Distribution Algorithm. CoRR abs/1807.10038 (2018) - 2017
- [j7]Duc-Cuong Dang, Thomas Jansen, Per Kristian Lehre:
Populations Can Be Essential in Tracking Dynamic Optima. Algorithmica 78(2): 660-680 (2017) - 2016
- [j6]Duc-Cuong Dang, Per Kristian Lehre:
Runtime Analysis of Non-elitist Populations: From Classical Optimisation to Partial Information. Algorithmica 75(3): 428-461 (2016) - [j5]Racha El-Hajj, Duc-Cuong Dang, Aziz Moukrim:
Solving the team orienteering problem with cutting planes. Comput. Oper. Res. 74: 21-30 (2016) - [j4]Sohaib Afifi, Duc-Cuong Dang, Aziz Moukrim:
Heuristic solutions for the vehicle routing problem with time windows and synchronized visits. Optim. Lett. 10(3): 511-525 (2016) - [c14]Duc-Cuong Dang, Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Per Kristian Lehre, Pietro S. Oliveto, Dirk Sudholt, Andrew M. Sutton:
Escaping Local Optima with Diversity Mechanisms and Crossover. GECCO 2016: 645-652 - [c13]Duc-Cuong Dang, Per Kristian Lehre:
Self-adaptation of Mutation Rates in Non-elitist Populations. PPSN 2016: 803-813 - [c12]Duc-Cuong Dang, Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Per Kristian Lehre, Pietro S. Oliveto, Dirk Sudholt, Andrew M. Sutton:
Emergence of Diversity and Its Benefits for Crossover in Genetic Algorithms. PPSN 2016: 890-900 - [i6]Racha El-Hajj, Duc-Cuong Dang, Aziz Moukrim:
Solving the Team Orienteering Problem with Cutting Planes. CoRR abs/1604.02934 (2016) - [i5]Duc-Cuong Dang, Per Kristian Lehre:
Self-adaptation of Mutation Rates in Non-elitist Populations. CoRR abs/1606.05551 (2016) - [i4]Duc-Cuong Dang, Thomas Jansen, Per Kristian Lehre:
Populations can be essential in tracking dynamic optima. CoRR abs/1607.03317 (2016) - [i3]Duc-Cuong Dang, Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Per Kristian Lehre, Pietro S. Oliveto, Dirk Sudholt, Andrew M. Sutton:
Escaping Local Optima using Crossover with Emergent or Reinforced Diversity. CoRR abs/1608.03123 (2016) - 2015
- [c11]Duc-Cuong Dang, Per Kristian Lehre:
Efficient Optimisation of Noisy Fitness Functions with Population-based Evolutionary Algorithms. FOGA 2015: 62-68 - [c10]Duc-Cuong Dang, Per Kristian Lehre:
Simplified Runtime Analysis of Estimation of Distribution Algorithms. GECCO 2015: 513-518 - [c9]Duc-Cuong Dang, Thomas Jansen, Per Kristian Lehre:
Populations can be Essential in Dynamic Optimisation. GECCO 2015: 1407-1414 - [i2]Duc-Cuong Dang, Anton V. Eremeev, Per Kristian Lehre:
Level-Based Analysis of Genetic Algorithms for Combinatorial Optimization. CoRR abs/1512.02047 (2015) - 2014
- [c8]Duc-Cuong Dang, Per Kristian Lehre:
Evolution under partial information. GECCO 2014: 1359-1366 - [c7]Duc-Cuong Dang, Per Kristian Lehre:
Refined upper bounds on the expected runtime of non-elitist populations from fitness-levels. GECCO 2014: 1367-1374 - [c6]Dogan Corus, Duc-Cuong Dang, Anton V. Eremeev, Per Kristian Lehre:
Level-Based Analysis of Genetic Algorithms and Other Search Processes. PPSN 2014: 912-921 - [i1]Dogan Corus, Duc-Cuong Dang, Anton V. Eremeev, Per Kristian Lehre:
Level-based Analysis of Genetic Algorithms and other Search Processes. CoRR abs/1407.7663 (2014) - 2013
- [j3]Duc-Cuong Dang, Rym Nesrine Guibadj, Aziz Moukrim:
An effective PSO-inspired algorithm for the team orienteering problem. Eur. J. Oper. Res. 229(2): 332-344 (2013) - [c5]Duc-Cuong Dang, Racha El-Hajj, Aziz Moukrim:
A Branch-and-Cut Algorithm for Solving the Team Orienteering Problem. CPAIOR 2013: 332-339 - [c4]Sohaib Afifi, Duc-Cuong Dang, Aziz Moukrim:
A Simulated Annealing Algorithm for the Vehicle Routing Problem with Time Windows and Synchronization Constraints. LION 2013: 259-265 - 2012
- [j2]Duc-Cuong Dang, Aziz Moukrim:
Subgraph extraction and metaheuristics for the maximum clique problem. J. Heuristics 18(5): 767-794 (2012) - 2011
- [c3]Duc-Cuong Dang, Rym Nesrine Guibadj, Aziz Moukrim:
A PSO-Based Memetic Algorithm for the Team Orienteering Problem. EvoApplications (2) 2011: 471-480 - 2010
- [j1]Hermann Bouly, Duc-Cuong Dang, Aziz Moukrim:
A memetic algorithm for the team orienteering problem. 4OR 8(1): 49-70 (2010) - [c2]Duc-Cuong Dang, Aziz Moukrim:
Subgraph Extraction and Memetic Algorithm for the Maximum Clique Problem. IJCCI (ICEC) 2010: 77-84
2000 – 2009
- 2008
- [c1]Hermann Bouly, Duc-Cuong Dang, Aziz Moukrim:
A Memetic Algorithm for the Team Orienteering Problem. EvoWorkshops 2008: 649-658
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-19 23:46 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:
