Robust Assignment Problem

Robust Assignment Problem is a variant of the classical assignment problem in combinatorial optimization that incorporates uncertainty in cost parameters and seeks an assignment solution which remains feasible and near-optimal under perturbations within a defined uncertainty set.

85

Publications

3.4K

Citations

216

Authors

125

Institutions

Publications per year

2017–2026

24

Authors

216

  1. JP
    Jonathan P. How

    Massachusetts Institute of Technology, United States

    4 publications · 150 citations

    4

    h-index

  2. FW
    Fan Wang

    Sun Yat-sen University, China

    3 publications · 109 citations

    3

    h-index

  3. MA
    Mehdi Alighanbari

    Massachusetts Institute of Technology, United States

    3 publications · 136 citations

    3

    h-index

  4. LF
    Luca F. Bertuccelli

    Massachusetts Institute of Technology, United States

    3 publications · 87 citations

    3

    h-index

  5. AO
    Adam Ouorou

    Orange (France), France

    2 publications · 39 citations

    2

    h-index

1–5 of 216

Venues

  1. Computers & Industrial Engineering

    6 publications · 217 citations

    6

    h-index

  2. Transportation Research Part B Methodological

    4 publications · 217 citations

    4

    h-index

  3. Transportation Science

    4 publications · 388 citations

    4

    h-index

  4. International Journal of Production Research

    4 publications · 116 citations

    4

    h-index

  5. Computers & Operations Research

    3 publications · 109 citations

    3

    h-index

1–5