1 citations · 1 across the 5 of their papers we have counts for
4 papers · 1 filter
Runtime Performance of Evolutionary Algorithms for the Chance-constrained Makespan Scheduling Problem
Feng Shi, Daoyu Huang, Xiankun Yan +1
The Makespan Scheduling problem is an extensively studied NP-hard problem, and its simplest version looks for an allocation approach for a set of jobs with deterministic processing…
Time Complexity Analysis of Evolutionary Algorithms for 2-Hop (1,2)-Minimum Spanning Tree Problem
Feng Shi, Frank Neumann, Jianxin Wang
The Minimum Spanning Tree problem (abbr. MSTP) is a well-known combinatorial optimization problem that has been extensively studied by the researchers in the field of evolutionary…
Runtime Performances of Randomized Search Heuristics for the Dynamic Weighted Vertex Cover Problem
Feng Shi, Frank Neumann, Jianxin Wang
Randomized search heuristics such as evolutionary algorithms are frequently applied to dynamic combinatorial optimization problems. Within this paper, we present a dynamic model of…
Parameterized Analysis of Multi-objective Evolutionary Algorithms and the Weighted Vertex Cover Problem
Mojgan Pourhassan, Feng Shi, Frank Neumann
A rigorous runtime analysis of evolutionary multi-objective optimization for the classical vertex cover problem in the context of parameterized complexity analysis has been present…