Journal
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Volume 152, Issue 1, Pages 88-95Publisher
ELSEVIER SCIENCE BV
DOI: 10.1016/S0377-2217(02)00523-4
Keywords
fuzzy random variable; spanning tree problem; chance constrained programming; possibility measure; necessity measure; polynomial order algorithm
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available