Network Simplex Algorithm associated with the Maximum Flow Problem
classification
🧮 math.CO
cs.DM
keywords
algorithmflowproblemmaximumnetworksimplexassociatedapply
read the original abstract
In the present paper, we apply the network simplex algorithm for solving the minimum cost flow problem, to the maximum flow problem. Then we prove that the cycling phenomenon which causes the infinite loop in the algorithm, does not occur in the network simplex algorithm associated with the maximum flow problem.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.