Solving the many to many assignment problem by improving the Kuhn-Munkres algorithm with backtracking (Q2634668): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2016.01.002
+Normal rank
@@ Property / OpenAlex ID @@
+W2236520910
@@ Property / OpenAlex ID: W2236520910 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5519710
@@ Property / cites work: Q5519710 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for the Assignment and Transportation Problems
+Normal rank
@@ Property / cites work @@
+On Kuhn's Hungarian Method?A tribute from Hungary
@@ Property / cites work: On Kuhn's Hungarian Method?A tribute from Hungary / rank @@
+Normal rank
@@ Property / cites work @@
+An extension of the Munkres algorithm for the assignment problem to rectangular matrices
+Normal rank
@@ Property / cites work @@
+Incremental assignment problem
@@ Property / cites work: Incremental assignment problem / rank @@
+Normal rank
@@ Property / cites work @@
+Parallel synchronous and asynchronous implementations of the auction algorithm
+Normal rank
@@ Property / cites work @@
+The \(k\)-cardinality assignment problem
@@ Property / cites work: The \(k\)-cardinality assignment problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q3953561
@@ Property / cites work: Q3953561 / rank @@
+Normal rank
@@ Property / cites work @@
+Task decomposition, dynamic role assignment, and low-bandwidth communication for real-time strategic teamwork
+Normal rank
@@ Property / cites work @@
+Graph matching using the interference of continuous-time quantum walks
+Normal rank
@@ Property / cites work @@
+A new polynomial-time algorithm for linear programming
+Normal rank