Uncertain Quadratic Minimum Spanning Tree Problem

Jian Zhou, Xing He, Ke Wang
2014 Journal of Communications  
The quadratic minimum spanning tree problem is to find a spanning tree on a graph that minimizes a quadratic objective function of the edge weights. In this paper, the quadratic minimum spanning tree problem is concerned on the graph with edge weights being assumed as uncertain variables. The notion of the uncertain quadratic -minimum spanning tree is introduced by using the uncertain chance constraints. It is shown that the problem of finding an uncertain quadraticminimum spanning tree can be
more » ... andled in the framework of the deterministic quadratic minimum spanning tree problem requiring no particular solving methods. Index Terms-Quadratic minimum spanning tree, uncertainty theory, network optimization, chance-constrained programming Jian Zhou is an associate professor at the School of Management, Shanghai University, Shanghai, China. She received the B.S. degree in applied mathematics, the M.S. and Ph.D. degrees in computational mathematics from Tsinghua University, Beijing, China in 1998 and 2003, respectively. Her research interests include network optimization, uncertainty theory, fuzzy clustering, and supply chain finance. She has published more than 40 papers in national and international conferences and journals. For the other information about her, please visit her personal webpage at
doi:10.12720/jcm.9.5.385-390 fatcat:rnvir43d4ra7fh7af7htkrcrbq