By Topic

Maximum Reliability Route Subject to k-Improvements in a Directed Network

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Bansal, S.P. ; A.R.S.D. College; Delhi University; Dhaula Kuan; New Delhi 110021 INDIA ; Kumar, S.

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.

Published in:

Reliability, IEEE Transactions on  (Volume:R-26 ,  Issue: 2 )