Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Do, Anh Viet"'
Chance constraints are frequently used to limit the probability of constraint violations in real-world optimization problems where the constraints involve stochastic components. We study chance-constrained submodular optimization problems, which capt
Externí odkaz:
http://arxiv.org/abs/2309.14359
Finding diverse solutions to optimization problems has been of practical interest for several decades, and recently enjoyed increasing attention in research. While submodular optimization has been rigorously studied in many fields, its diverse soluti
Externí odkaz:
http://arxiv.org/abs/2307.07567
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 prove some important properties of the convex hull of the non-dominated
Externí odkaz:
http://arxiv.org/abs/2306.03409
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 maximize the quality of solutions for different regions of the so-called b
Externí odkaz:
http://arxiv.org/abs/2207.14037
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. This study aims to investigate the effectiveness of applying niching to
Externí odkaz:
http://arxiv.org/abs/2201.10316
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 research with an investigation on evolutionary diversity optimization f
Externí odkaz:
http://arxiv.org/abs/2102.11469
Autor:
Do, Anh Viet, Neumann, Frank
In this study, we consider the subset selection problems with submodular or monotone discrete objective functions under partition matroid constraints where the thresholds are dynamic. We focus on POMC, a simple Pareto optimization approach that has b
Externí odkaz:
http://arxiv.org/abs/2012.08738
Autor:
Do, Anh Viet, Neumann, Frank
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 achieve good approximation for submodular functions efficiently. While t
Externí odkaz:
http://arxiv.org/abs/2006.12773
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 area of research by examining evolutionary diversity optimisation approa
Externí odkaz:
http://arxiv.org/abs/2004.09188