𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Algorithms for K-terminal reliability problems with node failures

✍ Scribed by Ehab S. Elmallah

Publisher
John Wiley and Sons
Year
1992
Tongue
English
Weight
896 KB
Volume
22
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Partition-based algorithm for estimating
Partition-based algorithm for estimating transportation network reliability with dependent link failures
✍ Agachai Sumalee; David P. Watling πŸ“‚ Article πŸ“… 2008 πŸ› Institute for Transportation Inc. 🌐 English βš– 133 KB

## Abstract Evaluating the reliability of a transportation network often involves an intensive simulation exercise to randomly generate and evaluate different possible network states. This paper proposes an algorithm to approximate the network reliability which minimizes the use of such simulation

A dynamic programming algorithm for the
A dynamic programming algorithm for the shortest path problem with time windows and linear node costs
✍ Ioachim, Irina; GοΏ½linas, Sylvie; Soumis, FranοΏ½ois; Desrosiers, Jacques πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 154 KB πŸ‘ 3 views

This paper presents an optimal dynamic programming algorithm, the first such algorithm in the literature to solve the shortest path problem with time windows and additional linear costs on the node service start times. To optimally solve this problem, we propose a new dynamic programming algorithm w