最大流问题的网络单纯形算法
Network Simplex Algorithm associated with the Maximum Flow Problem
摘要:
本文将求解最小费用流问题的网络单纯形算法应用于求解最大流问题。证明了在最大流问题的网络单纯形算法中,不会出现导致算法中出现无限循环的循环现象。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。