.png){kind=icon}
返回
Spanning trees with variable degree bounds
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2014.05.034.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we introduce and study a generalization of the degree constrained minimum spanning tree problem where we may install one of several available transmission systems (each with a different cost value) in each edge. The degree of the endnodes of each edge depends on the system installed on the edge. We also discuss a particular case that arises in the design of wireless mesh networks (in this variant the degree of the endnodes of each edge depend on the transmission system installed on it as well as on the length of the edge). We propose three classes of models using different sets of variables and compare from a theoretical perspective as well as from a computational point of view, the models and the corresponding linear programming relaxations. The computational results show that some of the proposed models are able to solve to optimality instances with 100 nodes and different scenarios. (C) 2014 Elsevier B.V. All rights reserved.
Keyword:
OR in telecommunications networks
Spanning tree
Degree constraints
Wireless mesh networks
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
分享收藏分享收藏Dual RNA-seq of Xanthomonas oryzae pv. oryzicola infecting rice reveals novel insights into bacterial-plant interaction.png)
PLOS ONE
OAAI
PLOS ONEIF0
OAAI分享收藏分享收藏Recent recommendations of the Consultative Committee for Length (CCL) regarding strategies for evaluating key comparison dataMetrologia
MetrologiaIF0
PREAI
分享收藏
查看更多内容