Strongly polynomial dual simplex methods for the maximum flow problem (Q1380934): Difference between revisions

@@ Property / cites work @@
+Q3056948
@@ Property / cites work: Q3056948 / rank @@
+Normal rank
@@ Property / cites work @@
+A Fast and Simple Algorithm for the Maximum Flow Problem
+Normal rank
@@ Property / cites work @@
+Use of dynamic trees in a network simplex algorithm for the maximum flow problem
+Normal rank
@@ Property / cites work @@
+A new approach to the maximum-flow problem
@@ Property / cites work: A new approach to the maximum-flow problem / rank @@
+Normal rank
@@ Property / cites work @@
+A primal simplex algorithm that solves the maximum flow problem in at most nm pivots and \(O(n^ 2m)\) time
+Normal rank
@@ Property / cites work @@
+On strongly polynomial variants of the networks simplex algorithm for the maximum flow problem
+Normal rank
@@ Property / cites work @@
+Q4058442
@@ Property / cites work: Q4058442 / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial dual network simplex algorithms
@@ Property / cites work: Polynomial dual network simplex algorithms / rank @@
+Normal rank