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
Parents
14
Group DETR: Fast DETR Training with Group-Wise One-to-Many Assignment
Qiang Chen, Xiaokang Chen, Jian Wang et al. · 2023 · 194 citations
Theodoros P. Pantelidis, Joseph Y.J. Chow, Saeid Rasulkhani · Transportation Research Part B Methodological · 2020 · 49 citations · Full text
1–5 of 14
46
3
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 46
22

Nipissing University
North Bay, Canada
3 h-index
3 publications
188 citations
Guangdong University of Technology
Guangzhou, China
2 h-index
6 publications
459 citations
University Transportation Research Center
New York, United States
2 h-index
4 publications
224 citations
New York University
New York, United States
2 h-index
4 publications
224 citations
IBM (United States)
Armonk, United States
1 h-index
2 publications
34 citations
Universidade Estadual Paulista (Unesp)
São Paulo, Brazil
1 h-index
1 publications
26 citations

Northwestern Polytechnical University
Xi'an, China
1 h-index
2 publications
44 citations

Victoria University
Melbourne, Australia
1 h-index
1 publications
117 citations
1–8 of 22
2 publications · 112 citations
2
h-index
1 publications · 41 citations
1
h-index
1 publications · 22 citations
1
h-index
Repository · 1 publications · 19 citations
1
h-index
1 publications · 35 citations
1
h-index
1–5