A Path-Based Algorithm For Evaluating The K-Out-Of-N Flow Network Reliability

Yeh, W

A Path-Based Algorithm For Evaluating The K-Out-Of-N Flow Network Reliability

Yeh, W

Permalink

Publisher:: Elsevier Sci Ltd
Publication Type:: Journal Article
Citation:: Reliability Engineering & System Safety, 2005, 87 (2), pp. 243 - 251
Issue Date:: 2005-01

Closed Access

	Filename	Description	Size
	2010004122OK.pdf		213.69 kB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Yeh, W	en_US
dc.date.issued	2005-01	en_US
dc.identifier.citation	Reliability Engineering & System Safety, 2005, 87 (2), pp. 243 - 251	en_US
dc.identifier.issn	0951-8320	en_US
dc.identifier.uri	http://hdl.handle.net/10453/15307
dc.description.abstract	Evaluating the network reliability is an important topic in the planning, designing and control of systems. The minimal path (MP, an edge set) set is one of the major, fundamental tools for evaluating network reliability. A k-out-of-n MP is a union of so	en_US
dc.publisher	Elsevier Sci Ltd	en_US
dc.relation.ispartof	Reliability Engineering & System Safety	en_US
dc.relation.isbasedon	10.1016/j.ress.2004.04.015	en_US
dc.subject.classification	Strategic, Defence & Security Studies	en_US
dc.title	A Path-Based Algorithm For Evaluating The K-Out-Of-N Flow Network Reliability	en_US
dc.type	Journal Article
utslib.citation.volume	2	en_US
utslib.citation.volume	87	en_US
utslib.location.activity	ISI:000225667100009	en_US
utslib.for	0913 Mechanical Engineering	en_US
utslib.for	01 Mathematical Sciences	en_US
utslib.for	09 Engineering	en_US
utslib.for	15 Commerce, Management, Tourism and Services	en_US
dc.location.activity	ISI:000225667100009	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Software
pubs.organisational-group	/University of Technology Sydney/Strength - AAI - Advanced Analytics Institute Research Centre
utslib.copyright.status	closed_access
pubs.consider-herdc	false	en_US
pubs.issue	2	en_US
pubs.volume	87	en_US

Abstract:

Evaluating the network reliability is an important topic in the planning, designing and control of systems. The minimal path (MP, an edge set) set is one of the major, fundamental tools for evaluating network reliability. A k-out-of-n MP is a union of so

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/15307