Degree-Constrained Minimum Spanning Tree Problem of Uncertain Random Network

摘要：

　　The degree-constrained minimum spanning tree (DCMST) problem is to find the least weight spanning tree of a given network, subject to constraints on node degrees.This paper firstly investigates the DCMST problem of uncertain random network in which some weights are uncerlain variables and others are random variables.A concept of ideal chance distribution of DCMST problem is proposed here.For seeking the degree-constrained spanning tree which is closest to the ideal chance distribution, an uncertain random programming model is formulated here to find the DCMST.Finally, a numerical example is provided to illustrate its effectiveness.

关键词： minimum spanning tree uncertain random network chance theory

作者: Lifen Jia Xin Gao

作者单位: School of Mathematical Sciences and Physics,North China Electric Power University,Beijing 102206,China

会议类型: 国内会议

会议名称: 第十四届中国不确定系统年会暨第十八届中国青年信息与管理学者大会

会议地点: 陕西渭南

会议语种:英文

页码: 55-63

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