.png){kind=icon}
返回
A CONSTRAINED STEINER TREE PROBLEM
.png){kind=icon}
PRE
AI
DOI：10.1016/0377-2217(93)E0245-S.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The Steiner tree problem on a graph involves finding a minimum cost tree which connects a designated subset of the nodes in the graph. Variants of the basic Steiner tree model can arise in the design of telecommunication networks where customers must be connected to a switching center. In this paper, we consider the constrained Steiner tree problem which is the Steiner tree problem on a graph with one additional side constraint that imposes a budget on the total amount of a resource (e.g., employee maintenance time) required by the arcs in the solution. We discuss various problem formulations, decomposition based solution approaches, and computational experience with the proposed methods.
Keyword:
INTEGER PROGRAMMING
RELAXATION
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
.png){kind=icon}
A weighted cooperative spectrum sensing framework for infrastructure-based cognitive radio networks
PREAI
分享收藏
查看更多内容