The Hungarian method for the assignment problem

Harold William Kuhn

13,090 citations0/0 files storedNaval Research Logistics Quarterly

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Optimization and Mathematical Programming Complexity and Algorithms in Graphs Scheduling and Timetabling Solutions

Abstract

Abstract Assuming that numerical scores are available for the performance of each of n persons on each of n jobs, the “assignment problem” is the quest for an assignment of persons to jobs so that the sum of the n scores so obtained is as large as possible. It is shown that ideas latent in the work of two Hungarian mathematicians may be exploited to yield a new method of solving this problem.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 13,090 citations exist upstream.

References

1950The Problem of Classification of Personnel

Cited by

1957Management Models and Industrial Applications of Linear Programming 2014Latent dirichlet allocation 2022A survey on demand-responsive public bus systems 2011A Mechanism for Dynamic Ride Sharing Based on Parallel Auctions 2018Computer vision aided inspection on falling prevention measures for steeplejacks in an aerial environment 2016Navigating the Local Modes of Big Data: The Case of Topic Models 2008Santa Claus Meets Hypergraph Matchings

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

Imported from OpenAlex (CC0) — nothing here is generated.