Network Simplex Algorithm associated with the Maximum Flow Problem
Combinatorics
2017-06-15 v1 Discrete Mathematics
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.
Cite
@article{arxiv.1706.04302,
title = {Network Simplex Algorithm associated with the Maximum Flow Problem},
author = {Sennosuke Watanabe and Hodaka Tanaka and Yoshihide Watanabe},
journal= {arXiv preprint arXiv:1706.04302},
year = {2017}
}
Comments
13pages