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
Parents
30
Sparse R-CNN: End-to-End Object Detection with Learnable Proposals
Peize Sun, Rufeng Zhang, Yi Jiang et al. · 2021 · 1.4K citations
Group DETR: Fast DETR Training with Group-Wise One-to-Many Assignment
Qiang Chen, Xiaokang Chen, Jian Wang et al. · 2023 · 194 citations
Sparse R-CNN: End-to-End Object Detection with Learnable Proposals
Peize Sun, Rufeng Zhang, Yi Jiang et al. · arXiv (Cornell University) · 2020 · 103 citations · Full text
1–5 of 30
90
4
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 90
44

Nipissing University
North Bay, Canada
4 h-index
4 publications
222 citations
Toyohashi University of Technology
Toyohashi, Japan
2 h-index
2 publications
195 citations
New York University
New York, United States
2 h-index
4 publications
224 citations
Wuhan University
Wuhan, China
2 h-index
2 publications
45 citations
Guangdong University of Technology
Guangzhou, China
2 h-index
6 publications
459 citations
Tongji University
Shanghai, China
2 h-index
2 publications
1.5K citations

University of Hong Kong
Pok Fu Lam, Hong Kong
2 h-index
9 publications
3K citations
Northwest University
Xi'an, China
2 h-index
4 publications
81 citations
1–8 of 44
5 publications · 348 citations
5
h-index
Repository · 2 publications · 122 citations
2
h-index
2 publications · 70 citations
2
h-index
Repository · 1 publications · 13 citations
1
h-index
1 publications · 36 citations
1
h-index
1–5