Stochastic α-distribution Minimum Spanning Tree Problem: Model and Algorithm

摘要：

　　The minimum spanning tree problemis to find a tree that connects all the vertices in a graph with the minimum total weight.It is one of the mosttypical problems in combinatorial optimization and has many applications in communicationnetwork, statistical cluster analysis, image processing, etc.For instance, in networkrouting protocols, the minimum cost spanning tree is one of the most effectivemethods to broadcast the messages from a source node to a set of destinations.

关键词： Stochastic minimum spanning tree stochastic α-distribution MST VaR CVaR

作者: Shanshan Xu Jing Liu

作者单位: School of Management, Shanghai University, Shanghai 200444, China

会议类型: 国内会议

会议名称: 第十三届中国不确定系统年会暨第九届中国智能计算大会

会议地点: 长春

会议语种:英文

页码: 295-296

在线出版日期: 2015-07-25（万方平台首次上网日期，不代表论文的发表时间）