A Tabu Search Heuristic Based on k-Diamonds for the Weighted Feedback Vertex Set Problem.
Francesco CarrabsRaffaele CerulliMonica GentiliGennaro ParlatoPublished in: INOC (2011)
Keyphrases
- tabu search
- vertex set
- weighted graph
- metaheuristic
- simulated annealing
- feasible solution
- memetic algorithm
- scheduling problem
- search algorithm
- test problems
- genetic algorithm
- path relinking
- search procedure
- heuristic methods
- benchmark instances
- hybrid algorithm
- vehicle routing problem
- iterated local search
- multi start
- tabu search algorithm
- job shop scheduling problem
- scatter search
- initial solution
- quadratic assignment problem
- tabu list
- candidate list
- variable neighborhood search
- neural network
- max sat
- social networks
- undirected graph
- optimal solution
- multi objective
- worst case
- combinatorial optimization