{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:51:51Z","timestamp":1750308711724,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,1,9]],"date-time":"2013-01-09T00:00:00Z","timestamp":1357689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,1,9]]},"DOI":"10.1145\/2422436.2422491","type":"proceedings-article","created":{"date-parts":[[2013,1,3]],"date-time":"2013-01-03T12:58:22Z","timestamp":1357217902000},"page":"505-514","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Robust optimization in the presence of uncertainty"],"prefix":"10.1145","author":[{"given":"Joachim M.","family":"Buhmann","sequence":"first","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matus","family":"Mihalak","sequence":"additional","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rastislav","family":"Sramek","sequence":"additional","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Widmayer","sequence":"additional","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,1,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513616"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/2026143.2026146"},{"key":"e_1_3_2_1_3_1","volume-title":"Stochastic Optimization","author":"Schneider J.J.","year":"2007","unstructured":"J.J. Schneider and S. Kirkpatrick . Stochastic Optimization . Springer , 2007 . J.J. Schneider and S. Kirkpatrick. Stochastic Optimization. Springer, 2007."},{"key":"e_1_3_2_1_4_1","volume-title":"Stochastic Linear Programming: Models, Theory, and Computation","author":"Kall Peter","year":"2005","unstructured":"Peter Kall and J\u00e1nos Mayer . Stochastic Linear Programming: Models, Theory, and Computation . Springer Verlag , 2005 . Peter Kall and J\u00e1nos Mayer. Stochastic Linear Programming: Models, Theory, and Computation. Springer Verlag, 2005."},{"key":"e_1_3_2_1_5_1","volume-title":"Info-gap decision theory: decisions under severe uncertainty","author":"Ben-Haim Y.","year":"2006","unstructured":"Y. Ben-Haim . Info-gap decision theory: decisions under severe uncertainty . Academic , 2006 . Y. Ben-Haim. Info-gap decision theory: decisions under severe uncertainty. Academic, 2006."},{"key":"e_1_3_2_1_6_1","series-title":"Princeton Series in Applied Mathematics","doi-asserted-by":"crossref","DOI":"10.1515\/9781400831050","volume-title":"Laurent El Ghaoui, and Arkadi Nemirovski. Robust Optimization","author":"Ben-Tal Aharon","year":"2009","unstructured":"Aharon Ben-Tal , Laurent El Ghaoui, and Arkadi Nemirovski. Robust Optimization . Princeton Series in Applied Mathematics . Princeton University Press , October 2009 . Aharon Ben-Tal, Laurent El Ghaoui, and Arkadi Nemirovski. Robust Optimization. Princeton Series in Applied Mathematics. Princeton University Press, October 2009."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-05465-5_1"},{"key":"e_1_3_2_1_8_1","first-page":"332","volume-title":"Proceedings of the First Symposium on Innovations in Computer Science (ICS)","author":"Bilu Yonatan","year":"2010","unstructured":"Yonatan Bilu and Nathan Linial . Are stable instances easy? In Andrew Chi-Chih Yao, editor , Proceedings of the First Symposium on Innovations in Computer Science (ICS) , pages 332 -- 341 . Tsinghua University Press , 2010 . Yonatan Bilu and Nathan Linial. Are stable instances easy? In Andrew Chi-Chih Yao, editor, Proceedings of the First Symposium on Innovations in Computer Science (ICS), pages 332--341. Tsinghua University Press, 2010."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-11476-2_9"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-009-0115-y"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Mat\u00fas\n      Mihal\u00e1k Marcel\n      Sch\u00f6ngens RastislavvSr\u00e1mek and \n      Peter\n      Widmayer\n    .\n  On the complexity of the metric TSP under stability considerations\n  . In IvanavCern\u00e1 Tibor Gyim\u00f3thy Juraj Hromkovic Keith G. Jeffery Rastislav Kr\u00e1lovic Marko Vukolic and Stefan Wolf editors SOFSEM volume \n  6543\n   of \n  Lecture Notes in Computer Science pages \n  382\n  --\n  393\n  . \n  Springer 2011\n  .   Mat\u00fas Mihal\u00e1k Marcel Sch\u00f6ngens RastislavvSr\u00e1mek and Peter Widmayer. On the complexity of the metric TSP under stability considerations. In IvanavCern\u00e1 Tibor Gyim\u00f3thy Juraj Hromkovic Keith G. Jeffery Rastislav Kr\u00e1lovic Marko Vukolic and Stefan Wolf editors SOFSEM volume 6543 of Lecture Notes in Computer Science pages 382--393. Springer 2011.","DOI":"10.1007\/978-3-642-18381-2_32"},{"key":"e_1_3_2_1_12_1","volume-title":"On the practically interesting instances of MAXCUT. CoRR, abs\/1205.4893","author":"Bilu Yonatan","year":"2012","unstructured":"Yonatan Bilu , Amit Daniely , Nati Linial , and Michael Saks . On the practically interesting instances of MAXCUT. CoRR, abs\/1205.4893 , 2012 . Yonatan Bilu, Amit Daniely, Nati Linial, and Michael Saks. On the practically interesting instances of MAXCUT. CoRR, abs\/1205.4893, 2012."},{"key":"e_1_3_2_1_13_1","volume-title":"Clustering is difficult only when it does not matter. CoRR, abs\/1205.4891","author":"Daniely Amit","year":"2012","unstructured":"Amit Daniely , Nati Linial , and Michael Saks . Clustering is difficult only when it does not matter. CoRR, abs\/1205.4891 , 2012 . Amit Daniely, Nati Linial, and Michael Saks. Clustering is difficult only when it does not matter. CoRR, abs\/1205.4891, 2012."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511546921","volume-title":"Prediction, Learning, and Games","author":"Cesa-Bianchi Nicol\u00f2","year":"2006","unstructured":"Nicol\u00f2 Cesa-Bianchi and G\u00e1bor Lugosi . Prediction, Learning, and Games . Cambridge University Press , 2006 . Nicol\u00f2 Cesa-Bianchi and G\u00e1bor Lugosi. Prediction, Learning, and Games. Cambridge University Press, 2006."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/358234.381162"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-006-0076-x"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/bxl007"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.06.007"},{"key":"e_1_3_2_1_20_1","unstructured":"Market rates online. http:\/\/www.marketratesonline.com.  Market rates online. http:\/\/www.marketratesonline.com."}],"event":{"name":"ITCS '13: Innovations in Theoretical Computer Science","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Berkeley California USA","acronym":"ITCS '13"},"container-title":["Proceedings of the 4th conference on Innovations in Theoretical Computer Science"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2422436.2422491","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2422436.2422491","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:14:15Z","timestamp":1750277655000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2422436.2422491"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,1,9]]},"references-count":19,"alternative-id":["10.1145\/2422436.2422491","10.1145\/2422436"],"URL":"https:\/\/doi.org\/10.1145\/2422436.2422491","relation":{},"subject":[],"published":{"date-parts":[[2013,1,9]]},"assertion":[{"value":"2013-01-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}