.png){kind=icon}
返回
Solving diameter-constrained minimum spanning tree problems by constraint programming
.png){kind=icon}
PRE
AI
DOI：10.1111/j.1475-3995.2010.00780.x.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The diameter-constrained minimum spanning tree problem consists in finding a minimum spanning tree of a given graph, subject to the constraint that the maximum number of edges between any two vertices in the tree is bounded from above by a given constant. This problem typically models network design applications where all vertices communicate with each other at a minimum cost, subject to a given quality requirement. We propose alternative formulations using constraint programming that circumvent weak lower bounds yielded by most mixed-integer programming formulations. Computational results show that the proposed formulation, combined with an appropriate search procedure, solves larger instances and is faster than other approaches in the literature.
Keyword:
Spanning trees
diameter constrained spanning trees
bounded-diameter
constraint programming
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.9
论文数:
1.8K
被引数:
3.7K
机构
查看更多机构
引用论文
Integration of proxy data and model scenarios for the mid-Holocene onset of modern ENSO variability代理数据与模型情景的整合：中全新世现代ENSO变率的起始.png)
IF0
PREAI
分享收藏Induction and elimination of bulky benzo[a]pyrene-related DNA adducts and 8-oxodGuo in mussels Mytilus galloprovincialis exposed in vivo to B[a]P-contaminated feed体内暴露于B[a]P污染的饲料中的贻贝Mytilus galloprovincialis中庞大的苯并 [a] re相关DNA加合物和8-氧代果的诱导和消除
OAAI
OAAI分享收藏 没有更多内容