{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,19]],"date-time":"2025-12-19T09:19:28Z","timestamp":1766135968725},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,10,17]],"date-time":"2008-10-17T00:00:00Z","timestamp":1224201600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2010,9]]},"DOI":"10.1007\/s10589-008-9212-7","type":"journal-article","created":{"date-parts":[[2008,10,16]],"date-time":"2008-10-16T16:45:11Z","timestamp":1224175511000},"page":"1-31","source":"Crossref","is-referenced-by-count":7,"title":["A relaxation algorithm with a probabilistic guarantee for robust deviation optimization"],"prefix":"10.1007","volume":"47","author":[{"given":"Akiko","family":"Takeda","sequence":"first","affiliation":[]},{"given":"Shunsuke","family":"Taguchi","sequence":"additional","affiliation":[]},{"given":"Tsutomu","family":"Tanaka","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,10,17]]},"reference":[{"key":"9212_CR1","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1016\/S0167-6377(03)00058-0","volume":"32","author":"I.D. Aron","year":"2004","unstructured":"Aron, I.D., Hentenryck, P.V.: On the complexity of the robust spanning tree problem with interval data. Oper. Res. Lett. 32, 36\u201340 (2004)","journal-title":"Oper. Res. Lett."},{"key":"9212_CR2","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s10107-005-0677-1","volume":"107","author":"D. Bertsimas","year":"2006","unstructured":"Bertsimas, D., Sim, M.: Tractable approximations of robust conic optimization problems. Math. Program. 107, 5\u201336 (2006)","journal-title":"Math. Program."},{"key":"9212_CR3","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1287\/moor.23.4.769","volume":"23","author":"A. Ben-Tal","year":"1998","unstructured":"Ben-Tal, A., Nemirovski, A.: Robust convex optimization. Math. Oper. Res. 23, 769\u2013805 (1998)","journal-title":"Math. Oper. Res."},{"key":"9212_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0167-6377(99)00016-4","volume":"25","author":"A. Ben-Tal","year":"1999","unstructured":"Ben-Tal, A., Nemirovski, A.: Robust solutions of uncertain linear programs. Oper. Res. Lett. 25, 1\u201313 (1999)","journal-title":"Oper. Res. Lett."},{"key":"9212_CR5","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970777","volume-title":"Linear Matrix Inequalities in System and Control Theory","author":"S. Boyd","year":"1994","unstructured":"Boyd, S., El Ghaoui, L., Feron, E., Balakrishnan, V.: Linear Matrix Inequalities in System and Control Theory. SIAM, Philadelphia (1994)"},{"key":"9212_CR6","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/s10107-003-0499-y","volume":"102","author":"G. Calafiore","year":"2005","unstructured":"Calafiore, G., Campi, M.C.: Uncertain convex programs: randomized solutions and confidence levels. Math. Program. 102, 25\u201346 (2005)","journal-title":"Math. Program."},{"key":"9212_CR7","doi-asserted-by":"crossref","first-page":"742","DOI":"10.1109\/TAC.2006.875041","volume":"51","author":"G. Calafiore","year":"2006","unstructured":"Calafiore, G., Campi, M.C.: The scenario approach to robust control design. IEEE Trans. Automat. Control 51, 742\u2013753 (2006)","journal-title":"IEEE Trans. Automat. Control"},{"key":"9212_CR8","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1287\/mnsc.6.1.73","volume":"6","author":"A. Charnes","year":"1959","unstructured":"Charnes, A., Cooper, W.W.: Chance constrained programming. Manag. Sci. 6, 73\u201379 (1959)","journal-title":"Manag. Sci."},{"key":"9212_CR9","doi-asserted-by":"crossref","first-page":"1035","DOI":"10.1137\/S0895479896298130","volume":"18","author":"L. El Ghaoui","year":"1997","unstructured":"El Ghaoui, L., Lebret, H.: Robust solutions to least-squares problems with uncertain data. SIAM J. Matrix Anal. Appl. 18, 1035\u20131064 (1997)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"9212_CR10","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/s10107-005-0678-0","volume":"107","author":"E. Erdogan","year":"2006","unstructured":"Erdogan, E., Iyengar, G.: Ambiguous chance constrained problems and robust optimization. Math. Program. 107, 37\u201361 (2006)","journal-title":"Math. Program."},{"key":"9212_CR11","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1007\/s10107-003-0425-3","volume":"97","author":"D. Goldfarb","year":"2003","unstructured":"Goldfarb, D., Iyengar, G.: Robust convex quadratically constrained programs. Math. Program. 97, 495\u2013515 (2003)","journal-title":"Math. Program."},{"key":"9212_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/moor.28.1.1.14260","volume":"28","author":"D. Goldfarb","year":"2003","unstructured":"Goldfarb, D., Iyengar, G.: Robust portfolio selection problems. Math. Oper. Res. 28, 1\u201338 (2003)","journal-title":"Math. Oper. Res."},{"key":"9212_CR13","unstructured":"Hites, R., Salazar-Neumann, M.: The robust deviation p-elements problem with interval data. Technical Report, Service de Mathematiques de la Gestion, Universite Libre de Bruxelles (2004). Available at http:\/\/www.ulb.ac.be\/polytech\/smg\/publications\/Preprints\/Hites04_04.htm"},{"key":"9212_CR14","unstructured":"Kanamori, T., Takeda, A.: Worst-case violation of sampled convex programs for optimization with uncertainty. Research Report B-425, Dept. of Mathematical and Computing Sciences, Tokyo Institute of Technology (2006). Available at http:\/\/www.is.titech.ac.jp\/research\/research-report\/B\/B-425.pdf"},{"key":"9212_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2620-6","volume-title":"Robust Discrete Optimization and Its Applications","author":"P. Kouvelis","year":"1997","unstructured":"Kouvelis, P., Yu, G.: Robust Discrete Optimization and Its Applications. Kluwer Academic, Dordrecht (1997)"},{"key":"9212_CR16","unstructured":"Krishnamurthy, V.: Robust optimization in finance. Second Summer Paper for the Doctoral Program (supervised by R.H. T\u00fct\u00fcnc\u00fc). Preprint (2004)"},{"key":"9212_CR17","volume-title":"Probabilistic and Randomized Methods for Design under Uncertainty","author":"A. Nemirovski","year":"2006","unstructured":"Nemirovski, A., Shapiro, A.: Scenario approximations of chance constraints. In: Calafiore, G., Dabbene, F. (eds.) Probabilistic and Randomized Methods for Design under Uncertainty. Springer, Berlin (2006)"},{"key":"9212_CR18","unstructured":"T\u00fct\u00fcnc\u00fc, R.H., Hauser, R., Krishnamurthy, V.: Relative robust optimization. Abstract in 19th International Symposium on Mathematical Programming (ISMP 2006), 2006"},{"key":"9212_CR19","unstructured":"Yaman, H., Kara\u015fan, O.E., Pinar, M.\u00c7.: Restricted robust optimization for maximization over uniform matroid with interval data uncertainty. Technical Report, Bilkent University (2004). www.bilkent.edu.tr\/~hyaman\/RRD.htm"},{"key":"9212_CR20","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/S0167-6377(01)00078-5","volume":"29","author":"H. Yaman","year":"2001","unstructured":"Yaman, H., Kara\u015fan, O.E., Pinar, M.\u00c7.: The robust spanning tree problem with interval data. Oper. Res. Lett. 29, 31\u201340 (2001)","journal-title":"Oper. Res. Lett."},{"key":"9212_CR21","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1016\/S0305-0548(97)00085-3","volume":"25","author":"G. Yu","year":"1998","unstructured":"Yu, G., Yang, J.: On the robust shortest path problem. Comput. Oper. Res. 25, 457\u2013468 (1998)","journal-title":"Comput. Oper. Res."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-008-9212-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-008-9212-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-008-9212-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T07:36:35Z","timestamp":1559288195000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-008-9212-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,10,17]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,9]]}},"alternative-id":["9212"],"URL":"https:\/\/doi.org\/10.1007\/s10589-008-9212-7","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,10,17]]}}}