Maximum Reliability Route Subject to k-Improvements in a Directed Network
- 1 June 1977
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Reliability
- Vol. R-26 (2) , 103-105
- https://doi.org/10.1109/TR.1977.5220064
Abstract
The network consists of links and perfect nodes. Each link has several known reliability numbers associated with it; each reliability number is related to the number of improvements made on that link. The network reliability is to be maximised subject to a constraint on the sum of the number of link improvements, by finding the appropriate route through the network. Dynamic programming is used to solve the problem. A numerical example illustrates the solution.Keywords
This publication has 1 reference indexed in Scilit:
- Optimum reliability route in communication net-worksMicroelectronics Reliability, 1972