Search For Mc In Modified Networks

Yeh, W

Search For Mc In Modified Networks

Yeh, W

Permalink

Publisher:: Pergamon-Elsevier Science Ltd
Publication Type:: Journal Article
Citation:: Computers & Operations Research, 2001, 28 (2), pp. 177 - 184
Issue Date:: 2001-01

Closed Access

	Filename	Description	Size
	2010004142OK.pdf		103.93 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	2001-01	en_US
dc.identifier.citation	Computers & Operations Research, 2001, 28 (2), pp. 177 - 184	en_US
dc.identifier.issn	0305-0548	en_US
dc.identifier.uri	http://hdl.handle.net/10453/14502
dc.description.abstract	In this paper, "rst we develop an intuitive algorithm using the shortest path based upon the reformation of all MCs in the original network. Next, the computational complexity of the proposed algorithm is analyzed and compared with the existing methods. One computer example is illustrated to show how all MCs are generated in a modi"ed network based upon reformation of all of the MCs of the corresponding original network.	en_US
dc.publisher	Pergamon-Elsevier Science Ltd	en_US
dc.relation.ispartof	Computers & Operations Research	en_US
dc.relation.isbasedon	10.1016/S0305-0548(00)00046-0	en_US
dc.subject.classification	Operations Research	en_US
dc.title	Search For Mc In Modified Networks	en_US
dc.type	Journal Article
utslib.citation.volume	2	en_US
utslib.citation.volume	28	en_US
utslib.location.activity	ISI:000090074800006	en_US
utslib.for	0102 Applied Mathematics	en_US
utslib.for	0103 Numerical and Computational Mathematics	en_US
dc.location.activity	ISI:000090074800006	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	28	en_US

Abstract:

In this paper, "rst we develop an intuitive algorithm using the shortest path based upon the reformation of all MCs in the original network. Next, the computational complexity of the proposed algorithm is analyzed and compared with the existing methods. One computer example is illustrated to show how all MCs are generated in a modi"ed network based upon reformation of all of the MCs of the corresponding original network.

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

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