{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T17:25:22Z","timestamp":1742923522979,"version":"3.40.3"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319070001"},{"type":"electronic","value":"9783319070018"}],"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-07001-8_51","type":"book-chapter","created":{"date-parts":[[2014,7,9]],"date-time":"2014-07-09T15:13:03Z","timestamp":1404918783000},"page":"377-382","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Two-Stage Robust Combinatorial Optimization with Priced Scenarios"],"prefix":"10.1007","author":[{"given":"Roman","family":"Rischke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,7,10]]},"reference":[{"key":"51_CR1","doi-asserted-by":"crossref","unstructured":"Ben-Tal, A., El Ghaoui, L., & Nemirovski, A. (2009). Robust optimization. Princeton series in applied mathematics. Princeton, N.J.: Princeton University Press.","DOI":"10.1515\/9781400831050"},{"issue":"1","key":"51_CR2","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1287\/opre.1030.0065","volume":"52","author":"DJ Bertsimas","year":"2004","unstructured":"Bertsimas, D. J., & Sim, M. (2004). The price of robustness. Operations Research, 52(1), 35\u201353.","journal-title":"Operations Research"},{"key":"51_CR3","doi-asserted-by":"crossref","unstructured":"Dhamdhere, K., Goyal, V., Ravi, R., & Singh, M. (2005). How to pay, come what may: Approximation algorithms for demand-robust covering problems. In Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005) (pp. 367\u2013378).","DOI":"10.1109\/SFCS.2005.42"},{"key":"51_CR4","doi-asserted-by":"crossref","unstructured":"Feige, U., Jain, K., Mahdian, M., & Mirrokni, V. (2007). Robust combinatorial optimization with exponential scenarios. In D.P. Williamson & M. Fischetti (Eds.), Proceedings of the 12th International Conference on Integer Programming and Combinatorial Optimization (IPCO 2007). Lecture notes in computer science, Vol. 4513 (pp. 439\u2013453).","DOI":"10.1007\/978-3-540-72792-7_33"},{"key":"51_CR5","doi-asserted-by":"crossref","unstructured":"Golovin, D., Goyal, V., & Ravi, R. (2006). Pay today for a rainy day: Improved approximation algorithms for demand-robust min-cut and shortest path problems. In B. Durand & W. Thomas (Eds.), Proceedings of the 23rd Annual Symposium on Theoretical Aspects of Computer Science (STACS 2006). Lecture notes in computer science, Vol. 3884 (pp. 206\u2013217).","DOI":"10.1007\/11672142_16"},{"key":"51_CR6","doi-asserted-by":"crossref","unstructured":"Gupta, A., Nagarajan, V., & Ravi, R. (2010). Thresholded covering algorithms for robust and max-min optimization. In S. Abramsky, C. Gavoille, C. Kirchner, F. Meyer auf der Heide, P.G. Spirakis (Eds.), Proceedings of the 37th International Colloquium (ICALP 2010). Lecture notes in computer science, Vol. 6198 (pp. 262\u2013274).","DOI":"10.1007\/978-3-642-14165-2_23"},{"key":"51_CR7","doi-asserted-by":"crossref","unstructured":"Khandekar, R., Kortsarz, G., Mirrokni, V., & Salavatipour, M. R. (2008). Two-stage robust network design with exponential scenarios. In D. Halperin & K. Mehlhorn (Eds.), Proceedings of the 16th Annual European Symposium (ESA 2008). Lecture notes in computer science, Vol. 5193 (pp. 589\u2013600).","DOI":"10.1007\/978-3-540-87744-8_49"},{"key":"51_CR8","doi-asserted-by":"crossref","unstructured":"Kouvelis, P., & Yu, G. (1997). Robust discrete optimization and its applications. Nonconvex optimization and its applications, Vol. 14. Dordrecht: Kluwer Academic Publishers.","DOI":"10.1007\/978-1-4757-2620-6"},{"issue":"6","key":"51_CR9","doi-asserted-by":"publisher","first-page":"978","DOI":"10.1145\/1217856.1217860","volume":"53","author":"DB Shmoys","year":"2006","unstructured":"Shmoys, D. B., & Swamy, C. (2006). An approximation scheme for stochastic linear programming and its application to stochastic integer programs. Journal of the ACM, 53(6), 978\u20131012.","journal-title":"Journal of the ACM"},{"key":"51_CR10","unstructured":"Woeginger, G. J. (2001). When does a dynamic programming formulation guarantee the existence of an FPTAS?. Electronic Colloquium on Computational Complexity, Report No. 84."}],"container-title":["Operations Research Proceedings","Operations Research Proceedings 2013"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07001-8_51","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,21]],"date-time":"2023-01-21T01:47:07Z","timestamp":1674265627000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-07001-8_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319070001","9783319070018"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07001-8_51","relation":{},"ISSN":["0721-5924"],"issn-type":[{"type":"print","value":"0721-5924"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"10 July 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}