Polynomial dual network simplex algorithms (Q689130): Difference between revisions

@@ Property / cites work @@
+Signature Methods for the Assignment Problem
@@ Property / cites work: Signature Methods for the Assignment Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Theoretical Properties of the Network Simplex Method
+Normal rank
@@ Property / cites work @@
+A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees
+Normal rank
@@ Property / cites work @@
+Q3292914
@@ Property / cites work: Q3292914 / rank @@
+Normal rank
@@ Property / cites work @@
+Use of dynamic trees in a network simplex algorithm for the maximum flow problem
+Normal rank
@@ Property / cites work @@
+Q3352816
@@ Property / cites work: Q3352816 / 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 the simplex algorithm for networks and generalized networks
+Normal rank
@@ Property / cites work @@
+Q3138913
@@ Property / cites work: Q3138913 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficiency of the Primal Network Simplex Algorithm for the Minimum-Cost Circulation Problem
+Normal rank