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
Parents
100
1–5 of 100
279
5
h-index
United States Air Force Research Laboratory, United States
4 publications · 521 citations
4
h-index
3
h-index
2
h-index
2
h-index
1–5 of 279
162

United States Air Force Research Laboratory
Wright-Patterson AFB, United States
5 h-index
9 publications
1.3K citations
Massachusetts Institute of Technology
Cambridge, United States
4 h-index
7 publications
2.8K citations

Nanjing University of Aeronautics and Astronautics
Nanjing, China
3 h-index
6 publications
210 citations
Dalhousie University
Halifax, Canada
3 h-index
6 publications
374 citations
General Dynamics (United States)
Reston, United States
2 h-index
3 publications
216 citations
University of Connecticut
Storrs, United States
2 h-index
6 publications
249 citations
University of Pennsylvania
Philadelphia, United States
2 h-index
3 publications
232 citations
Columbia University
New York, United States
2 h-index
2 publications
91 citations
1–8 of 162
4 publications · 210 citations
4
h-index
4 publications · 493 citations
4
h-index
3 publications · 183 citations
3
h-index
3 publications · 260 citations
3
h-index
2 publications · 38 citations
2
h-index
1–5