Author:
Iwata Satoru,McCormick S.Thomas,Shigeno Maiko
Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference35 articles.
1. Finding minimum-cost flows by double scaling;Ahuja;Math. Programming,1992
2. A submodular network simplex method;Barahona;Math. Programming Stud.,1984
3. On the computational behavior of a polynomial-time network flow algorithm;Bland;Math. Programming,1992
4. A dual algorithm for submodular flow problems;Chung;Oper. Res. Lett.,1991
5. A primal algorithm for the submodular flow problem with minimum-mean cycle selection;Cui;J. Oper. Res. Soc. Japan,1988
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The b-branching problem in digraphs;Discrete Applied Mathematics;2020-09
2. A Faster Cutting Plane Method and its Implications for Combinatorial and Convex Optimization;2015 IEEE 56th Annual Symposium on Foundations of Computer Science;2015-10
3. Minimizing a sum of submodular functions;Discrete Applied Mathematics;2012-10
4. Lattice polyhedra and submodular flows;Japan Journal of Industrial and Applied Mathematics;2012-06-24
5. A Max-Flow/Min-Cut Algorithm for Linear Deterministic Relay Networks;IEEE Transactions on Information Theory;2011-05