A population-based iterated greedy algorithm for the minimum weight vertex cover problem.
Salim BouamamaChristian BlumAbdellah BoukerramPublished in: Appl. Soft Comput. (2012)
Keyphrases
- minimum weight
- greedy algorithm
- vertex cover
- planar graphs
- greedy heuristic
- randomized algorithm
- approximation algorithms
- worst case
- greedy algorithms
- knapsack problem
- bipartite graph
- particle swarm optimization
- objective function
- minimum spanning tree
- simulated annealing
- spanning tree
- dynamic programming
- precedence constraints
- combinatorial optimization
- structural features
- weighted graph