𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Two-state-variable stochastic tree problems

✍ Scribed by Ye, Meng-Hua

Publisher
John Wiley and Sons
Year
1989
Tongue
English
Weight
701 KB
Volume
5
Category
Article
ISSN
8755-0024

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On stochastic spanning tree problem
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

State space partitioning methods for sto
State space partitioning methods for stochastic shortest path problems
✍ Alexopoulos, Christos πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 150 KB πŸ‘ 2 views

This paper describes methods for computing measures related to shortest paths in networks with discrete random arc lengths. These measures include the probability that there exists a path with length not exceeding a specified value and the probability that a given path is shortest. The proposed meth