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

Authors

326

  1. GE
    Giulio Erberto Cantarella

    University of Salerno, Italy

    7 publications · 396 citations

    7

    h-index

  2. MM
    Mike Maher

    University of Leeds, United Kingdom

    5 publications · 182 citations

    5

    h-index

  3. DW
    David Watling

    University of Leeds, United Kingdom

    5 publications · 371 citations

    5

    h-index

  4. JN
    Joseph N. Prashker

    Technion – Israel Institute of Technology, Israel

    4 publications · 230 citations

    4

    h-index

  5. MD
    Massimo Di Gangi

    University of Messina, Italy

    4 publications · 62 citations

    4

    h-index

1–5 of 326

Venues

  1. Transportation Research Part B Methodological

    18 publications · 2K citations

    17

    h-index

  2. 9

    h-index

  3. Transportation Science

    8 publications · 1.2K citations

    8

    h-index

  4. Operations Research

    8 publications · 408 citations

    8

    h-index

  5. European Journal of Operational Research

    5 publications · 251 citations

    5

    h-index

1–5