27 citations · 69 across the 11 of their papers we have counts for
11 papers
Evolutionary Multi-Objective Diversity Optimization
Anh Viet Do, Mingyu Guo, Aneta Neumann +1
Creating diverse sets of high quality solutions has become an important problem in recent years. Previous works on diverse solutions problems consider solutions' objective quality…
Optimizing Chance-Constrained Submodular Problems with Variable Uncertainties
Xiankun Yan, Anh Viet Do, Feng Shi +2
Chance constraints are frequently used to limit the probability of constraint violations in real-world optimization problems where the constraints involve stochastic components. We…
Diverse Approximations for Monotone Submodular Maximization Problems with a Matroid Constraint
Anh Viet Do, Mingyu Guo, Aneta Neumann +1
Finding diverse solutions to optimization problems has been of practical interest for several decades, and recently enjoyed increasing attention in research. While submodular optim…
Rigorous Runtime Analysis of MOEA/D for Solving Multi-Objective Minimum Weight Base Problems
Anh Viet Do, Aneta Neumann, Frank Neumann +1
We study the multi-objective minimum weight base problem, an abstraction of classical NP-hard combinatorial problems such as the multi-objective minimum spanning tree problem. We p…
Improving Generative Flow Networks with Path Regularization
Anh Do, Duy Dinh, Tan Nguyen +3
Generative Flow Networks (GFlowNets) are recently proposed models for learning stochastic policies that generate compositional objects by sequences of actions with the probability…
Analysis of Quality Diversity Algorithms for the Knapsack Problem
Adel Nikfarjam, Anh Viet Do, Frank Neumann
Quality diversity (QD) algorithms have been shown to be very successful when dealing with problems in areas such as robotics, games and combinatorial optimization. They aim to maxi…
Niching-based Evolutionary Diversity Optimization for the Traveling Salesperson Problem
Anh Viet Do, Mingyu Guo, Aneta Neumann +1
In this work, we consider the problem of finding a set of tours to a traveling salesperson problem (TSP) instance maximizing diversity, while satisfying a given cost constraint. Th…
Analysis of Evolutionary Diversity Optimisation for Permutation Problems
Anh Viet Do, Mingyu Guo, Aneta Neumann +1
Generating diverse populations of high quality solutions has gained interest as a promising extension to the traditional optimization tasks. This work contributes to this line of r…
Pareto Optimization for Subset Selection with Dynamic Partition Matroid Constraints
Anh Viet Do, Frank Neumann
In this study, we consider the subset selection problems with submodular or monotone discrete objective functions under partition matroid constraints where the thresholds are dynam…
Maximizing Submodular or Monotone Functions under Partition Matroid Constraints by Multi-objective Evolutionary Algorithms
Anh Viet Do, Frank Neumann
Many important problems can be regarded as maximizing submodular functions under some constraints. A simple multi-objective evolutionary algorithm called GSEMO has been shown to ac…
Evolving Diverse Sets of Tours for the Travelling Salesperson Problem
Anh Viet Do, Jakob Bossek, Aneta Neumann +1
Evolving diverse sets of high quality solutions has gained increasing interest in the evolutionary computation literature in recent years. With this paper, we contribute to this ar…