Abstract
A counter example is given to the assertion that a certain algorithm will yield the maximal flow of a finite network in a finite number of steps, even if the arc capacities are real numbers. It is shown that an addition to the algorithm will make it finite.
Article PDF
Avoid common mistakes on your manuscript.
Reference
T.C. Hu,Integer programming and network flows (Addison-Wesley Publ. Co., Inc., Reading, Mass., 1969) 115.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Ponstein, J. On the maximal flow problem with real arc capacities. Mathematical Programming 3, 254–256 (1972). https://doi.org/10.1007/BF01584994
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01584994