期刊
DISCRETE APPLIED MATHEMATICS
卷 118, 期 1-2, 页码 43-54出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/S0166-218X(01)00255-4
关键词
combinatorial optimization; degree-constrained minimum spanning tree; local search; metaheuristics; variable neighborhood search
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..
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据