A novel method for the network reliability in terms of capacitated-minimum-paths without knowing minimum-paths in advance

Journal of the Operational Research Society

Volumn 56, Issue 10, 2005, Pages 1235-1240

  Yeh, W C ^a  

^a NATIONAL CHIAYI UNIVERSITY   (Taiwan)

Author keywords

Capacitated minimum path; Limited flow network; Max flow; Minimum path; Reliability

Indexed keywords

ALGORITHMS; REAL TIME SYSTEMS; RELIABILITY;

CAPACITATED-MINIMUM PATH; LIMITED-FLOW NETWORK; MAX-FLOW; MINIMUM-PATH;

OPERATIONS RESEARCH;

EID: 30744463311     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2601951     Document Type: Article

References (20)

1. Aven T (1987). Availability evaluation of oil/gas production and transportation systems. Reliab Eng 18: 35-44.
2. Hudson JC and Kapur KC (1985). Reliability bounds for multistate systems with multistate components. Opns Res 33: 153-160.
3. Aven T (1985). Reliability evaluation of multistate systems with multistate components. IEEE Trans Reliab R-34: 473-479.
4. Lee SH (1980). Reliability evaluation of a flow network. IEEE Trans Reliab R-29: 21-26.
5. Aggarwal KK et al (1975). A simple method for reliability evaluation of a communication system. IEEE Trans Commun COM-23: 563-565.
6. Samad MA (1987). An efficient algorithm for simultaneously deducing MPs as well as cuts of a communication network. Microelectron Reliab 27: 437-441.
7. Ke WJ and Wang SD (1997). Reliability evaluation for distributed computing networks with imperfect nodes. IEEE Trans Reliab 46: 342-349.
8. Doulliez P and Jalnoulle E (1972). Transportation network with random arc capacities. RAIRO Rech Opns Res 3: 45-60.
9. Colbourn CJ (1987). The Combinatorics of Network Reliability. Oxford University Press: New York.
10. Yeh WC (2001). A simple algorithm to search for all CMPs with unreliable nodes. Reliab Eng System Safety 73(1): 49-54.
11. Yeh WC (1998). A revised layered-network algorithm to search for all d-minpaths of a limited-flow acyclic network. IEEE Trans Reliab 47: 436-442.
12. Yeh WC (2002/7). A simple method to verify all d-minimal path candidates of a limited-flow network and its reliability. Int J Advanced Manuf Technol 20(1): 77-81.
13. Lin JS, Jane CC and Yuan J (1995). On reliability evaluation of a capacitated-flow network in terms of minimal pathsets. Networks 25: 131-138.
14. Xue J (1985). On multistate system analysis. IEEE Trans Reliab R-34: 329-337.
15. Yeh WC (2002/6). Search for all d-mincuts of a limited-flow network. Comput Opns Res 29(13): 1843-1858.
16. Yeh WC (2001). Search for MC in modified networks. Comput Opns Res 28(2): 177-184.
17. Yeh WC (2001). A simple approach to search for all d-MCs of a limited-flow network. Reliab Eng System Safety 71(2): 15-19.
18. Xue J (1985). New approach for multistate systems analysis. Reliab Eng 10: 245-256.
19. Ahuja RK, Magnanti TL and Orlin JB (1993). Network Flows - Theory, Algorithms, and Applications. Prentice-Hall International: Englewood cliffs, NJ.
20. Hoyland A and Rausand M (1994). System Reliability Theory: Models and Statistical Methods. John Wiley & Sons, Inc.: New York.