Fetching the paper…
Reading the bibliography…
We consider various stochastic models that incorporate the notion of risk-averseness into the standard 2-stage recourse model, and develop novel techniques for solving the algorithmic problems arising in these models.
Portfolio selection
H. M. Markowitz · 1952
Earlier work this paper cites.
On minimizing a convex function subject to linear inequalities
E. M. L. Beale · 1955
Earlier work this paper cites.
Linear programming under uncertainty
G. B. Dantzig · 1955
Earlier work this paper cites.
Uncertain convex programs: randomized solutions and confidence levels
A. Charnes and W. Cooper · 1959
Earlier work this paper cites.
Probability inequalities for sums of bounded random variables
W. Hoeffding · 1963
Earlier work this paper cites.
Contributions to the theory of stochastic programming
A. Prékopa · 1973
Earlier work this paper cites.
A greedy heuristic for the set-covering problem
V. Chvátal · 1979
Earlier work this paper cites.
Stochastic Programming
A. Prékopa · 1995
Earlier work this paper cites.
Value at Risk: A New Benchmark for Measuring Derivatives Risk
P. Jorion · 1996
Earlier work this paper cites.
Introduction to Stochastic Programming
J. R. Birge and F. V. Louveaux · 1997
Earlier work this paper cites.
Evaluating value at risk methodologies
M. Pritsker · 1997
Earlier work this paper cites.
Approximation algorithms for facility location problems
D. B. Shmoys, É. Tardos, and K. I. Aardal · 1997
Earlier work this paper cites.
The stochastic single resource service-provision problem
S. Dye, L. Stougie, and A. Tomasgard · 1999
Earlier work this paper cites.
Stochastic load balancing
A. Goel and P. Indyk · 1999
Earlier work this paper cites.
Convex Analysis and Nonlinear Optimization
J. Borwein and A. S. Lewis · 2000
Earlier work this paper cites.
Allocating bandwidth for bursty connections
J. Kleinberg, Y. Rabani, and É. Tardos · 2000
Cited alongside, same era.
The sample average approximation method for stochastic discrete optimization
A. J. Kleywegt, A. Shapiro, and T. Homem-De-Mello · 2001
Cited alongside, same era.
On the coherence of expected shortfall
C. Acerbi and D. Tasche · 2002
Cited alongside, same era.
Conditional value-at-risk for general loss distributions
R. Rockafellar and S. Uryasev · 2002
Cited alongside, same era.
Probabilistic programming
A. Prékopa · 2003
Cited alongside, same era.
Editors, Stochastic Programming
A. Ruszczynski and A. Shapiro · 2003
Cited alongside, same era.
Monte Carlo sampling methods
What about Wednesday? Approximation algorithms for multistage stochastic optimization
A. Gupta, M. Pál, R. Ravi, and A. Sinha · 2005
Later among the works it cites.
Network design for information networks
A. Hayrapetyan, C. Swamy, and É. Tardos · 2005
Later among the works it cites.
Scenario approximations of chance constraints
A. Nemirovski and A. Shapiro · 2005
Later among the works it cites.
Optimization of risk measures
A. Ruszczynski and A. Shapiro · 2005
Later among the works it cites.
Sampling-based approximation algorithms for multi-stage stochastic optimization
C. Swamy and D. B. Shmoys · 2005
Later among the works it cites.
The scenario approach to robust control design
G. Calafiore and M. Campi · 2006
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
A. Shapiro · 2003
Cited alongside, same era.
The price of robustness,
D. Bertsimas and M. Sim · 2004
Cited alongside, same era.
Boosted sampling: approximation algorithms for stochastic optimization
A. Gupta, M. Pál, R. Ravi, and A. Sinha · 2004
Cited alongside, same era.
An edge in time saves nine: LP rounding approximation algorithms for stochastic network design
A. Gupta, R. Ravi, and A. Sinha · 2004
Cited alongside, same era.
On the costs and benefits of procrastination: approximation algorithms for stochastic combinatorial optimization problems
N. Immorlica, D. Karger, M. Minkoff, and V. Mirrokni · 2004
Cited alongside, same era.
Stochastic optimization is (almost) as easy as deterministic optimization
D. B. Shmoys and C. Swamy · 2004
Cited alongside, same era.
Pay today for a rainy day: improved approximation algorithms for demand-robust min-cut and shortest path problems
D. Golovin, V. Goyal, and R. Ravi · 2006
Later among the works it cites.
Approximation algorithms for metric facility location problems
M. Mahdian, Y. Ye, and J. Zhang · 2006
Later among the works it cites.
Hedging uncertainty: approximation algorithms for stochastic optimization problems
R. Ravi and A. Sinha · 2006
Later among the works it cites.
An approximation scheme for stochastic linear programming and its application to stochastic integer programs
D. B. Shmoys and C. Swamy · 2006
Later among the works it cites.
Stochastic combinatorial optimization with controllable risk aversion level
A. M-C. So, J. Zhang, and Y. Ye · 2006
Later among the works it cites.
Approximation algorithms for 2-stage stochastic optimization problems
C. Swamy and D. B. Shmoys · 2006
Later among the works it cites.
On two-stage convex chance constrained problems
E. Erdoǧan and G. Iyengar · 2007
Later among the works it cites.
Robust combinatorial optimization with exponential scenarios
U. Feige, K. Jain, M. Mahdian, and V. Mirrokni · 2007
Later among the works it cites.
Approximation algorithms for stochastic and risk-averse optimization
A. Srinivasan · 2007
Later among the works it cites.