.png){kind=icon}
返回
A mixed integer linear formulation for the minimum label spanning tree problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2009.02.003.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper we deal with the minimum label spanning tree problem. This is a relevant problem with applications such as telecommunication networks or electric networks, where each edge is assigned with a label (such as a color) and it is intended to determine a spanning tree with the minimum number of different labels. We introduce some mixed integer formulations for this problem and prove that one of their relaxations always gives the optimal value. Finally we present and discuss the results of computational experiments. (C) 2009 Elsevier Ltd. All rights reserved.
Keyword:
Spanning tree
Label
Color
Mixed integer formulation
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
.png){kind=icon}
没有更多内容
没有更多内容