.png){kind=icon}
返回
RAMP for the capacitated minimum spanning tree problem
.png){kind=icon}
PRE
AI
DOI：10.1007/s10479-010-0800-4.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper introduces dual and primal-dual RAMP algorithms for the solution of the capacitated minimum spanning tree problem (CMST). A surrogate constraint relaxation incorporating cutting planes is proposed to explore the dual solution space. In the dual RAMP approach, primal-feasible solutions are obtained by simple tabu searches that project dual solutions onto primal feasible space. A primal-dual approach is achieved by including a scatter search procedure that further exploits the adaptive memory framework. Computational results from applying the methods to a standard set of benchmark problems disclose that the dual RAMP algorithm finds high quality solutions very efficiently and that its primal-dual enhancement is still more effective.
Keyword:
Minimum spanning tree
Heuristics
Surrogate constraints
Scatter search
Tabu search
RAMP
期刊
IF:
4.5
论文数:
8.1K
被引数:
2.1W
机构
引用论文
.png){kind=icon}
Adsorption of Cu(II), Pb(II), and Cd(II) Ions from Acidic Aqueous Solutions by Diethylenetriaminepentaacetic Acid-Modified Magnetic Graphene Oxide二乙烯三胺五乙酸改性的磁性氧化石墨烯对酸性水溶液中Cu(II)，Pb(II) 和Cd(II) 离子的吸附
PREAI
分享收藏Acceleration of Wound Healing Potential of Benzyl N'-(Indol-3-Ylmethylidene)- Hydrazinecarbodithioate Derivatives in Experimental Rats苯甲基N'-(吲哚-3-亚甲基)-肼基甲硫酯衍生物加速实验大鼠伤口愈合的潜力
OAAI
OAAI分享收藏
查看更多内容