Variable neighbourhood search for the k-labelled spanning forest problem.
Sergio ConsoliJosé Andrés Moreno-PérezPublished in: Electron. Notes Discret. Math. (2015)
Keyphrases
- variable neighbourhood search
- mathematical programming
- tabu search
- metaheuristic
- combinatorial optimization
- feasible solution
- heuristic methods
- hybrid metaheuristic
- constraint propagation
- solution quality
- constructive heuristic
- candidate list
- benchmark instances
- optimization problems
- simulated annealing
- search strategies
- search methods
- scheduling problem
- genetic algorithm
- search algorithm
- scatter search
- linear programming
- path relinking
- search procedure
- objective function
- optimal solution
- search space
- particle swarm optimization
- memetic algorithm
- dynamic programming
- np hard
- vehicle routing problem
- variable neighborhood search
- branch and bound algorithm
- ant colony optimization
- mathematical model
- branch and bound