activity
20092025
most citedOn the approximation ability of evolutionary optimization with application to minimum set cover

79 citations · 115 across the 16 of their papers we have counts for

collaborators
Showing cs.NEShow all

5 papers · 1 filter

cs.NE2021★ 2 cited

Result Diversification by Multi-objective Evolutionary Algorithms with Theoretical Guarantees

Chao Qian, Dan-Xuan Liu, Zhi-Hua Zhou

Given a ground set of items, the result diversification problem aims to select a subset with high "quality" and "diversity" while satisfying some constraints. It arises in various…

cs.NE2017

Maximizing Submodular or Monotone Approximately Submodular Functions by Multi-objective Evolutionary Algorithms

Chao Qian, Yang Yu, Ke Tang +2

Evolutionary algorithms (EAs) are a kind of nature-inspired general-purpose optimization algorithm, and have shown empirically good performance in solving various real-word optimiz…

cs.NE2016

A Lower Bound Analysis of Population-based Evolutionary Algorithms for Pseudo-Boolean Functions

Chao Qian, Yang Yu, Zhi-Hua Zhou

Evolutionary algorithms (EAs) are population-based general-purpose optimization algorithms, and have been successfully applied in various real-world optimization tasks. However, pr…

cs.NE2011★ 3 cited

Towards Analyzing Crossover Operators in Evolutionary Search via General Markov Chain Switching Theorem

Yang Yu, Chao Qian, Zhi-Hua Zhou

Evolutionary algorithms (EAs), simulating the evolution process of natural species, are used to solve optimization problems. Crossover (also called recombination), originated from…

cs.NE2010★ 79 cited

On the approximation ability of evolutionary optimization with application to minimum set cover

Yang Yu, Xin Yao, Zhi-Hua Zhou

Evolutionary algorithms (EAs) are heuristic algorithms inspired by natural evolution. They are often used to obtain satisficing solutions in practice. In this paper, we investigate…