𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Optimally reliable networks

✍ Scribed by D. H. Smith

Book ID
112688639
Publisher
Springer US
Year
1991
Tongue
English
Weight
427 KB
Volume
33
Category
Article
ISSN
0254-5330

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Uniformly optimally reliable graphs
Uniformly optimally reliable graphs
✍ Gross, D.; Saccoman, J. T. πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 156 KB

A graph with n nodes and e edges, where the nodes are perfectly reliable and the edges fail independently with equal probability r, is said to be uniformly optimally reliable (UOR) if it has the greatest reliability among all graphs with the same number of nodes and edges for all values of r. UOR si

Network reliability-based optimal toll d
Network reliability-based optimal toll design
✍ Hao Li; Michiel C. J. Bliemer; Piet H. L. Bovy πŸ“‚ Article πŸ“… 2008 πŸ› Institute for Transportation Inc. 🌐 English βš– 235 KB πŸ‘ 1 views

## Abstract Optimal toll design from a network reliability point of view is addressed in this paper. Improving network reliability is proposed as a policy objective of road pricing. A reliability‐based optimal toll design model, where on the upper level network performance including travel time rel