Assignment Problems

Assignment Problems is a combinatorial optimization problem in operations research wherein the objective is to allocate a set of agents to a set of tasks in a one-to-one manner such that the total cost of assignment is minimized or total effectiveness is maximized, distinguished from other network flow problems by its focus on bijective correspondence and binary decision variables.

6.2K

Publications

398K

Citations

11.1K

Authors

2.5K

Institutions

Publications per year

2017–2026

1.3K

Authors

11.1K

  1. PT
    Paolo Toth

    University of Bologna, Italy

    26 publications · 2K citations

    23

    h-index

  2. GL
    Gilbert Laporte

    HEC Montréal, Canada

    25 publications · 2.9K citations

    22

    h-index

  3. HZ
    Haibin Zhu

    Nipissing University, Canada

    21 publications · 1.4K citations

    20

    h-index

  4. FG
    Fred Glover

    University of Colorado Boulder, United States

    19 publications · 1.7K citations

    19

    h-index

  5. HD
    Hanif D. Sherali

    Virginia Tech, United States

    22 publications · 1.1K citations

    18

    h-index

1–5 of 11.1K

Venues

  1. European Journal of Operational Research

    372 publications · 25.9K citations

    85

    h-index

  2. Operations Research

    132 publications · 15.5K citations

    67

    h-index

  3. Transportation Science

    129 publications · 13K citations

    64

    h-index

  4. Computers & Operations Research

    208 publications · 12.4K citations

    58

    h-index

  5. Transportation Research Part B Methodological

    142 publications · 10.9K citations

    56

    h-index

1–5