.png){kind=icon}
返回
A GRASP-based approach to the generalized minimum spanning tree problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.eswa.2011.09.043.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Given a multipartite graph G the generalized minimum spanning tree problem is to find a tree of minimal cost that includes a vertex from each part. This paper proposes several versions of the GRASP metaheuristic for the problem. The GRASP approach is based on constructive heuristics as well as on additional improvement mechanisms such as path-relinking and iterated local search. Several computational experiments are performed over a set of existing instances. A cut generation algorithm is proposed that is able to find lower bounds, based on a formulation for Steiner's problem in directed graphs. The computational results show that the best versions of the GRASP approach use improvement mechanisms. The solutions found are better than most of the known solutions in the literature and require significantly less computer time. Furthermore, a set of rules is defined for pre-processing the instances, based on the Bottleneck distance concept. Using those rules, it was possible to reduce the size of the instances to an average of 14% of the number of edges in relation to the original graphs. (C) 2011 Elsevier Ltd. All rights reserved.
Keyword:
GRASP
Generalized minimum spanning tree
Constructive heuristics
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.5
论文数:
3.0W
被引数:
10.2W
机构
引用论文
Stable Insulin Preparation for Implanted Insulin Pumps: Laboratory and Animal Trials.png)
Diabetes
DiabetesIF0
PREAI
分享收藏Ophioviruses CPsV and MiLBVV movement protein is encoded in RNA 2 and interacts with the coat proteinVirology
OAAI
VirologyIF0
OAAI分享收藏Injury-Dependent and Disability-Specific Lumbar Spinal Gene Regulation following Sciatic Nerve Injury in the Rat大鼠坐骨神经损伤后损伤依赖性和残疾特异性腰椎基因调控PLOS ONEOAAI
PLOS ONEIF0
OAAI分享收藏Upper and lower bounding strategies for the generalized minimum spanning tree problem广义最小生成树问题的上下界策略
PREAI
分享收藏
查看更多内容