.png){kind=icon}
返回
Carousel greedy: A generalized greedy algorithm with applications in optimization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2017.03.016.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we introduce carousel greedy, an enhanced greedy algorithm which seeks to overcome the traditional weaknesses of greedy approaches. We have applied carousel greedy to a variety of well-known problems in combinatorial optimization such as the minimum label spanning tree problem, the minimum vertex cover problem, the maximum independent set problem, and the minimum weight vertex cover problem. In all cases, the results are very promising. Since carousel greedy is very fast, it can be used to solve very large problems. In addition, it can be combined with other approaches to create a powerful, new metaheuristic. Our goal in this paper is to motivate and explain the new approach and present extensive computational results. (C) 2017 Elsevier Ltd. All rights reserved.
Keyword:
Metaheuristics Greedy algorithm
Combinatorial optimization
Minimum label spanning tree
Vertex cover
Independent set
Iterated greedy
Carousel greedy
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
Reduced white matter microstructural integrity correlates with cognitive deficits in minimal hepatic encephalopathy轻度肝性脑病中白质微结构完整性降低与认知缺陷相关.png)
Gut
GutIF0
PREAI
分享收藏A mixed integer linear formulation for the minimum label spanning tree problem最小标签生成树问题的混合整数线性公式
PREAI
分享收藏Metaheuristics in combinatorial optimization: Overview and conceptual comparison组合优化中的元启发式: 概述和概念比较
PREAI
分享收藏The Use of Ranks to Avoid the Assumption of Normality Implicit in the Analysis of Variance使用秩来避免方差分析中隐含的正态性假设
PREAI
分享收藏
查看更多内容