Capacitated Assignment Problem
The Capacitated Assignment Problem is a variant of the assignment problem in combinatorial optimization where each agent and task has a capacity constraint that limits the number or amount of tasks an agent can perform or be assigned, distinguishing it from standard assignment problems by incorporating upper bounds on assignment loads.
112
Publications
6.1K
Citations
254
Authors
165
Institutions
Publications per year
2017–2026
17
Parents
112
Theoretical Approaches to Node Assignment
David G. Andersen · Figshare · 2018 · 279 citations · Full text
1–5 of 112
254
3
h-index
3
h-index
2
h-index
2
h-index
2
h-index
1–5 of 254
165
AT&T (United States)
Bedminster, United States
4 h-index
4 publications
147 citations
National Cheng Kung University
Tainan City, Taiwan
3 h-index
5 publications
254 citations
Carnegie Mellon University
Pittsburgh, United States
3 h-index
3 publications
375 citations

Utah State University
Logan, United States
3 h-index
6 publications
176 citations

University of Rochester
Rochester, United States
2 h-index
2 publications
59 citations

University of Amsterdam
Amsterdam, The Netherlands
2 h-index
2 publications
71 citations
HEC Montréal
Montreal, Canada
2 h-index
6 publications
201 citations
University of Bonn
Bonn, Germany
2 h-index
2 publications
59 citations
1–8 of 165
22 publications · 1.7K citations
18
h-index
7 publications · 218 citations
7
h-index
6 publications · 367 citations
6
h-index
5 publications · 144 citations
5
h-index
5 publications · 343 citations
5
h-index
1–5