A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
An inverse spanning tree problem is to make the least modification on the edge weights such that a predetermined spanning tree is a minimum spanning tree. In this paper, based on the notion of fuzzy α-minimum spanning tree, the inverse spanning tree problem with fuzzy edge weights is discussed and formulated as a fuzzy programming model with some chance constraints. It shows that when all the edge weights are assumed to be independent fuzzy variables with regular credibility distributions, thedoi:10.12720/jcm.8.9.566-571 fatcat:24wsznypv5fn7jxw7qob6gjgbe