Stochastic Assignment Problem
The Stochastic Assignment Problem is a variant of the classical assignment problem in combinatorial optimization where the assignment costs or task parameters are modeled as random variables, thereby requiring the optimization of expected outcomes or probabilistic performance criteria under uncertainty.
154
Publications
8.2K
Citations
326
Authors
185
Institutions
Publications per year
2017–2026
28
Parents
154
1–5 of 154
326
7
h-index
5
h-index
5
h-index
4
h-index
4
h-index
1–5 of 326
185
Columbia University
New York, United States
6 h-index
7 publications
724 citations
Stanford University
Stanford, United States
6 h-index
7 publications
559 citations
University of California, Berkeley
Berkeley, United States
6 h-index
8 publications
464 citations

University of Salerno
Fisciano, Italy
5 h-index
10 publications
216 citations
Massachusetts Institute of Technology
Cambridge, United States
5 h-index
6 publications
912 citations
Technion – Israel Institute of Technology
Haifa, Israel
5 h-index
8 publications
431 citations
University of Illinois Urbana-Champaign
Urbana, United States
4 h-index
8 publications
254 citations

University of Messina
Messina, Italy
4 h-index
4 publications
62 citations
1–8 of 185
18 publications · 2K citations
17
h-index
TRR · 9 publications · 313 citations
9
h-index
8 publications · 1.2K citations
8
h-index
8 publications · 408 citations
8
h-index
5 publications · 251 citations
5
h-index
1–5