QR-kod

An Improved Memetic Algorithm for the Partial Vertex Cover Problem

As a generalized form of the classical minimum vertex cover problem (MVCP), the minimum partial vertex cover problem not only inherits the value of MVCP in both theoretical and practical research but also extends the application scenarios under the current era of big data. In order to solve such a c...

Full beskrivning

Sparad:
Huvudupphov: Yupeng Zhou, Changze Qiu, Yiyuan Wang, Mingjie Fan, Minghao Yin
Materialtyp: Artigo
Språk:Inglês
Utgiven: IEEE 2019-01-01
Serie:IEEE Access
Ämnen:
Adaptive mutation
memetic algorithm
minimum partial vertex cover
powerful backbone crossover
promotive and inhibitory factor interaction
three-layer encoding
Länkar:https://ieeexplore.ieee.org/document/8631135/
Taggar: Lägg till en tagg
Inga taggar, Lägg till första taggen!

Liknande verk