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
Parents
51
A Linear Decision-Based Approximation Approach to Stochastic Programming
Xin Chen, Melvyn Sim, Peng Sun et al. · Operations Research · 2007 · 256 citations
Daniel Zhuoyu Long, Melvyn Sim, Minglong Zhou · Operations Research · 2022 · 108 citations
1–5 of 51
83
6
h-index
5
h-index
3
h-index
3
h-index
3
h-index
1–5 of 83
69
University of Michigan
Ann Arbor, United States
4 h-index
5 publications
490 citations
University of California, Davis
Davis, United States
3 h-index
3 publications
117 citations

University of Groningen
Groningen, The Netherlands
3 h-index
3 publications
111 citations
The University of Texas at Austin
Austin, United States
3 h-index
3 publications
333 citations
Massachusetts Institute of Technology
Cambridge, United States
3 h-index
3 publications
83 citations
Technion – Israel Institute of Technology
Haifa, Israel
2 h-index
2 publications
54 citations

Zuse Institute Berlin
Berlin, Germany
2 h-index
2 publications
107 citations
University of Illinois Urbana-Champaign
Urbana, United States
2 h-index
3 publications
296 citations
1–8 of 69
10 publications · 696 citations
10
h-index
6 publications · 729 citations
6
h-index
4 publications · 154 citations
4
h-index
3 publications · 116 citations
3
h-index
3 publications · 215 citations
3
h-index
1–5