scholarly journals Two Uncertain Programming Models for Inverse Minimum Spanning Tree Problem

2013 ◽  
Vol 12 (1) ◽  
pp. 9-15 ◽  
Author(s):  
Xiang Zhang ◽  
Qina Wang ◽  
Jian Zhou
Keyword(s):  
Spanning Tree ◽  
Minimum Spanning Tree ◽  
Programming Models ◽  
Uncertain Programming ◽  
Minimum Spanning Tree Problem

FUZZY RANDOM DEGREE-CONSTRAINED MINIMUM SPANNING TREE PROBLEM

2007 ◽  
Vol 15 (supp02) ◽  
pp. 107-115
Author(s):  
WEI LIU ◽  
CHENGJING YANG
Keyword(s):  
Spanning Tree ◽  
Minimum Spanning Tree ◽  
Programming Models ◽  
Intelligent Algorithm ◽  
Hybrid Intelligent Algorithm ◽  
Random Weights ◽  
Fuzzy Random Programming ◽  
Minimum Spanning Tree Problem ◽  
The Given ◽  
Fuzzy Random

The degree-constrained minimum spanning tree problem (dc-MST) is to find a minimum spanning tree of the given graph, subject to constraints on node degrees. This paper investigates the dc-MST problem with fuzzy random weights. Three concepts are presented: expected fuzzy random dc-MST, (α,β)-dc-MST and the most chance dc-MST according to different optimization requirement. Correspondingly, by using the concepts as decision criteria, three fuzzy random programming models for dc-MST are given. Finally, a hybrid intelligent algorithm is designed to solve these models, and some numerical examples are provided to illustrate its effectiveness.

Efficient distributed algorithm to solve updating minimum spanning tree problem

1992 ◽  
Vol 23 (3) ◽  
pp. 1-12 ◽  
Author(s):  
Jungho Park ◽  
Ken'Ichi Hagihara ◽  
Nobuki Tokura ◽  
Toshimitsu Masuzawa
Keyword(s):  
Distributed Algorithm ◽  
Spanning Tree ◽  
Minimum Spanning Tree ◽  
Minimum Spanning Tree Problem
Sign in / Sign up

Export Citation Format

Share Document