Abstract
In this paper we consider a stochastic version of the bottleneck spanning tree in which edge costs are independent random variables. Our problem is to find an optimal spanning tree and optimal satisficing level of the chance constraint with respect to the bottleneck (maximum cost) edge of the spanning tree. The problem is first transformed into a deterministic equivalent problem. Then a subproblem in order to solve the problem is introduced and the close relation between these problems is clarified. Finally, based on the relation, polynomial time solution procedures to solve the problem are proposed under two special functions of satisficing level which are given as examples to be solved easily.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
H. Ishii and T. Nishida, Stochastic bottleneck spanning tree problem, Networks 13 (1983) 443–449.
H. Ishii, S. Shiode and T. Nishida, Chance constrained spanning tree problem, J. Oper. Res. Soc. Japan 24 (1981) 147–157.
J.B. Kruskal Jr., On the shortest spanning subtree of a graph and traveling salesman problem, Proc. Amer. Math. Soc. 7 (1956) 48.
A.C. Yao, AnO \((|\vartheta |\log \log |\vartheta |)\) algorithm for finding minimum spanning trees, Inf. Proc. Lett. 4 (1975) 21–23.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Ishii, H., Shiode, S. Chance constrained bottleneck spanning tree problem. Ann Oper Res 56, 177–187 (1995). https://doi.org/10.1007/BF02031706
Issue Date:
DOI: https://doi.org/10.1007/BF02031706