{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T13:51:44Z","timestamp":1725889904853},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540380443"},{"type":"electronic","value":"9783540380450"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11830924_22","type":"book-chapter","created":{"date-parts":[[2006,8,25]],"date-time":"2006-08-25T12:33:54Z","timestamp":1156509234000},"page":"224-235","source":"Crossref","is-referenced-by-count":2,"title":["Stochastic Combinatorial Optimization with Controllable Risk Aversion Level"],"prefix":"10.1007","author":[{"given":"Anthony Man\u2013Cho","family":"So","sequence":"first","affiliation":[]},{"given":"Jiawei","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Yinyu","family":"Ye","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"22_CR1","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1111\/j.2517-6161.1955.tb00191.x","volume":"17","author":"E.M.L. Beale","year":"1955","unstructured":"Beale, E.M.L.: On Minimizing a Convex Function Subject to Linear Inequalities. J.\u00a0Royal Stat.\u00a0Soc., Ser.\u00a0B (Methodological)\u00a017(2), 173\u2013184 (1955)","journal-title":"J.\u00a0Royal Stat.\u00a0Soc., Ser.\u00a0B (Methodological)"},{"key":"22_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/11538462_22","volume-title":"Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques","author":"M. Charikar","year":"2005","unstructured":"Charikar, M., Chekuri, C., P\u00e1l, M.: Sampling Bounds for Stochastic Optimization. In: Chekuri, C., Jansen, K., Rolim, J.D.P., Trevisan, L. (eds.) APPROX 2005 and RANDOM 2005. LNCS, vol.\u00a03624, pp. 257\u2013269. Springer, Heidelberg (2005)"},{"issue":"3\/4","key":"22_CR3","first-page":"197","volume":"1","author":"G.B. Dantzig","year":"1955","unstructured":"Dantzig, G.B.: Linear Programming under Uncertainty. Manag.\u00a0Sci.\u00a01(3\/4), 197\u2013206 (1955)","journal-title":"Manag.\u00a0Sci."},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"Dhamdhere, K., Goyal, V., Ravi, R., Singh, M.: How to Pay, Come What May: Approximation Algorithms for Demand\u2013Robust Covering Problems. In: Proc.\u00a046th FOCS, pp. 367\u2013378 (2005)","DOI":"10.1109\/SFCS.2005.42"},{"issue":"8","key":"22_CR5","doi-asserted-by":"publisher","first-page":"869","DOI":"10.1002\/nav.10092","volume":"50","author":"S. Dye","year":"2003","unstructured":"Dye, S., Stougie, L., Tomasgard, A.: The Stochastic Single Resource Service\u2013Provision Problem. Naval Research Logistics\u00a050(8), 869\u2013887 (2003)","journal-title":"Naval Research Logistics"},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"Gupta, A., P\u00e1l, M., Ravi, R., Sinha, A.: Boosted Sampling: Approximation Algorithms for Stochastic Optimization. In: Proc.\u00a036th STOC, pp. 417\u2013426 (2004)","DOI":"10.1145\/1007352.1007419"},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"Gupta, A., Ravi, R., Sinha, A.: An Edge in Time Saves Nine: LP Rounding Approximation Algorithms for Stochastic Network Design. In: Proc.\u00a045th FOCS, pp. 218\u2013227 (2004)","DOI":"10.1109\/FOCS.2004.11"},{"key":"22_CR8","unstructured":"Immorlica, N., Karger, D., Minkoff, M., Mirrokni, V.: On the Costs and Benefits of Procrastination: Approximation Algorithms for Stochastic Combinatorial Optimization Problems. In: Proc.\u00a015th SODA, pp. 691\u2013700 (2004)"},{"issue":"2","key":"22_CR9","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1137\/S1052623499363220","volume":"12","author":"A.J. Kleywegt","year":"2001","unstructured":"Kleywegt, A.J., Shapiro, A., Homem\u2013De\u2013Mello, T.: The Sample Average Approximation Method for Stochastic Discrete Optimization. SIAM J.\u00a0Opt.\u00a012(2), 479\u2013502 (2001)","journal-title":"SIAM J.\u00a0Opt."},{"key":"22_CR10","volume-title":"Functional Analysis","author":"P.D. Lax","year":"2002","unstructured":"Lax, P.D.: Functional Analysis. Wiley\u2013Interscience, Chichester (2002)"},{"key":"22_CR11","doi-asserted-by":"publisher","first-page":"1443","DOI":"10.1016\/S0378-4266(02)00271-6","volume":"26","author":"R.T. Rockafellar","year":"2002","unstructured":"Rockafellar, R.T., Uryasev, S.: Conditional Value\u2013at\u2013Risk for General Loss Distributions. J.\u00a0Banking and Finance\u00a026, 1443\u20131471 (2002)","journal-title":"J.\u00a0Banking and Finance"},{"key":"22_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/978-3-540-25960-2_8","volume-title":"Integer Programming and Combinatorial Optimization","author":"R. Ravi","year":"2004","unstructured":"Ravi, R., Sinha, A.: Hedging Uncertainty: Approximation Algorithms for Stochastic Optimization Problems. In: Bienstock, D., Nemhauser, G.L. (eds.) IPCO 2004. LNCS, vol.\u00a03064, pp. 101\u2013115. Springer, Heidelberg (2004)"},{"key":"22_CR13","volume-title":"Probabilistic and Randomized Methods for Design under Uncertainty","author":"A. Ruszczy\u0144ski","year":"2005","unstructured":"Ruszczy\u0144ski, A., Shapiro, A.: Optimization of Risk Measures. In: Calafiore, G., Dabbene, F. (eds.) Probabilistic and Randomized Methods for Design under Uncertainty. Springer, Heidelberg (2005)"},{"key":"22_CR14","doi-asserted-by":"crossref","unstructured":"Shmoys, D.B., Swamy, C.: Stochastic Optimization is (Almost) as Easy as Deterministic Optimization. In: Proc.\u00a045th FOCS, pp. 228\u2013237 (2004)","DOI":"10.1109\/FOCS.2004.62"},{"key":"22_CR15","doi-asserted-by":"crossref","unstructured":"Shmoys, D.B., Tardos, \u00c9., Aardal, K.I.: Approximation Algorithms for Facility Location Problems. In: Proc.\u00a029th STOC, pp. 265\u2013274 (1997)","DOI":"10.1145\/258533.258600"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11830924_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:18:30Z","timestamp":1605644310000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11830924_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540380443","9783540380450"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11830924_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}