Journal
DISCRETE APPLIED MATHEMATICS
Volume 118, Issue 1-2, Pages 43-54Publisher
ELSEVIER SCIENCE BV
DOI: 10.1016/S0166-218X(01)00255-4
Keywords
combinatorial optimization; degree-constrained minimum spanning tree; local search; metaheuristics; variable neighborhood search
Categories
Ask authors/readers for more resources
Given an undirected graph with weights associated with its edges, the degree-constrained minimum spanning tree problem consists in finding a minimum spanning tree of the given graph, subject to constraints on node degrees. We propose a variable neighborhood search heuristic for the degree-constrained minimum spanning tree problem, based on a dynamic neighborhood model and using a variable neighborhood descent iterative improvement algorithm for local search, Computational experiments illustrating the effectiveness of the approach on benchmark problems are reported. (C) 2002 Published by Elsevier Science B.V..
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available