activity
20142023
most citedRuntime Performances of Randomized Search Heuristics for the Dynamic Weighted Vertex Cover Problem

1 citations · 1 across the 5 of their papers we have counts for

collaborators
Showing 2022Show all

1 paper · 1 filter

cs.NE2022

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…