Duc-Cuong Dang

Orcid: 0000-0002-6660-6625

Affiliations:
  • University of Passau, Germany
  • University of Southampton, UK


According to our database1, Duc-Cuong Dang authored at least 33 papers between 2010 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Empirical Evaluation of Evolutionary Algorithms with Power-Law Ranking Selection.
Proceedings of the Intelligent Information Processing XII, 2024

2023
Budget allocation of food procurement for natural disaster response.
Eur. J. Oper. Res., December, 2023

Analysing the Robustness of NSGA-II under Noise.
Proceedings of the Genetic and Evolutionary Computation Conference, 2023

A Proof That Using Crossover Can Guarantee Exponential Speed-Ups in Evolutionary Multi-Objective Optimisation.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
Evolutionary Algorithms for Cardinality-Constrained Ising Models.
Proceedings of the Parallel Problem Solving from Nature - PPSN XVII, 2022

Fast non-elitist evolutionary algorithms with power-law ranking selection.
Proceedings of the GECCO '22: Genetic and Evolutionary Computation Conference, Boston, Massachusetts, USA, July 9, 2022

2021
Non-elitist evolutionary algorithms excel in fitness landscapes with sparse deceptive regions and dense valleys.
Proceedings of the GECCO '21: Genetic and Evolutionary Computation Conference, 2021

Escaping Local Optima with Non-Elitist Evolutionary Algorithms.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2019
Runtime Analysis of Fitness-Proportionate Selection on Linear Functions.
CoRR, 2019

Level-Based Analysis of the Univariate Marginal Distribution Algorithm.
Algorithmica, 2019

2018
Escaping Local Optima Using Crossover With Emergent Diversity.
IEEE Trans. Evol. Comput., 2018

Level-Based Analysis of Genetic Algorithms and Other Search Processes.
IEEE Trans. Evol. Comput., 2018

2017
Populations Can Be Essential in Tracking Dynamic Optima.
Algorithmica, 2017

2016
Heuristic solutions for the vehicle routing problem with time windows and synchronized visits.
Optim. Lett., 2016

Escaping Local Optima using Crossover with Emergent or Reinforced Diversity.
CoRR, 2016

Solving the team orienteering problem with cutting planes.
Comput. Oper. Res., 2016

Runtime Analysis of Non-elitist Populations: From Classical Optimisation to Partial Information.
Algorithmica, 2016

Self-adaptation of Mutation Rates in Non-elitist Populations.
Proceedings of the Parallel Problem Solving from Nature - PPSN XIV, 2016

Emergence of Diversity and Its Benefits for Crossover in Genetic Algorithms.
Proceedings of the Parallel Problem Solving from Nature - PPSN XIV, 2016

Escaping Local Optima with Diversity Mechanisms and Crossover.
Proceedings of the 2016 on Genetic and Evolutionary Computation Conference, Denver, CO, USA, July 20, 2016

2015
Level-Based Analysis of Genetic Algorithms for Combinatorial Optimization.
CoRR, 2015

Simplified Runtime Analysis of Estimation of Distribution Algorithms.
Proceedings of the Genetic and Evolutionary Computation Conference, 2015

Populations can be Essential in Dynamic Optimisation.
Proceedings of the Genetic and Evolutionary Computation Conference, 2015

Efficient Optimisation of Noisy Fitness Functions with Population-based Evolutionary Algorithms.
Proceedings of the 2015 ACM Conference on Foundations of Genetic Algorithms XIII, Aberystwyth, United Kingdom, January 17, 2015

2014
Refined upper bounds on the expected runtime of non-elitist populations from fitness-levels.
Proceedings of the Genetic and Evolutionary Computation Conference, 2014

Evolution under partial information.
Proceedings of the Genetic and Evolutionary Computation Conference, 2014

2013
An effective PSO-inspired algorithm for the team orienteering problem.
Eur. J. Oper. Res., 2013

A Simulated Annealing Algorithm for the Vehicle Routing Problem with Time Windows and Synchronization Constraints.
Proceedings of the Learning and Intelligent Optimization - 7th International Conference, 2013

A Branch-and-Cut Algorithm for Solving the Team Orienteering Problem.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2013

2012
Subgraph extraction and metaheuristics for the maximum clique problem.
J. Heuristics, 2012

2011
A PSO-Based Memetic Algorithm for the Team Orienteering Problem.
Proceedings of the Applications of Evolutionary Computation, 2011

2010
A memetic algorithm for the team orienteering problem.
4OR, 2010

Subgraph Extraction and Memetic Algorithm for the Maximum Clique Problem.
Proceedings of the ICEC 2010 - Proceedings of the International Conference on Evolutionary Computation, [part of the International Joint Conference on Computational Intelligence IJCCI 2010], Valencia, Spain, October 24, 2010


  Loading...