A new strongly polynomial dual network simplex algorithm (Q1373742): Difference between revisions

@@ Property / cites work @@
+Q3056948
@@ Property / cites work: Q3056948 / rank @@
+Normal rank
@@ Property / cites work @@
+Solving linear bottleneck assignment problems via strong spanning trees
+Normal rank
@@ Property / cites work @@
+Strongly polynomial simplex algorithm for bipartite vertex packing
+Normal rank
@@ Property / cites work @@
+A competitive (dual) simplex method for the assignment problem
+Normal rank
@@ Property / cites work @@
+Maximum matchings in bipartite graphs via strong spanning trees
+Normal rank
@@ Property / cites work @@
+A network simplex method
@@ Property / cites work: A network simplex method / rank @@
+Normal rank
@@ Property / cites work @@
+Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
+Normal rank
@@ Property / cites work @@
+Efficient dual simplex algorithms for the assignment problem
+Normal rank
@@ Property / cites work @@
+A Faster Strongly Polynomial Minimum Cost Flow Algorithm
+Normal rank
@@ Property / cites work @@
+Polynomial dual network simplex algorithms
@@ Property / cites work: Polynomial dual network simplex algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+A strongly polynomial minimum cost circulation algorithm
+Normal rank