AWhat changed
Kuhn combines bipartite matching and an adequate-budget dual certificate into a finite method for maximum-score one-to-one assignment with positive integer ratings, supplying explicit transfer and budget-improvement routines.
Scientific scope
Kuhn combines bipartite matching and an adequate-budget dual certificate into a finite method for maximum-score one-to-one assignment with positive integer ratings, supplying explicit transfer and budget-improvement routines. The method solves the finite assignment problem under the stated cost and matching model. Dual potentials and admissible augmentations are essential. Original algorithmic presentation and later polynomial implementations have different complexity accounts. This is not a solver for arbitrary generalized scheduling or transportation constraints; earlier Kőnig/Egerváry work retains credit.
Evidence
Source-linked, scoped account of the original work. The published scope states the scientific assumptions and remaining verification limits. WRS has not independently certified the full proof, experimental result or system benchmark.
Contributors
- Harold W. Kuhn · SCIENCE: Original source-listed scientific author of this scoped work; byline does not determine effort fractions.
- Kuhn, The Hungarian Method for the Assignment Problem (1955), original 83-97 facsimile in 2010 volume
- Harold W. Kuhn: authored introduction to the Hungarian-method reprint (2010)
Provisional WRS assessment, edition 2026-10-16.1. Independent expert calibration is pending. This grade does not certify correctness or assign ownership.
Full scientific record · Browse contribution grades · Request a correction