Assignment Problems
Assignment Problems is a combinatorial optimization problem in operations research wherein the objective is to allocate a set of agents to a set of tasks in a one-to-one manner such that the total cost of assignment is minimized or total effectiveness is maximized, distinguished from other network flow problems by its focus on bijective correspondence and binary decision variables.
6.2K
Publications
398K
Citations
11.1K
Authors
2.5K
Institutions
Publications per year
2017–2026
1.3K
Variants
Assignment Problem
Parents
6.2K
The Hungarian method for the assignment problem
Harold W. Kuhn · Naval Research Logistics Quarterly · 1955 · 12.6K citations
George B. Dantzig, J. H. Ramser · Management Science · 1959 · 4.9K citations
1–5 of 6.2K
11.1K
23
h-index
22
h-index
20
h-index
19
h-index
18
h-index
1–5 of 11.1K
2.5K
Massachusetts Institute of Technology
Cambridge, United States
51 h-index
162 publications
15.6K citations
Georgia Institute of Technology
Atlanta, United States
42 h-index
122 publications
12.2K citations

University of Bologna
Bologna, Italy
38 h-index
109 publications
21.1K citations

Centre National de la Recherche Scientifique
Paris, France
37 h-index
186 publications
12.6K citations
Université de Montréal
Montreal, Canada
37 h-index
90 publications
9.2K citations

Hong Kong University of Science and Technology
Hong Kong, Hong Kong
36 h-index
116 publications
8.4K citations
Carnegie Mellon University
Pittsburgh, United States
35 h-index
103 publications
6.8K citations

University of Hong Kong
Pok Fu Lam, Hong Kong
35 h-index
100 publications
5.5K citations
1–8 of 2.5K
372 publications · 25.9K citations
85
h-index
132 publications · 15.5K citations
67
h-index
129 publications · 13K citations
64
h-index
208 publications · 12.4K citations
58
h-index
142 publications · 10.9K citations
56
h-index
1–5