95 citations · 308 across the 24 of their papers we have counts for
Showing 2014Show all
3 papers · 1 filter
cs.NE2014★ 35 cited
Performance Analysis on Evolutionary Algorithms for the Minimum Label Spanning Tree Problem
Xinsheng Lai, Yuren Zhou, Jun He +1
Some experimental investigations have shown that evolutionary algorithms (EAs) are efficient for the minimum label spanning tree (MLST) problem. However, we know little about that…
cs.NE2014★ 7 cited
A Theoretical Assessment of Solution Quality in Evolutionary Algorithms for the Knapsack Problem
Jun He, Boris Mitavskiy, Yuren Zhou
Evolutionary algorithms are well suited for solving the knapsack problem. Some empirical studies claim that evolutionary algorithms can produce good solutions to the 0-1 knapsack p…
cs.NE2014★ 2 cited
A Novel Genetic Algorithm using Helper Objectives for the 0-1 Knapsack Problem
Jun He, Feidun He, Hongbin Dong
The 0-1 knapsack problem is a well-known combinatorial optimisation problem. Approximation algorithms have been designed for solving it and they return provably good solutions with…