ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1011.4028
  4. Cited By
On the approximation ability of evolutionary optimization with
  application to minimum set cover

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

17 November 2010
Yang Yu
Xin Yao
Zhi Zhou
ArXivPDFHTML

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

2 / 2 papers shown
Title
Runtime Performance of Evolutionary Algorithms for the Chance-constrained Makespan Scheduling Problem
Runtime Performance of Evolutionary Algorithms for the Chance-constrained Makespan Scheduling Problem
Feng Shi
Xiankun Yan
Frank Neumann
Frank Neumann
112
0
0
22 Dec 2022
Evolutionary Algorithms and Dynamic Programming
Evolutionary Algorithms and Dynamic Programming
Benjamin Doerr
A. Eremeev
Frank Neumann
M. Theile
C. Thyssen
48
35
0
17 Jan 2013
1