{"doi":"10.1002/nav.3800020109","title":"The Hungarian method for the assignment problem","abstract":"<jats:title>Abstract</jats:title><jats:p>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.</jats:p>","journal":"Naval Research Logistics Quarterly","year":1955,"id":10039,"datarank":33.016646845750635,"base_score":9.42617729477462,"endowment":9.42617729477462,"self_citation_contribution":1.4139265942161932,"citation_network_contribution":31.60272025153444,"self_endowment_contribution":1.4139265942161932,"citer_contribution":31.60272025153444,"corpus_percentile":99.4,"corpus_rank":838,"citation_count":12408,"citer_count":199,"citers_with_citation_signal":199,"citers_with_endowment":199,"datacite_reuse_total":0,"is_dataset":false,"is_oa":false,"file_count":0,"downloads":0,"has_version_chain":false,"published_date":"1955-03-01","authors":[{"id":85590,"name":"Harold W. Kuhn","orcid":null,"position":1,"is_corresponding":false}],"reference_count":13,"raw_metadata":{"citation_network_status":"fetched"},"created_at":"2026-03-01T18:20:47.508186Z","pmid":null,"pmcid":null,"fwci":null,"citation_percentile":null,"influential_citations":0,"oa_status":null,"license":null,"views":0,"total_file_size_bytes":0,"version_count":0,"clinical_trials":[],"software_tools":[],"db_accessions":[],"linked_datasets":[],"topics":[]}