3 citations · 4 across the 2 of their papers we have counts for
2 papers
cs.NE2022★ 1 cited
Robust Subset Selection by Greedy and Evolutionary Pareto Optimization
Chao Bian, Yawen Zhou, Chao Qian
Subset selection, which aims to select a subset from a ground set to maximize some objective function, arises in various applications such as influence maximization and sensor plac…
cs.NE2022★ 3 cited
Running Time Analysis of the Non-dominated Sorting Genetic Algorithm II (NSGA-II) using Binary or Stochastic Tournament Selection
Chao Bian, Chao Qian
Evolutionary algorithms (EAs) have been widely used to solve multi-objective optimization problems, and have become the most popular tool. However, the theoretical foundation of mu…