A hybridized tabu search approach for the minimum weight vertex cover problem.
Stefan VoßAndreas FinkPublished in: J. Heuristics (2012)
Keyphrases
- vertex cover
- tabu search
- minimum weight
- planar graphs
- memetic algorithm
- job shop scheduling problem
- search procedure
- scheduling problem
- bipartite graph
- simulated annealing
- metaheuristic
- precedence constraints
- spanning tree
- approximation algorithms
- feasible solution
- hybrid algorithm
- greedy heuristic
- weighted graph
- vehicle routing problem
- search algorithm
- minimum spanning tree
- genetic algorithm
- partial order
- particle swarm optimization
- linear programming
- tree patterns
- learning algorithm
- evolutionary algorithm
- randomized algorithm
- special case
- np hard
- shortest path
- single machine