A comparison of two algorithms for the assignment problem (Q1804373): Difference between revisions

@@ Property / cites work @@
+A parallel shortest augmenting path algorithm for the assignment problem
+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 @@
+The auction algorithm: A distributed relaxation method for the assignment problem
+Normal rank
@@ Property / cites work @@
+Dual coordinate step methods for linear network flow problems
+Normal rank
@@ Property / cites work @@
+Q4001523
@@ Property / cites work: Q4001523 / rank @@
+Normal rank
@@ Property / cites work @@
+Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
+Normal rank
@@ Property / cites work @@
+A shortest augmenting path algorithm for dense and sparse linear assignment problems
+Normal rank
@@ Property / cites work @@
+An algorithm to solve them ×n assignment problem in expected timeO(mn logn)
+Normal rank
@@ Property / cites work @@
+Performance Characteristics of the Jacobi and the Gauss-Seidel Versions of the Auction Algorithm on the Alliant FX/8
+Normal rank
@@ Property / cites work @@
+An Empirical Analysis of the Dense Assignment Problem: Sequential and Parallel Implementations
+Normal rank
@@ Property / cites work @@
+On some techniques useful for solution of transportation network problems
+Normal rank