Variable neighborhood search for the degree-constrained minimum spanning tree problem.
Celso C. RibeiroMaurício C. de SouzaPublished in: Discret. Appl. Math. (2002)
Keyphrases
- variable neighborhood search
- spanning tree
- minimum spanning tree
- metaheuristic
- tabu search
- traveling salesman problem
- neighborhood search
- routing problem
- heuristic methods
- hybrid method
- vehicle routing problem
- single machine scheduling problem
- benchmark instances
- search procedure
- path relinking
- ant colony optimization
- optimal solution
- solution space
- combinatorial optimization
- combinatorial optimization problems
- memetic algorithm
- job shop scheduling problem
- optimization problems
- scheduling problem
- cost function
- scatter search
- search space
- computational complexity
- search algorithm