Abstract
A degree-constrained minimum spanning tree (DCMST) problem involving any network aims to find the least weighted spanning tree of that network, subject to constraints on node degrees. In this paper, we first define a DCMST problem in an uncertain random network, where some weights are uncertain variables and others are random variables. We also introduce the concept of an ideal chance distribution for DCMST problem. In order to seek out the degree-constrained spanning tree (DCST) closest to the ideal chance distribution, an uncertain random programming model is formulated. An algorithm is presented to solve the DCMST problem. The effectiveness of our method and algorithm are exhibited by solving a numerical example.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Journal of Ambient Intelligence and Humanized Computing
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
