| Article ID: | iaor20012287 |
| Country: | United Kingdom |
| Volume: | 28 |
| Issue: | 2 |
| Start Page Number: | 177 |
| End Page Number: | 184 |
| Publication Date: | Feb 2001 |
| Journal: | Computers and Operations Research |
| Authors: | Yeh Wei-Chang |
| Keywords: | networks: flow, networks: path |
In this paper, first 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 modified network based upon reformation of all of the MCs of the corresponding original network.