Complete Recourse

Complete Recourse is a property of a stochastic programming problem in which, for every feasible first-stage decision and every realization of the random parameters, there exists a feasible second-stage (recourse) solution that satisfies all constraints.

51

Publications

2.9K

Citations

83

Authors

69

Institutions

Publications per year

2017–2026

14

Authors

83

  1. RJ
    Roger J.‐B. Wets

    University of California, Davis, United States

    6 publications · 346 citations

    6

    h-index

  2. RS
    Rüdiger Schultz

    University of Duisburg-Essen, Germany

    5 publications · 250 citations

    5

    h-index

  3. JR
    John R. Birge

    University of Chicago, United States

    3 publications · 420 citations

    3

    h-index

  4. MH
    Maarten H. van der Vlerk

    University of Groningen, Netherlands

    3 publications · 111 citations

    3

    h-index

  5. RT
    R. T. Rockafellar

    University of Washington, United States

    3 publications · 229 citations

    3

    h-index

1–5 of 83

Venues

  1. Mathematical Programming

    10 publications · 696 citations

    10

    h-index

  2. Operations Research

    6 publications · 729 citations

    6

    h-index

  3. European Journal of Operational Research

    4 publications · 154 citations

    4

    h-index

  4. Annals of Operations Research

    3 publications · 116 citations

    3

    h-index

  5. SIAM Journal on Control and Optimization

    3 publications · 215 citations

    3

    h-index

1–5