Strongly polynomial simplex algorithm for bipartite vertex packing (Q1917242): Difference between revisions

@@ 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 new approach to the maximum-flow problem
@@ Property / cites work: A new approach to the maximum-flow problem / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient dual simplex algorithms for the assignment problem
+Normal rank
@@ Property / cites work @@
+The ellipsoid method and its consequences in combinatorial optimization
+Normal rank
@@ Property / cites work @@
+A polynomial algorithm for maximum weighted vertex packings on graphs without long odd cycles
+Normal rank
@@ Property / cites work @@
+An Efficient Primal Simplex Algorithm for Maximum Weighted Vertex Packing on Bipartite Graphs
+Normal rank
@@ Property / cites work @@
+Computational experience with a polynomial-time dual simplex algorithm for the transportation problem
+Normal rank