论文信息 - A strongly polynomial minimum cost circulation algorithm - 字舞流文

A strongly polynomial minimum cost circulation algorithm

A new algorithm is presented for the minimum cost circulation problem. The algorithm is strongly polynomial, that is, the number of arithmetic operations is polynomial in the number of nodes, and is independent of both costs and capacities.

Éva Tardos | É. Tardos

[1] D. R. Fulkerson,et al. An Out-of-Kilter Method for Minimal-Cost Flow Problems , 1960 .

[2] D. R. Fulkerson,et al. Flows in Networks. , 1964 .

[3] J. Edmonds. Systems of distinct representatives and linear algebra , 1967 .

[4] Richard M. Karp,et al. Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.

[5] J. Edmonds,et al. A Min-Max Relation for Submodular Functions on Graphs , 1977 .

[6] C. Lucchesi,et al. A Minimax Theorem for Directed Graphs , 1978 .

[7] László Lovász,et al. Factoring polynomials with rational coefficients , 1982 .

[8] Nimrod Megiddo,et al. Towards a Genuinely Polynomial Algorithm for Linear Programming , 1983, SIAM J. Comput..

[9] András Frank,et al. A Primal-Dual Algorithm for Submodular Flows , 1985, Math. Oper. Res..