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

Authors

254

  1. AC
    Anthony Chen

    Utah State University, United States

    3 publications · 82 citations

    3

    h-index

  2. FS
    Frits Spieksma

    KU Leuven, Belgium

    3 publications · 127 citations

    3

    h-index

  3. SR
    Socorro Rangel

    Universidade Estadual Paulista (Unesp), Brazil

    2 publications · 48 citations

    2

    h-index

  4. GL
    Gilbert Laporte

    HEC Montréal, Canada

    2 publications · 67 citations

    2

    h-index

  5. DL
    Dung‐Ying Lin

    National Cheng Kung University, Taiwan

    2 publications · 107 citations

    2

    h-index

1–5 of 254

Venues

  1. European Journal of Operational Research

    22 publications · 1.7K citations

    18

    h-index

  2. Transportation Research Part B Methodological

    7 publications · 218 citations

    7

    h-index

  3. Computers & Operations Research

    6 publications · 367 citations

    6

    h-index

  4. Annals of Operations Research

    5 publications · 144 citations

    5

    h-index

  5. Mathematical Programming

    5 publications · 343 citations

    5

    h-index

1–5