Speeding up the Hungarian algorithm (Q1823856): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0305-0548(90)90031-2
+Normal rank
@@ Property / OpenAlex ID @@
+W2064608681
@@ Property / OpenAlex ID: W2064608681 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5519710
@@ Property / cites work: Q5519710 / rank @@
+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 @@
+A shortest augmenting path algorithm for dense and sparse linear assignment problems
+Normal rank
@@ Property / cites work @@
+Improving the Hungarian assignment algorithm
@@ Property / cites work: Improving the Hungarian assignment algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Applying Stochastic Algorithms to a Locomotive Scheduling Problem
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1823856