Subject
Applied Mathematics,Industrial and Manufacturing Engineering,Management Science and Operations Research,Software
Reference5 articles.
1. Theoretical improvements in algorithmic efficiency for network flow problems;Edmonds;J. ACM,1972
2. A maximum flow algorithm using MA ordering;Fujishige;Oper. Res. Lett.,2003
3. S. Fujishige, S. Isotani, New maximum flow algorithms by MA ordering and scaling, Proceedings of the Third Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications, 2003, pp. 186–193.
4. Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks;McCormick;Oper. Res. Lett.,2000
5. Theoretical efficiency of the algorithm ‘Capacity’ for the maximum flow problem;Queyranne;Math. Oper. Res.,1980
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Netzwerkflüsse;Kombinatorische Optimierung;2018
2. Network Flows;Algorithms and Combinatorics;2018
3. Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested;Japan Journal of Industrial and Applied Mathematics;2012-06-09
4. Netzwerkflüsse;Kombinatorische Optimierung;2012
5. Network Flows;Algorithms and Combinatorics;2011-10-27