Robust Assignment Problem
Robust Assignment Problem is a variant of the classical assignment problem in combinatorial optimization that incorporates uncertainty in cost parameters and seeks an assignment solution which remains feasible and near-optimal under perturbations within a defined uncertainty set.
85
Publications
3.4K
Citations
216
Authors
125
Institutions
Publications per year
2017–2026
24
Parents
85
Yongbo Chen, Di Yang, Jianqiao Yu · IEEE Transactions on Aerospace and Electronic Systems · 2018 · 162 citations · Full text
1–5 of 85
216
4
h-index
3
h-index
3
h-index
Massachusetts Institute of Technology, United States
3 publications · 87 citations
3
h-index
2
h-index
1–5 of 216
125
Georgia Institute of Technology
Atlanta, United States
5 h-index
8 publications
490 citations
Massachusetts Institute of Technology
Cambridge, United States
5 h-index
11 publications
406 citations

University of Hong Kong
Pok Fu Lam, Hong Kong
4 h-index
8 publications
329 citations

Beijing Institute of Technology
Beijing, China
4 h-index
7 publications
432 citations

City University of Hong Kong
Hong Kong, Hong Kong
3 h-index
6 publications
138 citations
Civil Aviation University of China
Tianjin, China
3 h-index
6 publications
132 citations

Hong Kong University of Science and Technology
Hong Kong, Hong Kong
3 h-index
5 publications
189 citations

Tungnan University
Taipei, Taiwan
2 h-index
2 publications
33 citations
1–8 of 125
6 publications · 217 citations
6
h-index
4 publications · 217 citations
4
h-index
4 publications · 388 citations
4
h-index
4 publications · 116 citations
4
h-index
3 publications · 109 citations
3
h-index
1–5