A computational comparison of the dinic and network simplex methods for maximum flow-Reference-Cited by-同舟云学术

A computational comparison of the dinic and network simplex methods for maximum flow

Published:1988-12 Issue:1 Volume:13 Page:81-123
ISSN:0254-5330
Container-title:Annals of Operations Research
language:en
Short-container-title:Ann Oper Res

Author:

Goldfarb Donald,Grigoriadis Michael D.

Publisher

Springer Science and Business Media LLC

Subject

Management Science and Operations Research,General Decision Sciences

Link

http://link.springer.com/content/pdf/10.1007/BF02288321.pdf

Reference37 articles.

1. M.J. Best and K. Ritter,Linear Programming: Active Set Analysis and Computer Programs (Prentice-Hall, Englewood Cliffs, New Jersey, 1985).

2. R.V. Cherkasky, Algorithms of construction of maximum flow in networks with complexityO(V 2√E) operations, Mathematical Methods of Solution of Economical Problems 7(1977)112 (in Russian).

3. W.H. Cunningham, A network simplex method, Math. Progr. 1(1976)105.

4. W.H. Cunningham, Theoretical properties of the network simplex method, Math. of Oper. Res. 4(1979)196.

5. T-Y. Cheung, Computational comparison of eight methods for the maximum network flow problem, ACM Trans. on Math. Software 6(1980)1.

Cited by 56 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Deterministic Almost-Linear Time Algorithm for Minimum-Cost Flow;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

2. Risk‐averse optimization and resilient network flows;Networks;2023-05-13

3. The capacity constraint physarum solver;Journal of Computational Science;2022-07

4. An iterative security game for computing robust and adaptive network flows;Computers & Operations Research;2022-02

5. Optimized Spatiotemporal Data Scheduling Based on Maximum Flow for Multilevel Visualization Tasks;ISPRS International Journal of Geo-Information;2020-08-28