Stochastic combinatorial optimization with controllable risk aversion level

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4110 LNCS, Issue , 2006, Pages 224-235

  So, Anthony Man Cho ^a   Zhang, Jiawei ^b   Ye, Yinyu ^a  

^a Stanford University   (United States)

^b NEW YORK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTER SUPPORTED COOPERATIVE WORK; OPTIMIZATION; PROBABILITY DISTRIBUTIONS; RANDOM PROCESSES;

COMBINATORIAL OPTIMIZATION PROBLEMS; STOCHASTIC PROGRAMMING PROBLEMS; WORST-CASE COSTS;

COMBINATORIAL MATHEMATICS;

EID: 33750076964     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11830924_22     Document Type: Conference Paper

References (15)

1. E. M. L. Beale, On Minimizing a Convex Function Subject to Linear Inequalities, J. Royal Stat. Soc., Ser. B (Methodological) 17(2):173-184, 1955.
2. M. Charikar, C. Chekuri, M. Pál, Sampling Bounds for Stochastic Optimization, Proc. 9th RANDOM, pp. 257-269, 2005.
3. G. B. Dantzig, Linear Programming under Uncertainty, Manag. Sci. 1(3/4):197-206, 1955.
4. K. Dhamdhere, V. Goyal, R. Ravi, M. Singh, How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems, Proc. 46th FOCS, pp. 367-378, 2005.
5. S. Dye, L. Stougie, A. Tomasgard, The Stochastic Single Resource Service-Provision Problem, Naval Research Logistics 50(8):869-887, 2003.
6. A. Gupta, M. Pál, R. Ravi, A. Sinha, Boosted Sampling: Approximation Algorithms for Stochastic Optimization, Proc. 36th STOC, pp. 417-426, 2004.
7. A. Gupta, R. Ravi, A. Sinha, An Edge in Time Saves Nine: LP Rounding Approximation Algorithms for Stochastic Network Design, Proc. 45th FOCS, pp. 218-227, 2004.
8. N. Immorlica, D. Karger, M. Minkoff, V. Mirrokni, On the Costs and Benefits of Procrastination: Approximation Algorithms for Stochastic Combinatorial Optimization Problems, Proc. 15th SODA, pp. 691-700, 2004.
9. A. J. Kleywegt, A. Shapiro, T. Homem-De-Mello, The Sample Average Approximation Method for Stochastic Discrete Optimization, SIAM J. Opt. 12(2):479-502, 2001.
10. P. D. Lax, Functional Analysis, Wiley-Interscience, 2002.
11. R. T. Rockafellar, S. Uryasev, Conditional Value-at-Risk for General Loss Distributions, J. Banking and Finance 26:1443-1471, 2002.
12. R. Ravi, A. Sinha, Hedging Uncertainty: Approximation Algorithms for Stochastic Optimization Problems, Proc. 10th IPCO, pp. 101-115, 2004.
13. A. Ruszczyński, A. Shapiro, Optimization of Risk Measures, in Probabilistic and Randomized Methods for Design under Uncertainty (G. Calafiore and F. Dabbene eds.), Springer-Verlag, 2005.
14. D. B. Shmoys, C. Swamy, Stochastic Optimization is (Almost) as Easy as Deterministic Optimization, Proc. 45th FOGS, pp. 228-237, 2004.
15. D. B. Shmoys, É. Tardos and K. I. Aardal, Approximation Algorithms for Facility Location Problems, Proc. 29th STOC, pp. 265-274, 1997.