Multi-assignment Problem

Multi-Assignment Problem is a variant of the assignment problem in combinatorial optimization where each agent or task may be assigned to multiple roles or destinations, distinguishing it from classical assignment problems by allowing one-to-many or many-to-many mappings under defined constraints.

100

Publications

7.1K

Citations

279

Authors

162

Institutions

Publications per year

2017–2026

29

Authors

279

  1. TS
    Tal Shima

    Technion – Israel Institute of Technology, Israel

    5 publications · 586 citations

    5

    h-index

  2. SJ
    Steven J. Rasmussen

    United States Air Force Research Laboratory, United States

    4 publications · 521 citations

    4

    h-index

  3. AK
    Abdelhakim Khatab

    Dalhousie University, Canada

    3 publications · 165 citations

    3

    h-index

  4. MK
    Mukesh Kumar Mehlawat

    University of Delhi, India

    2 publications · 33 citations

    2

    h-index

  5. KR
    Krishna R. Pattipati

    University of Connecticut, United States

    2 publications · 83 citations

    2

    h-index

1–5 of 279

Venues

  1. IEEE Access

    4 publications · 210 citations

    4

    h-index

  2. Computers & Industrial Engineering

    4 publications · 493 citations

    4

    h-index

  3. International Journal of Production Research

    3 publications · 183 citations

    3

    h-index

  4. Transportation Research Part B Methodological

    3 publications · 260 citations

    3

    h-index

  5. 2

    h-index

1–5