Ishii, Hiroaki; Shiode, Shogo; Nishida, Toshio; Namasuya, Yoshikazu Stochastic spanning tree problem. (English) Zbl 0466.90056 Discrete Appl. Math. 3, 263-273 (1981). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 29 Documents MSC: 90C15 Stochastic programming 90C35 Programming involving graphs or networks 90B10 Deterministic network models in operations research 65K05 Numerical mathematical programming methods 68Q25 Analysis of algorithms and problem complexity 90C10 Integer programming Keywords:minimal spanning tree problem; stochastic spanning tree; polynomial order algorithm; discrete stochastic programming; communication network; random edge costs PDFBibTeX XMLCite \textit{H. Ishii} et al., Discrete Appl. Math. 3, 263--273 (1981; Zbl 0466.90056) Full Text: DOI References: [1] Charnes, A.; Cooper, W. W., Chance Constrained Programming, Management Sci, 6, 73-79 (1959) · Zbl 0995.90600 [2] Christofides, N., Graph Theory: An Algorithmic Approach (1975), Academic Press: Academic Press New York · Zbl 0321.94011 [3] Gabow, H. N., A good algorithm for smallest spanning trees with a degree constraint, Networks, 8, 201-208 (1978) · Zbl 0384.90105 [4] Kataoka, S., A stochastic programming model, Econometrica, 13, 181-196 (1963) · Zbl 0125.09601 [5] Kruskal, J. B., On the shortest spanning subtree of a graph and traveling salesman problem, Proc. Amer. Math. Soc, 7, 48 (1956) · Zbl 0070.18404 [6] Prim, R. C., Shortest connection networks and some generalizations, Bell. System Tech. J, 36, 1389 (1957) [7] Sengupta, J. K., Stochastic Programming (1972), North-Holland: North-Holland Amsterdam · Zbl 0154.19602 [8] Vajda, S., Probabilistic Programming (1972), Academic Press: Academic Press New York This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.