A Revised Layered-Network Algorithm To Search For All D-Minpaths Of A Limited-Flow Acyclic Network

Yeh, W

A Revised Layered-Network Algorithm To Search For All D-Minpaths Of A Limited-Flow Acyclic Network

Yeh, W

Permalink

Publisher:: IEEE-Inst Electrical Electronics Engineers Inc
Publication Type:: Journal Article
Citation:: IEEE Transactions on Reliability, 1998, 47 (4), pp. 436 - 442
Issue Date:: 1998-01

Closed Access

	Filename	Description	Size
	2010004144OK.pdf		569.46 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	1998-01	en_US
dc.identifier.citation	IEEE Transactions on Reliability, 1998, 47 (4), pp. 436 - 442	en_US
dc.identifier.issn	0018-9529	en_US
dc.identifier.uri	http://hdl.handle.net/10453/15158
dc.description.abstract	Many real-world systems are multistate and composed of multistate components in which the reliability can be computed in terms of the lower bound points of level d, called d-Minpaths (d-MP). Such systems (electric power, transportation, etc) may be regarded as flow networks whose arcs have statistically independent, discrete, limited, and multimlued random capacities. This study focuses on how to find the entire path of (GMP before calculating the reliability of an acyclic network.	en_US
dc.publisher	IEEE-Inst Electrical Electronics Engineers Inc	en_US
dc.relation.ispartof	IEEE Transactions on Reliability	en_US
dc.rights	© 1998 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.	en_US
dc.subject.classification	Operations Research	en_US
dc.title	A Revised Layered-Network Algorithm To Search For All D-Minpaths Of A Limited-Flow Acyclic Network	en_US
dc.type	Journal Article
utslib.citation.volume	4	en_US
utslib.citation.volume	47	en_US
utslib.location.activity	ISI:000079621800007	en_US
utslib.for	0803 Computer Software	en_US
utslib.for	0906 Electrical and Electronic Engineering	en_US
dc.location.activity	ISI:000079621800007	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	4	en_US
pubs.volume	47	en_US

Abstract:

Many real-world systems are multistate and composed of multistate components in which the reliability can be computed in terms of the lower bound points of level d, called d-Minpaths (d-MP). Such systems (electric power, transportation, etc) may be regarded as flow networks whose arcs have statistically independent, discrete, limited, and multimlued random capacities. This study focuses on how to find the entire path of (GMP before calculating the reliability of an acyclic network.

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

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