Stochastic Combinatorial Optimization with Controllable Risk Aversion Level
暂无分享,去创建一个
[1] Vijay V. Vazirani,et al. Approximation Algorithms , 2001, Springer Berlin Heidelberg.
[2] R. Rockafellar,et al. Conditional Value-at-Risk for General Loss Distributions , 2001 .
[3] R. Ravi,et al. Boosted sampling: approximation algorithms for stochastic optimization , 2004, STOC '04.
[4] Chaitanya Swamy,et al. Stochastic optimization is (almost) as easy as deterministic optimization , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[5] Chaitanya Swamy,et al. Sampling-based approximation algorithms for multi-stage stochastic optimization , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
[6] Vasek Chvátal,et al. A Greedy Heuristic for the Set-Covering Problem , 1979, Math. Oper. Res..
[7] Chaitanya Swamy,et al. An approximation scheme for stochastic linear programming and its application to stochastic integer programs , 2006, JACM.
[8] R. Ravi,et al. An Edge in Time Saves Nine: LP Rounding Approximation Algorithms for Stochastic Network Design , 2004, FOCS.
[9] Alexander Shapiro,et al. On Complexity of Stochastic Programming Problems , 2005 .
[10] W. Hoeffding. Probability Inequalities for sums of Bounded Random Variables , 1963 .
[11] Theodore G. Faticoni,et al. Pure and Applied Mathematics: A Wiley‐Interscience Series of Texts, Monographs and Tracts , 2006 .
[12] J. G. Pierce,et al. Geometric Algorithms and Combinatorial Optimization , 2016 .
[13] Moses Charikar,et al. Sampling Bounds for Stochastic Optimization , 2005, APPROX-RANDOM.
[14] Leen Stougie,et al. The stochastic single resource service‐provision problem , 2003 .
[15] R. Ravi,et al. What About Wednesday? Approximation Algorithms for Multistage Stochastic Optimization , 2005, APPROX-RANDOM.
[16] B ShmoysDavid,et al. An approximation scheme for stochastic linear programming and its application to stochastic integer programs , 2006 .
[17] Yurii Nesterov,et al. Interior-point polynomial algorithms in convex programming , 1994, Siam studies in applied mathematics.
[18] Nicole Immorlica,et al. On the costs and benefits of procrastination: approximation algorithms for stochastic combinatorial optimization problems , 2004, SODA '04.
[19] Vahab S. Mirrokni,et al. Robust Combinatorial Optimization with Exponential Scenarios , 2007, IPCO.
[20] A. Ruszczynski,et al. Optimization of Risk Measures , 2006 .
[21] Mohit Singh,et al. How to pay, come what may: approximation algorithms for demand-robust covering problems , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
[22] Alexander Shapiro,et al. The Sample Average Approximation Method for Stochastic Discrete Optimization , 2002, SIAM J. Optim..
[23] Leslie E. Trotter,et al. Properties of vertex packing and independence system polyhedra , 1974, Math. Program..
[24] E. Beale. ON MINIMIZING A CONVEX FUNCTION SUBJECT TO LINEAR INEQUALITIES , 1955 .
[25] George B. Dantzig,et al. Linear Programming Under Uncertainty , 2004, Manag. Sci..
[26] M. Teboulle,et al. AN OLD‐NEW CONCEPT OF CONVEX RISK MEASURES: THE OPTIMIZED CERTAINTY EQUIVALENT , 2007 .
[27] R. Ravi,et al. Hedging Uncertainty: Approximation Algorithms for Stochastic Optimization Problems , 2004, Math. Program..
[28] R. Ravi,et al. An edge in time saves nine: LP rounding approximation algorithms for stochastic network design , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[29] Éva Tardos,et al. Approximation algorithms for facility location problems (extended abstract) , 1997, STOC '97.