A Simple Heuristic Algorithm For Generating All Minimal Paths

Yeh, W

A Simple Heuristic Algorithm For Generating All Minimal Paths

Yeh, W

Permalink

Publisher:: IEEE-Inst Electrical Electronics Engineers Inc
Publication Type:: Journal Article
Citation:: IEEE Transactions On Reliability, 2007, 56 (3), pp. 488 - 494
Issue Date:: 2007-01

Closed Access

	Filename	Description	Size
	2010004111OK.pdf		267.95 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	2007-01	en_US
dc.identifier.citation	IEEE Transactions On Reliability, 2007, 56 (3), pp. 488 - 494	en_US
dc.identifier.issn	0018-9529	en_US
dc.identifier.uri	http://hdl.handle.net/10453/15163
dc.description.abstract	Evaluating network reliability is an important topic in the planning, designing, and control of network systems. In this paper, an intuitive heuristic algorithm is developed to find all minimal paths (NIP) by adding a path, or an edge into a network repe	en_US
dc.publisher	IEEE-Inst Electrical Electronics Engineers Inc	en_US
dc.relation.ispartof	IEEE Transactions On Reliability	en_US
dc.relation.isbasedon	10.1109/TR.2007.903290	en_US
dc.rights	© 2007 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 Simple Heuristic Algorithm For Generating All Minimal Paths	en_US
dc.type	Journal Article
utslib.citation.volume	3	en_US
utslib.citation.volume	56	en_US
utslib.location.activity	ISI:000249309600014	en_US
utslib.for	0803 Computer Software	en_US
utslib.for	0906 Electrical and Electronic Engineering	en_US
dc.location.activity	ISI:000249309600014	en_US
dc.location.activity	University of NSW, Sydney
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	3	en_US
pubs.volume	56	en_US

Abstract:

Evaluating network reliability is an important topic in the planning, designing, and control of network systems. In this paper, an intuitive heuristic algorithm is developed to find all minimal paths (NIP) by adding a path, or an edge into a network repe

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

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