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. 1504.06363
  4. Cited By
On the Runtime of Randomized Local Search and Simple Evolutionary
  Algorithms for Dynamic Makespan Scheduling

On the Runtime of Randomized Local Search and Simple Evolutionary Algorithms for Dynamic Makespan Scheduling

23 April 2015
Frank Neumann
Carsten Witt
ArXivPDFHTML

Papers citing "On the Runtime of Randomized Local Search and Simple Evolutionary Algorithms for Dynamic Makespan Scheduling"

3 / 3 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
118
0
0
22 Dec 2022
Multiplicative Drift Analysis
Multiplicative Drift Analysis
Benjamin Doerr
Daniel Johannsen
Carola Doerr
54
279
0
04 Jan 2011
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
Yang Yu
Xin Yao
Zhi Zhou
87
81
0
17 Nov 2010
1