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

Annals of Operations Research

Volumn 13, Issue 1, 1988, Pages 81-123

  Goldfarb, Donald ^a   Grigoriadis, Michael D ^b  

^a Och Spine at New York Presbyterian Hospitals   (United States)

^b RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 27144461131     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1007/BF02288321     Document Type: Article

References (37)

1. Algorithms of construction of maximum flow in networks with complexity O(V2√E) operations
2. A network simplex method
3. Theoretical properties of the network simplex method
4. Computational comparison of eight methods for the maximum network flow problem
5. Algorithms for solution of a problem of maximum flow in networks with power estimation
6. Theoretical improvements in algorithmic efficiency for network flow problems
7. Maximal flow through a network
8. An O(V5/3E2/3) algorithm for the maximum flow problem
9. An O(EV log2V) algorithm for the maximum flow problem
10. An extended abstract of an indepth algorithmic and computational study for maximum flow problems
11. A practicable steepest-edge simplex algorithm
12. An efficient implementation of the network simplex method
13. Pivot selection methods of the Devex LP code
14. Networks and basic solutions
15. A characterization of the minimum cycle mean in a digraph
16. Determining the maximal flow in a network by the method of preflows
17. An O(| V|3) algorithm for finding maximum flows in networks
18. Pivot strategies for primal-simplex network codes
19. An O(n2 log n) parallel max-flow algorithm
20. A data structure for dynamic trees
21. A simple version of Karzanov's blocking flow algorithm
22. More pathological examples for network flow problems