Classical Assignment Problem
The Classical Assignment Problem is a combinatorial optimization problem in assignment theory that seeks to uniquely pair a set of agents with a set of tasks such that the total cost of assignment is minimized, typically under the condition that each agent is assigned to exactly one task and each task is assigned to exactly one agent.
37
Publications
2.1K
Citations
98
Authors
62
Institutions
Publications per year
2017–2026
3
Parents
37
MULTIDIMENSIONAL ASSIGNMENT PROBLEMS
Kenneth Gilbert, Ruth B. Hofstra · Decision Sciences · 1988 · 127 citations
1–5 of 37
98
2
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 98
62
Massachusetts Institute of Technology
Cambridge, United States
3 h-index
5 publications
397 citations
Stanford University
Stanford, United States
2 h-index
4 publications
118 citations

KTH Royal Institute of Technology
Stockholm, Sweden
2 h-index
3 publications
130 citations

University of Hong Kong
Pok Fu Lam, Hong Kong
2 h-index
3 publications
73 citations

Zhejiang University
Hangzhou, China
2 h-index
2 publications
55 citations

Iran University of Science and Technology
Tehran, Iran
2 h-index
4 publications
74 citations

Zhejiang University of Technology
Hangzhou, China
2 h-index
9 publications
232 citations
IBM (United States)
Armonk, United States
1 h-index
1 publications
19 citations
1–8 of 62
1 publications · 200 citations
1
h-index
1 publications · 19 citations
1
h-index
1 publications · 20 citations
1
h-index
1 publications · 16 citations
1
h-index
1 publications · 21 citations
1
h-index
1–5