Perturbation based local search for the degree-constrained minimum spanning-tree problem
Perturbation based local search for the degree-constrained minimum spanning-tree problem
No Thumbnail Available
Date
2007-12-01
Authors
Singh, Alok
Gupta, Ashok Kumar
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
Given a connected, weighted, and undirected graph, the degreeconstrained minimum spanning-tree problem seeks on this graph a spanningtree of minimum weight subject to a limit on the number of edges that can be incident to each node. In this paper we have proposed a perturbation based local search for this problem. Tests on standard benchmark instances for the problem demonstrate the effectiveness of our approach. Copyright © 2007 IICAI.
Description
Keywords
Constrained optimization,
Degree-constrained minimum spanningtree,
Variable-domain-descent search,
Variable-neighborhood-descent search
Citation
Proceedings of the 3rd Indian International Conference on Artificial Intelligence, IICAI 2007