Efficient dual simplex algorithms for the assignment problem (Q3701192): Difference between revisions

@@ Property / cites work @@
+Q4091421
@@ Property / cites work: Q4091421 / rank @@
+Normal rank
@@ Property / cites work @@
+Signature Methods for the Assignment Problem
@@ Property / cites work: Signature Methods for the Assignment Problem / rank @@
+Normal rank
@@ Property / cites work @@
+The alternating basis algorithm for assignment problems
+Normal rank
@@ Property / cites work @@
+A new algorithm for the assignment problem
@@ Property / cites work: A new algorithm for the assignment problem / rank @@
+Normal rank
@@ Property / cites work @@
+A network simplex method
@@ Property / cites work: A network simplex method / rank @@
+Normal rank
@@ Property / cites work @@
+Q4197644
@@ Property / cites work: Q4197644 / rank @@
+Normal rank
@@ Property / cites work @@
+Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
+Normal rank
@@ Property / cites work @@
+An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
+Normal rank
@@ Property / cites work @@
+Technical Note—A Polynomial Simplex Method for the Assignment Problem
+Normal rank
@@ Property / cites work @@
+Solving the Assignment Problem by Relaxation
@@ Property / cites work: Solving the Assignment Problem by Relaxation / rank @@
+Normal rank
@@ Property / cites work @@
+Q5519710
@@ Property / cites work: Q5519710 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3048571
@@ Property / cites work: Q3048571 / rank @@
+Normal rank
@@ Property / cites work @@
+Self-Adjusting Heaps
@@ Property / cites work: Self-Adjusting Heaps / rank @@
+Normal rank
@@ Property / cites work @@
+Amortized Computational Complexity
@@ Property / cites work: Amortized Computational Complexity / rank @@
+Normal rank