著者: Harold W. Kuhn - 50 Years of Integer Programming 1958-2008 1955 被引用: 12,574
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.
✨ ログイン状態を確認しています… PDF 被引用 BibTeX を表示 BibTeX を閉じる BibTeX を表示 引用
Über Graphen und ihre Anwendung auf… Über Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre On Representatives of Subsets On Representatives of Subsets A Combinatorial Algorithm A Combinatorial Algorithm Application of the simplex method to a… Application of the simplex method to a transportation problem Solution of the Personnel Classificatio… Solution of the Personnel Classification Problem with the Method of Optimal Regions A Personnel Assignment Problem A Personnel Assignment Problem History of mathematical programming, a… History of mathematical programming, a collection of personal reminiscences Combinatorial optimization. Polyhedra… Combinatorial optimization. Polyhedra and efficiency. Matrix reduction using the Hungarian method fo… Matrix reduction using the Hungarian method for the generation of school timetables On multi-robot task allocation On multi-robot task allocation Unsupervised Learning and Clustering Unsupervised Learning and Clustering Detection driven adaptive multi-cue… Detection driven adaptive multi-cue integration for multiple human tracking Data Fusion: Concepts and Ideas Data Fusion: Concepts and Ideas Energy Efficient Resource Allocation for… Energy Efficient Resource Allocation for Multiuser Relay Networks Malware Detection in Adversarial Settings… Malware Detection in Adversarial Settings: Exploiting Feature Evolutions and Confusions in Android Apps Control principles for complex biological… Control principles for complex biological networks SimAlign: High Quality Word Alignments without… SimAlign: High Quality Word Alignments without Parallel Training Data using Static and Contextualized Embeddings Updates-Leak: Data Set Inference and… Updates-Leak: Data Set Inference and Reconstruction Attacks in Online Learning A Sequence-to-Set Network for Nested Name… A Sequence-to-Set Network for Nested Named Entity Recognition From Alignment to Assignment… From Alignment to Assignment: Frustratingly Simple Unsupervised Entity Alignment The Hungarian Method for the Assignment Problem The Hungarian Method for the Assignment Problem 過去の参考文献 中心の論文 この論文を引用する論文 古い 新しい ノードをクリックするとフォーカスを固定、空白をクリックすると本論文に戻ります。ホバーで一時的にプレビューできます。各ノードのページはタイトルから開けます。
