.png){kind=icon}
返回
Fuzzy random bottleneck spanning tree problems using possibility and necessity measures
.png){kind=icon}
PRE
AI
DOI：10.1016/S0377-2217(02)00523-4.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper investigates bottleneck spanning tree problems where each cost attached to the edge in a given graph is represented with a fuzzy random variable. The problem is to find the optimal spanning tree that maximizes a degree of possibility or necessity under some chance constraint. After transforming the problem into the deterministic equivalent one, we introduce the subproblem which has close relations to the deterministic problem. Utilizing fully the relations, we give a polynomial order algorithm for solving the deterministic problem. (C) 2002 Elsevier B.V. All rights reserved.
Keyword:
fuzzy random variable
spanning tree problem
chance constrained programming
possibility measure
necessity measure
polynomial order algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
Relative susceptibility of Spodoptera litura pupae to selected entomopathogenic fungi.png)
BioControl
BioControlIF0
PREAI
分享收藏Viscoelastic properties of transformed cells: Role in tumor cell progression and metastasis formationBiorheology
BiorheologyIF0
PREAI
分享收藏
查看更多内容