Search For Mc In Modified Networks

Pergamon-Elsevier Science Ltd
Publication Type:
Journal Article
Computers & Operations Research, 2001, 28 (2), pp. 177 - 184
Issue Date:
Filename Description Size
Thumbnail2010004142OK.pdf103.93 kB
Adobe PDF
Full metadata record
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: