Perturbation based local search for the degree-constrained minimum spanning-tree problem

dc.contributor.author	Singh, Alok
dc.contributor.author	Gupta, Ashok Kumar
dc.date.accessioned	2022-03-27T06:06:47Z
dc.date.available	2022-03-27T06:06:47Z
dc.date.issued	2007-12-01
dc.description.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.
dc.identifier.citation	Proceedings of the 3rd Indian International Conference on Artificial Intelligence, IICAI 2007
dc.identifier.uri	https://dspace.uohyd.ac.in/handle/1/9359
dc.subject	Constrained optimization
dc.subject	Degree-constrained minimum spanningtree
dc.subject	Variable-domain-descent search
dc.subject	Variable-neighborhood-descent search
dc.title	Perturbation based local search for the degree-constrained minimum spanning-tree problem
dc.type	Conference Proceeding. Conference Paper
dspace.entity.type

Now showing 1 - 1 of 1