Approximation algorithms for reliable stochastic combinatorial optimization

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

Volumn 6302 LNCS, Issue , 2010, Pages 338-351

  Nikolova, Evdokia ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Approximation algorithms; mean risk; nonconvex optimization; nonlinear programming; reliable optimization; risk; stochastic optimization

Indexed keywords

EID: 78149337902     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15369-3_26     Document Type: Conference Paper

References (39)

1. Ackermann, H., Newman, A., Röglin, H., Vöcking, B.: Decision making based on approximate and smoothed pareto curves. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol. 3827, pp. 675-684. Springer, Heidelberg (2005) (Pubitemid 43856294)
2. Atamtürk, A., Narayanan, V.: Polymatroids and risk minimization in discrete optimization. Operations Research Letters 36, 618-622 (2008)
3. Berstein, Y., Lee, J., Onn, S., Weismantel, R.: Nonlinear optimization for matroid intersection and extensions. Manuscript at arXiv:0807.3907 (2008)
4. Bertsekas, D., Nedić, A., Ozdaglar, A.: Convex Analysis and Optimization. Athena Scientific, Belmont (2003)
5. Bertsimas, D., Brown, D., Caramanis, C.: Theory and applications of robust optimization (2007) (manuscript)
6. Bertsimas, D., Sim, M.: Robust discrete optimization and network flows (2004) (manuscript)
7. Chen, A., Ji, Z.: Path finding under uncertainty. Journal of advanced transportation 39(1), 19-37 (2005)
8. Dean, B., Goemans, M.X., Vondrák, J.: Approximating the stochastic knapsack: the benefit of adaptivity. In: Proceedings of the 45th Annual Symposium on Foundations of Computer Science, pp. 208-217 (2004)
9. Fan, Y., Kalaba, R., Moore, I.J.E.: Arriving on time. Journal of Optimization Theory and Applications 127(3), 497-513 (2005)
10. Federal Highway Administration: Traffic Congestion and Reliability: Trends and advanced strategies for congestion mitigation. Cambridge Systematics Inc., Texas Transportation Institute (2005)
11. Föllmer, H., Schied, A.: Stochastic Finance: An Introduction in Discrete Time. Walter de Gruyter, Berlin (2004)
12. Ghaoui, L.E., Oks, M., Oustry, F.: Worst-case value-at-risk and robust portfolio optimization: A conic programming approach. Oper. Res. 51(4), 543-556 (2003)
13. Goel, A., Indyk, P.: Stochastic load balancing and related problems. In: Proceedings of the 40th Symposium on Foundations of Computer Science (1999)
14. Goyal, V.: An FPTAS for minimizing a class of quasi-concave functions over a convex set. Technical Report Tepper WP 2008-E24, Carnegie Mellon University Tepper School of Business (2008)
15. Grimmett, G., Stirzaker, D.: Probability and Random Processes, 3rd edn. Oxford Univ. Press, Oxford (2001)
16. Gupta, A., Pál, M., Ravi, R., Sinha, A.: Boosted sampling: approximation algorithms for stochastic optimization. In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing, Chicago, IL, USA, pp. 365-372 (2004)
17. Gupta, A., Pál, M., Ravi, R., Sinha, A.: What about Wednesday? Approximation algorithms for multistage stochastic optimization. In: Chekuri, C., Jansen, K., Rolim, J.D.P., Trevisan, L. (eds.) APPROX 2005 and RANDOM 2005. LNCS, vol. 3624, pp. 86-98. Springer, Heidelberg (2005) (Pubitemid 41480426)
18. Immorlica, N., Karger, D., Minkoff, M., Mirrokni, V.S.: On the costs and benefits of procrastination: approximation algorithms for stochastic combinatorial optimization problems. In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 691-700 (2004)
19. Kakade, S.M., Kalai, A.T., Ligett, K.: Playing games with approximation algorithms. In: STOC 2007: Proceedings of the Thirty-Ninth Annual ACM Symposium on Theory of Computing, pp. 546-555. ACM, New York (2007)
20. Kalai, A., Vempala, S.: Efficient algorithms for on-line optimization. Journal of Computer and System Sciences 71, 291-307 (2005)
21. Katriel, I., Kenyon-Mathieu, C., Upfal, E.: Commitment under uncertainty: Two-stage stochastic matching problems. Theor. Comput. Sci. 408(2-3), 213-223 (2008)
22. Kelner, J.A., Nikolova, E.: On the hardness and smoothed complexity of quasi-concave minimization. In: Proceedings of the 48th Annual Symposium on Foundations of Computer Science, Providence, RI, USA (2007)
23. Kleinberg, J., Rabani, Y., Tardos, É.: Allocating bandwidth for bursty connections. SIAM Journal on Computing 30(1), 191-217 (2000)
24. Nie, Y(M.), Xing, W.: Shortest path problem considering on-time arrival probability. Transportation Research Part B: Methodological 43(6), 597-613 (2009)
25. Markowitz, H.M.: Mean-Variance Analysis in Portfolio Choice and Capital Markets. Basil Blackwell, Cambridge (1987)
26. Megiddo, N.: Combinatorial optimization with rational objective functions. Mathematics of Operations Research 4, 414-424 (1979)
27. Miller-Hooks, E., Mahmassani, H.: Path comparisons for a priori and time-adaptive decisions in stochastic, time-varying networks. European Journal of Operational Research 146(1), 67-82 (2003)
28. Nemirovski, A., Shapiro, A.: Convex approximations of chance constrained programs. SIAM Journal on Optimization 17(4), 969-996 (2006)
29. Nikolova, E., Kelner, J.A., Brand, M., Mitzenmacher, M.: Stochastic shortest paths via quasi-convex maximization. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol. 4168, pp. 552-563. Springer, Heidelberg (2006) (Pubitemid 44699679)
30. Onn, S.: Convex discrete optimization. Encyclopedia of Optimization, 513-550 (2009)
31. Papadimitriou, C.H., Yannakakis, M.: On the approximability of trade-offs and optimal access of web sources. In: Proceedings of the 41st Annual Symposium on Foundations of Computer Science, Washington, DC, USA, pp. 86-92 (2000)
32. Radzik, T.: Newton's method for fractional combinatorial optimization. In: Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, pp. 659-669 (1992)
33. Rockafellar, R.T.: Coherent approaches to risk in optimization under uncertainty. In: Tutorials in Operations Research INFORMS, pp. 38-61 (2007)
34. Safer, H., Orlin, J.B., Dror, M.: Fully polynomial approximation in multi-criteria combinatorial optimization. MIT Working Paper (February 2004)
35. Shmoys, D.B., Swamy, C.: An approximation scheme for stochastic linear programming and its application to stochastic integer programs. Journal of the ACM 53(6), 978-1012 (2006)
36. Sigal, C.E., Pritsker, A.A.B., Solberg, J.J.: The stochastic shortest route problem. Operations Research 28(5), 1122-1129 (1980)
37. Srinivasan, A.: Approximation algorithms for stochastic and risk-averse optimization. In: SODA 2007: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, Philadelphia, PA, USA, pp. 1305-1313 (2007)
38. Swamy, C., Shmoys, D.B.: Approximation algorithms for 2-stage stochastic optimization problems. ACM SIGACT News 37(1), 33-46 (2006)
39. Warburton, A.: Approximation of pareto optima in multiple-objective, shortest-path problems. Oper. Res. 35(1), 70-79 (1987)