✦ LIBER ✦

Repeated stochastic tree problems

✍ Scribed by Meng-Hua Ye

Book ID: 116100035
Publisher: Elsevier Science
Year: 1986
Tongue: English
Weight: 182 KB
Volume: 20
Category: Article
ISSN: 0165-1765
DOI: 10.1016/0165-1765(86)90156-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Stochastic spanning tree problem

✍ Hiroaki Ishii; Shōgo Shiode; Toshio Nishida; Yoshikazu Namasuya 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 485 KB

Two-state-variable stochastic tree probl

Two-state-variable stochastic tree problems

✍ Ye, Meng-Hua 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 701 KB

On stochastic spanning tree problem

✍ S. Geetha; K. P. K. Nair 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 443 KB

This paper considers a generalized version of the stochastic spanning tree problem in which edge costs are random variables and the objective is to find a spectrum of optimal spanning trees satisfying a certain chance constraint whose right-hand side also is treated as a decision variable. A special

Stochastic bottleneck spanning tree prob

Stochastic bottleneck spanning tree problem

✍ Hiroaki Ishii; Toshio Nishida 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 296 KB

This paper considers a stochastic version of bottleneck spanning tree problem in which edge costs are random variables. The problem is to find an optimal spanning tree under the chance constraint with respect to bottleneck (maximum cost) edge of spanning tree. The problem is first transformed into a

A sequential stochastic tree problem

✍ Robert A. Miller; Karl Voltaire 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 222 KB

Interval elimination method for stochast

Interval elimination method for stochastic spanning tree problem

✍ Ismail Bin Mohd 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 601 KB