15 citations · 42 across the 17 of their papers we have counts for
Showing cs.NEShow all
2 papers · 1 filter
cs.NE2021
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…
cs.NE2020★ 1 cited
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…