One-to-many Assignment Problem

The "One-To-Many Assignment Problem" is a variant of the assignment problem in combinatorial optimization where a single agent is assigned to multiple tasks, distinguishing it from one-to-one or many-to-many assignment models by allowing only one agent to be uniquely associated with a set of tasks.

14

Publications

683

Citations

46

Authors

22

Institutions

Publications per year

2017–2026

7

Authors

46

  1. HZ
    Haibin Zhu

    Nipissing University, Canada

    3 publications · 188 citations

    3

    h-index

  2. XC
    Xiaokang Chen

    Peking University, China

    2 publications · 213 citations

    2

    h-index

  3. QC
    Qiang Chen

    Chinese Academy of Sciences, China

    2 publications · 213 citations

    2

    h-index

  4. SR
    Saeid Rasulkhani

    New York University, United States

    2 publications · 112 citations

    2

    h-index

  5. JY
    Joseph Y.J. Chow

    New York University, United States

    2 publications · 112 citations

    2

    h-index

1–5 of 46

Venues

  1. Transportation Research Part B Methodological

    2 publications · 112 citations

    2

    h-index

  2. Electronic Commerce Research and Applications

    1 publications · 41 citations

    1

    h-index

  3. Defence Technology

    1 publications · 22 citations

    1

    h-index

  4. arXiv (Cornell University)

    Repository · 1 publications · 19 citations

    1

    h-index

  5. 1

    h-index

1–5