{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,28]],"date-time":"2023-04-28T13:12:56Z","timestamp":1682687576232},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2007,12,18]],"date-time":"2007-12-18T00:00:00Z","timestamp":1197936000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["cent.eur.j.oper.res."],"published-print":{"date-parts":[[2008,6]]},"DOI":"10.1007\/s10100-007-0047-6","type":"journal-article","created":{"date-parts":[[2007,12,17]],"date-time":"2007-12-17T11:10:43Z","timestamp":1197889843000},"page":"179-189","source":"Crossref","is-referenced-by-count":9,"title":["Cascading: an adjusted exchange method for robust conic programming"],"prefix":"10.1007","volume":"16","author":[{"given":"Ralf","family":"Werner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,12,18]]},"reference":[{"issue":"3","key":"47_CR1","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/BF00940304","volume":"59","author":"MD Asic","year":"1988","unstructured":"Asic MD and Kovacevic-Vuijcic VV (1988). An interior semi-infinite programming method. J Optim Theory Appl 59(3): 353\u2013367","journal-title":"J Optim Theory Appl"},{"key":"47_CR2","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 and Nemirovski A (1998). Robust convex optimization. Math Oper Res 23: 769\u2013805","journal-title":"Math Oper Res"},{"issue":"2","key":"47_CR3","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1137\/S1052623401392354","volume":"13","author":"A Ben-Tal","year":"2002","unstructured":"Ben-Tal A, Nemirovski A and Roos C (2002). Robust solutions of uncertain quadratic and conic-quadratic problems. SIAM J Optim 13(2): 535\u2013560","journal-title":"SIAM J Optim"},{"issue":"3","key":"47_CR4","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1007\/s101070100286","volume":"92","author":"A Ben-Tal","year":"2002","unstructured":"Ben-Tal A and Nemirovski A (2002). Robust optimization\u2014methodology and applications. Math Program 92(3): 453\u2013480","journal-title":"Math Program"},{"issue":"1","key":"47_CR5","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s10107-005-0677-1","volume":"107","author":"D Bertsimas","year":"2006","unstructured":"Bertsimas D and Sim M (2006). Tractable approximations to robust conic optimization problems. Math Program 107(1): 5\u201336","journal-title":"Math Program"},{"issue":"1","key":"47_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 and Campi MC (2005). Uncertain convex programs: randomized solutions and confidence levels. Math Program 102(1): 25\u201346","journal-title":"Math Program"},{"key":"47_CR7","unstructured":"Floudas CA, Stein O (2006) The adaptive convexification algorithm: a feasible point method for semi-infinite programming. Preprint No. 116, Department of Mathematics\u2014C, RWTH Aachen University"},{"issue":"5","key":"47_CR8","doi-asserted-by":"crossref","first-page":"779","DOI":"10.1080\/10556780500159128","volume":"21","author":"JA Gomez","year":"2006","unstructured":"Gomez JA and Gomez W (2006). Cutting plane algorithms for robust conic convex optimization problems. Optim Methods Softw 21(5): 779\u2013803","journal-title":"Optim Methods Softw"},{"issue":"3","key":"47_CR9","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1080\/1055678031000098773","volume":"18","author":"M Ko\u010dvara","year":"2003","unstructured":"Ko\u010dvara M and Stingl M (2003). PENNON\u2014a code for convex nonlinear and semidefinite programming. Optim Methods Softw 18(3): 317\u2013333","journal-title":"Optim Methods Softw"},{"key":"47_CR10","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1016\/S0045-7949(99)00173-X","volume":"76","author":"M Ko\u010dvara","year":"2000","unstructured":"Ko\u010dvara M, Zowe J and Nemirovski A (2000). Cascading\u2014an approach to robust material optimization. Comput Struct 76: 431\u2013442","journal-title":"Comput Struct"},{"key":"47_CR11","volume-title":"Optimization by vector space methods","author":"DG Luenberger","year":"1969","unstructured":"Luenberger DG (1969). Optimization by vector space methods. Wiley, New York"},{"key":"47_CR12","doi-asserted-by":"crossref","unstructured":"Reemtsen R, G\u00f6rner S (1998) Numerical methods for semi-infinite programming: a survey. In: Semi-infinite programming. Kluwer, Dortrecht","DOI":"10.1007\/978-1-4757-2868-2_7"},{"key":"47_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2868-2","volume-title":"Semi-infinite programming","author":"R Reemtsen","year":"1998","unstructured":"Reemtsen R and R\u00fcckmann J-J (1998). Semi-infinite programming. Kluwer, Dortrecht"},{"key":"47_CR14","volume-title":"Convex analysis","author":"RT Rockafellar","year":"1997","unstructured":"Rockafellar RT (1997). Convex analysis. Princeton University Press, Princeton"},{"key":"47_CR15","volume-title":"Costs and benefits of robust optimization","author":"K Sch\u00f6ttle","year":"2005","unstructured":"Sch\u00f6ttle K and Werner R (2005). Costs and benefits of robust optimization. Working Paper, TU M\u00fcnchen"},{"key":"47_CR16","doi-asserted-by":"crossref","unstructured":"Vandenberghe L, Boyd S (1998) Connections between semi-infinite and semi-definite programming. In: Semi-infinite programming. Kluwer, Dortrecht","DOI":"10.1007\/978-1-4757-2868-2_8"}],"container-title":["Central European Journal of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-007-0047-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10100-007-0047-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-007-0047-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:49:25Z","timestamp":1559123365000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10100-007-0047-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,12,18]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,6]]}},"alternative-id":["47"],"URL":"https:\/\/doi.org\/10.1007\/s10100-007-0047-6","relation":{},"ISSN":["1435-246X","1613-9178"],"issn-type":[{"value":"1435-246X","type":"print"},{"value":"1613-9178","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,12,18]]}}}