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. 2212.11478
  4. Cited By
Runtime Performance of Evolutionary Algorithms for the Chance-constrained Makespan Scheduling Problem

Runtime Performance of Evolutionary Algorithms for the Chance-constrained Makespan Scheduling Problem

22 December 2022
Feng Shi
Xiankun Yan
Frank Neumann
Frank Neumann
ArXivPDFHTML

Papers citing "Runtime Performance of Evolutionary Algorithms for the Chance-constrained Makespan Scheduling Problem"

14 / 14 papers shown
Title
Evolutionary Algorithms for Limiting the Effect of Uncertainty for the
  Knapsack Problem with Stochastic Profits
Evolutionary Algorithms for Limiting the Effect of Uncertainty for the Knapsack Problem with Stochastic Profits
Aneta Neumann
Yue Xie
Frank Neumann
48
15
0
12 Apr 2022
Runtime Analysis of RLS and the (1+1) EA for the Chance-constrained
  Knapsack Problem with Correlated Uniform Weights
Runtime Analysis of RLS and the (1+1) EA for the Chance-constrained Knapsack Problem with Correlated Uniform Weights
Yue Xie
Aneta Neumann
Frank Neumann
Andrew M. Sutton
27
19
0
10 Feb 2021
Runtime Analysis of Evolutionary Algorithms with Biased Mutation for the
  Multi-Objective Minimum Spanning Tree Problem
Runtime Analysis of Evolutionary Algorithms with Biased Mutation for the Multi-Objective Minimum Spanning Tree Problem
Vahid Roostapour
Jakob Bossek
Frank Neumann
28
6
0
22 Apr 2020
Specific Single- and Multi-Objective Evolutionary Algorithms for the
  Chance-Constrained Knapsack Problem
Specific Single- and Multi-Objective Evolutionary Algorithms for the Chance-Constrained Knapsack Problem
Yue Xie
Aneta Neumann
Frank Neumann
56
32
0
07 Apr 2020
Evolutionary Bi-objective Optimization for the Dynamic
  Chance-Constrained Knapsack Problem Based on Tail Bound Objectives
Evolutionary Bi-objective Optimization for the Dynamic Chance-Constrained Knapsack Problem Based on Tail Bound Objectives
Hirad Assimi
Oscar Harper
Yue Xie
Aneta Neumann
Frank Neumann
25
20
0
17 Feb 2020
Runtime Performances of Randomized Search Heuristics for the Dynamic
  Weighted Vertex Cover Problem
Runtime Performances of Randomized Search Heuristics for the Dynamic Weighted Vertex Cover Problem
Feng Shi
Frank Neumann
Jian-xin Wang
29
6
0
24 Jan 2020
Optimization of Chance-Constrained Submodular Functions
Optimization of Chance-Constrained Submodular Functions
Benjamin Doerr
Carola Doerr
Aneta Neumann
Frank Neumann
Andrew M. Sutton
30
32
0
26 Nov 2019
Pareto Optimization for Subset Selection with Dynamic Cost Constraints
Pareto Optimization for Subset Selection with Dynamic Cost Constraints
Vahid Roostapour
Aneta Neumann
Frank Neumann
Tobias Friedrich
30
73
0
14 Nov 2018
Analysis of Evolutionary Algorithms in Dynamic and Stochastic
  Environments
Analysis of Evolutionary Algorithms in Dynamic and Stochastic Environments
Vahid Roostapour
M. Pourhassan
Frank Neumann
31
26
0
22 Jun 2018
Fast Genetic Algorithms
Fast Genetic Algorithms
Benjamin Doerr
H. P. Le
Régis Makhmara
Ta Duy Nguyen
35
204
0
09 Mar 2017
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
Frank Neumann
Carsten Witt
45
32
0
23 Apr 2015
Analysis of Solution Quality of a Multiobjective Optimization-based
  Evolutionary Algorithm for Knapsack Problem
Analysis of Solution Quality of a Multiobjective Optimization-based Evolutionary Algorithm for Knapsack Problem
Jun He
Yong Wang
Yuren Zhou
31
3
0
12 Feb 2015
A Theoretical Assessment of Solution Quality in Evolutionary Algorithms
  for the Knapsack Problem
A Theoretical Assessment of Solution Quality in Evolutionary Algorithms for the Knapsack Problem
Jun He
B. Mitavskiy
Yuren Zhou
48
16
0
14 Apr 2014
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