Search for all d-Mincuts of a limited-flow network

Search for all d-Mincuts of a limited-flow network

0.00 Avg rating0 Votes
Article ID: iaor2003356
Country: United Kingdom
Volume: 29
Issue: 13
Start Page Number: 1843
End Page Number: 1858
Publication Date: Nov 2002
Journal: Computers and Operations Research
Authors:
Keywords: heuristics
Abstract:

In this presentation, we developed an intuitive algorithm based on some simple concepts that were found in this study. It is more efficient than the best-known existing algorithm. The computational complexity of the proposed algorithm is analyzed and compared with the existing methods. One example is illustrated to show how all d-MCs are generated by our proposed algorithm. As evidence of the utility of the proposed approach, extensive computational results on random test problems are presented. Our results compare favorably with previously developed algorithms in the literature.

Reviews

Required fields are marked *. Your email address will not be published.