Generalized Assignment Problem
The Generalized Assignment Problem is a combinatorial optimization problem in which the objective is to assign a set of tasks to a set of agents such that each task is assigned to exactly one agent, each agent’s resource capacity is not exceeded, and the total cost of assignments is minimized, distinguishing it from standard assignment problems by incorporating agent-specific resource constraints and variable assignment costs.
219
Publications
16.2K
Citations
441
Authors
264
Institutions
Publications per year
2017–2026
28
Variants
Gap
Parents
219
1–5 of 219
441
8
h-index
7
h-index
5
h-index
5
h-index
5
h-index
1–5 of 441
264

Kyoto University
Kyoto, Japan
9 h-index
15 publications
853 citations
University of Pennsylvania
Philadelphia, United States
7 h-index
11 publications
2.5K citations

University of Massachusetts Amherst
Amherst Center, United States
6 h-index
8 publications
672 citations
University of Connecticut
Storrs, United States
6 h-index
16 publications
2K citations
University of Colorado Boulder
Boulder, United States
6 h-index
8 publications
953 citations
Tsinghua University
Beijing, China
6 h-index
11 publications
962 citations
Loughborough University
Loughborough, United Kingdom
5 h-index
6 publications
184 citations
KU Leuven
Leuven, Belgium
4 h-index
5 publications
932 citations
1–8 of 264
24 publications · 2.3K citations
21
h-index
9 publications · 1K citations
9
h-index
7 publications · 525 citations
7
h-index
7 publications · 741 citations
7
h-index
6 publications · 648 citations
6
h-index
1–5