| Article ID: | iaor1993312 |
| Country: | United Kingdom |
| Volume: | 19 |
| Issue: | 8 |
| Start Page Number: | 783 |
| End Page Number: | 787 |
| Publication Date: | Nov 1992 |
| Journal: | Computers and Operations Research |
| Authors: | Shin Kwang, Corder Steve |
In the maximum flow problem, scanning node and arc data in flxed order has the same effect as choosing shortest flow augmenting paths, which leads to the solution with a minimum number of iterations. A judicious fixed-order scanning procedure greatly accelerates the Ford-Fulkerson labeling algorithm by minimizing the amount of data traversal.