Many-to-one Assignment Problem

The "Many-To-One Assignment Problem" is a variant of the assignment problem in combinatorial optimization where multiple agents are assigned to a single task or resource, distinguishing it from one-to-one or many-to-many assignment models by enforcing a unidirectional consolidation of assignments.

30

Publications

2.7K

Citations

90

Authors

44

Institutions

Publications per year

2017–2026

15

Authors

90

  1. HZ
    Haibin Zhu

    Nipissing University, Canada

    4 publications · 222 citations

    4

    h-index

  2. BL
    Baochun Li

    University of Toronto, Canada

    2 publications · 45 citations

    2

    h-index

  3. QC
    Qiang Chen

    Chinese Academy of Sciences, China

    2 publications · 213 citations

    2

    h-index

  4. YJ
    Yi Jiang

    University of Hong Kong, Hong Kong SAR China

    2 publications · 1.5K citations

    2

    h-index

  5. WZ
    Wei Zhan

    University of California, Berkeley, United States

    2 publications · 1.5K citations

    2

    h-index

1–5 of 90

Venues

  1. Transportation Research Part B Methodological

    5 publications · 348 citations

    5

    h-index

  2. arXiv (Cornell University)

    Repository · 2 publications · 122 citations

    2

    h-index

  3. 2

    h-index

  4. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)

    Repository · 1 publications · 13 citations

    1

    h-index

  5. International Journal of Intelligent Systems

    1 publications · 36 citations

    1

    h-index

1–5