✦ LIBER ✦

Bounding Distributions for a Stochastic Acyclic Network

✍ Scribed by George B. Kleindorfer

Book ID: 121325207
Publisher: INFORMS
Year: 1971
Tongue: English
Weight: 419 KB
Volume: 19
Category: Article
ISSN: 0030-364X
DOI: 10.2307/169180

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Part 1 || A Comparison of the Method of

Part 1 || A Comparison of the Method of Bounding Distributions (MBD) and Monte Carlo Simulation for Analyzing Stochastic Acyclic Networks

✍ Robert S. Sullivan and Jack C. Hayya 📂 Article 📅 1980 🏛 INFORMS 🌐 English ⚖ 151 KB

Bounding distributions for a stochastic

Bounding distributions for a stochastic pert network

✍ A. W. Shogan 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 888 KB

Computing bounds on project duration dis

Computing bounds on project duration distributions for stochastic PERT networks

✍ Tetsuo Iida 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 208 KB

Sequential Bounding of the Reliability o

Sequential Bounding of the Reliability of a Stochastic Network

✍ Andrew W. Shogan 📂 Article 📅 1976 🏛 INFORMS 🌐 English ⚖ 471 KB

A Reach and Bound algorithm for acyclic

A Reach and Bound algorithm for acyclic dynamic-programming networks

✍ Matthew D. Bailey; Robert L. Smith; Jeffrey M. Alden 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 111 KB

## Abstract Node pruning is a commonly used technique for solution acceleration in a dynamic‐programming network. In pruning, nodes are adaptively removed from the dynamic programming network when they are determined not to lie on an optimal path. We introduce an ε‐pruning condition that extends pr

Stochastically bounded burstiness for co

Stochastically bounded burstiness for communication networks

✍ Starobinski, D.; Sidi, M. 📂 Article 📅 2000 🏛 IEEE 🌐 English ⚖ 285 KB