A Primal-Dual Algorithm for Submodular Flows
暂无分享,去创建一个
[1] William H. Cunningham,et al. Testing membership in matroid polyhedra , 1984, J. Comb. Theory, Ser. B.
[2] András Frank,et al. Finding feasible vectors of Edmonds-Giles polyhedra , 1984, J. Comb. Theory, Ser. B.
[3] D. R. Fulkerson,et al. Flows in Networks. , 1964 .
[4] C. Lucchesi,et al. A Minimax Theorem for Directed Graphs , 1978 .
[5] P. Schönsleben. Ganzzahlige Polymatroid-Intersektions-Algorithmen , 1980 .
[6] Satoru Fujishige,et al. Structures of polyhedra determined by submodular functions on crossing families , 1984, Math. Program..
[7] Martin Grötschel,et al. The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..
[8] E. L. Lawler,et al. Computing Maximal "Polymatroidal" Network Flows , 1982, Math. Oper. Res..
[9] F. Dunstan. MATROIDS AND SUBMODULAR FUNCTIONS , 1976 .
[10] A. Frank. An Algorithm for Submodular Functions on Graphs , 1982 .
[11] J. Edmonds,et al. A Min-Max Relation for Submodular Functions on Graphs , 1977 .
[12] Refael Hassin,et al. Minimum cost flow with set-constraints , 1982, Networks.
[13] Richard M. Karp,et al. Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.
[14] S. Fujishige. ALGORITHMS FOR SOLVING THE INDEPENDENT-FLOW PROBLEMS , 1978 .
[15] A. Schrijver. Total Dual Integrality from Directed Graphs, Crossing Families, and Sub- and Supermodular Functions , 1984 .