{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,30]],"date-time":"2025-12-30T23:37:31Z","timestamp":1767137851475,"version":"build-2238731810"},"publisher-location":"Cham","reference-count":9,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319091730","type":"print"},{"value":"9783319091747","type":"electronic"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-09174-7_15","type":"book-chapter","created":{"date-parts":[[2014,7,21]],"date-time":"2014-07-21T01:42:05Z","timestamp":1405906925000},"page":"173-185","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Computational Complexity of Stochastic Optimization"],"prefix":"10.1007","author":[{"given":"Cassio Polpo","family":"de Campos","sequence":"first","affiliation":[]},{"given":"Georgios","family":"Stamoulis","sequence":"additional","affiliation":[]},{"given":"Dennis","family":"Weyland","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,7,22]]},"reference":[{"key":"15_CR1","volume-title":"Introduction to Stochastic Programming","author":"JR Birge","year":"1997","unstructured":"Birge, J.R., Louveaux, F.V.: Introduction to Stochastic Programming. Springer, Berlin (1997)"},{"key":"15_CR2","unstructured":"de Campos, C., Stamoulis, G., Weyland, D.: A structured view on weighted counting with relations to quantum computation and applications. Technical report, Electronic Colloquium on Computational Complexity, TR13-133 (2013)"},{"issue":"3","key":"15_CR3","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/s10107-005-0597-0","volume":"106","author":"M Dyer","year":"2006","unstructured":"Dyer, M., Stougie, L.: Computational complexity of stochastic programming problems. Math. Program. 106(3), 423\u2013432 (2006)","journal-title":"Math. Program."},{"issue":"1","key":"15_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1996.0001","volume":"124","author":"L Fortnow","year":"1996","unstructured":"Fortnow, L., Reingold, N.: PP is closed under truth-table reductions. Inf. Comput. 124(1), 1\u20136 (1996)","journal-title":"Inf. Comput."},{"issue":"6","key":"15_CR5","doi-asserted-by":"publisher","first-page":"929","DOI":"10.1287\/opre.36.6.929","volume":"36","author":"P Jaillet","year":"1988","unstructured":"Jaillet, P.: A priori solution of a traveling salesman problem in which a random subset of the customers are visited. Oper. Res. 36(6), 929\u2013936 (1988)","journal-title":"Oper. Res."},{"issue":"1","key":"15_CR6","first-page":"36","volume":"9","author":"ML Littman","year":"1998","unstructured":"Littman, M.L., Goldsmith, J., Mundhenk, M.: The computational complexity of probabilistic planning. J. Artif. Intell. Res. 9(1), 36 (1998)","journal-title":"J. Artif. Intell. Res."},{"key":"15_CR7","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0304-3975(79)90044-6","volume":"8","author":"LG Valiant","year":"1979","unstructured":"Valiant, L.G.: The complexity of computing the permanent. Theor. Comput. Sci. 8, 189\u2013201 (1979)","journal-title":"Theor. Comput. Sci."},{"key":"15_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1007\/978-3-642-32147-4_35","volume-title":"Combinatorial Optimization","author":"D Weyland","year":"2012","unstructured":"Weyland, D., Montemanni, R., Gambardella, L.M.: Hardness results for the probabilistic traveling salesman problem with deadlines. In: Mahjoub, A.R., Markakis, V., Milis, I., Paschos, V.T. (eds.) ISCO 2012. LNCS, vol. 7422, pp. 392\u2013403. Springer, Heidelberg (2012)"},{"key":"15_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/978-3-642-53856-8_42","volume-title":"Computer Aided Systems Theory - EUROCAST 2013","author":"D Weyland","year":"2013","unstructured":"Weyland, D., Montemanni, R., Gambardella, L.M.: An improved heuristic for the probabilistic traveling salesman problem with deadlines based on GPGPU. In: Moreno-D\u00edaz, R., Pichler, F., Quesada-Arencibia, A. (eds.) EUROCAST 2013, Part I. LNCS, vol. 8111, pp. 332\u2013339. Springer, Heidelberg (2013)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-09174-7_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,21]],"date-time":"2023-12-21T21:09:35Z","timestamp":1703192975000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-09174-7_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319091730","9783319091747"],"references-count":9,"aliases":["10.1007\/978-3-319-14115-2_15"],"URL":"https:\/\/doi.org\/10.1007\/978-3-319-09174-7_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"22 July 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}