logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

Fuzzy random bottleneck spanning tree problems using possibility and necessity measures

delete2004-01-01
delete40
PRE
AI
H
Hideki Katagiri
H
Hiroaki Ishii
DOI：10.1016/S0377-2217(02)00523-4delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

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.
Keywords:
fuzzy random variable
spanning tree problem
chance constrained programming
possibility measure
necessity measure
polynomial order algorithm
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

European Journal of Operational Research cover
European Journal of Operational Research
IF:
6
Papers:
2.2W
Citations:
6.4W

Organization

No organization information available