کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
483346 | 1446223 | 2006 | 16 صفحه PDF | دانلود رایگان |
![عکس صفحه اول مقاله: Upper and lower bounding strategies for the generalized minimum spanning tree problem Upper and lower bounding strategies for the generalized minimum spanning tree problem](/preview/png/483346.png)
We address the generalized minimum spanning tree problem (GMST) which requires spanning at least one vertex out of every set of disjoint vertices in a graph. We show that the geometric version of this problem is NPNP-hard, and we propose two stochastic heuristics. The first one is a very fast randomized greedy search algorithm and the second one being a genetic algorithm. Also, we investigate some existing integer programming formulations and present an new one. A new Lagrangian based lower bound is proposed and implemented to assess the performance of the heuristics. Computational experiments performed on a large set of randomly generated instances with up to 1000 vertices and 10,000 edges provide evidence of the good performance of the proposed heuristics.
Journal: European Journal of Operational Research - Volume 171, Issue 2, 1 June 2006, Pages 632–647