| Article ID: | iaor19911099 |
| Country: | Italy |
| Volume: | 20 |
| Issue: | 53 |
| Start Page Number: | 65 |
| End Page Number: | 75 |
| Publication Date: | Mar 1990 |
| Journal: | Ricerca Operativa |
| Authors: | Scutella Maria Grazia |
The paper addresses Cherkasky’s algorithm for the maximum flow problem, and a simpler version of the algorithm, having the same time complexity but a lower space complexity is proposed. Unlike Cherkasky’s algorithm, the new version represents a true generalization of Karzanov’s algorithm.