Dynamic Assignment Problem is a type of assignment problem in operations research where the set of tasks and agents, along with their associated costs or preferences, may change over time, requiring adaptive re-optimization of assignments in contrast to static counterparts.
367
Publications
17.4K
Citations
848
Authors
392
Institutions
Publications per year
2017–2026
79
Parents
Publications
367
1–5 of 367
Authors
848
- HS
10
h-index
- MC
8
h-index
- WS
6
h-index
- ST
6
h-index
- MW
5
h-index
1–5 of 848
Institutions
392
The University of Texas at Austin
Austin, United States
12 h-index
24 publications
1.2K citations
Delft University of Technology
Delft, The Netherlands
10 h-index
21 publications
979 citations
Purdue University West Lafayette
West Lafayette, United States
10 h-index
22 publications
1.4K citations
Massachusetts Institute of Technology
Cambridge, United States
9 h-index
19 publications
813 citations
Northwestern University
Evanston, United States
8 h-index
13 publications
456 citations
University of California, Davis
Davis, United States
7 h-index
14 publications
684 citations
Carnegie Mellon University
Pittsburgh, United States
7 h-index
11 publications
573 citations
University of Hong Kong
Pok Fu Lam, Hong Kong
7 h-index
13 publications
505 citations
1–8 of 392
Venues
- Transportation Research Record Journal of the Transportation Research Board
TRR · 41 publications · 1.4K citations
23
h-index
- Transportation Research Part B Methodological
27 publications · 2.4K citations
21
h-index
- Transportation Science
12 publications · 1.9K citations
11
h-index
- European Journal of Operational Research
9 publications · 259 citations
9
h-index
- Computer-Aided Civil and Infrastructure Engineering
CACAIE · 9 publications · 306 citations
9
h-index
1–5