An O(n2(m + n log n) log n) min-cost flow algorithm
暂无分享,去创建一个
Éva Tardos | Zvi Galil | Z. Galil | É. Tardos
[1] William J. Cook,et al. Sensitivity theorems in integer linear programming , 1986, Math. Program..
[2] L. G. H. Cijan. A polynomial algorithm in linear programming , 1979 .
[3] J. Orlin. Working Paper Alfred P. Sloan School of Management Genuinely Polynominal Simplex and Non-simplex Algorithms for the Minimum Cost Flow Problem Genuinely Polynominal Simplex and Non-simplex Algorithms for the Minimum Cost Flow Problem , 2008 .
[4] Richard M. Karp,et al. Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.
[5] Éva Tardos,et al. A strongly polynomial minimum cost circulation algorithm , 1985, Comb..
[6] Richard M. Karp,et al. A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.
[7] E. A. Dinic. Algorithm for solution of a problem of maximal flow in a network with power estimation , 1970 .
[8] L. Khachiyan. Polynomial algorithms in linear programming , 1980 .
[9] Narendra Karmarkar,et al. A new polynomial-time algorithm for linear programming , 1984, Comb..