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

Authors

441

  1. TI
    Toshihide Ibaraki

    Kyoto University, Japan

    8 publications · 494 citations

    8

    h-index

  2. MY
    Mutsunori Yagiura

    Kyoto University, Japan

    7 publications · 460 citations

    7

    h-index

  3. FG
    Fred Glover

    University of Colorado Boulder, United States

    5 publications · 550 citations

    5

    h-index

  4. JB
    Joseph B. Mazzola

    Duke University, United States

    5 publications · 163 citations

    5

    h-index

  5. JW
    John Wilson

    Loughborough University, United Kingdom

    5 publications · 170 citations

    5

    h-index

1–5 of 441

Venues

  1. European Journal of Operational Research

    24 publications · 2.3K citations

    21

    h-index

  2. Management Science

    9 publications · 1K citations

    9

    h-index

  3. INFORMS journal on computing

    7 publications · 525 citations

    7

    h-index

  4. Computers & Operations Research

    7 publications · 741 citations

    7

    h-index

  5. Operations Research

    6 publications · 648 citations

    6

    h-index

1–5