{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T00:34:11Z","timestamp":1767141251101,"version":"build-2238731810"},"update-to":[{"DOI":"10.1007\/s10287-015-0243-0","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2016,12,24]],"date-time":"2016-12-24T00:00:00Z","timestamp":1482537600000}}],"reference-count":3,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2016,12,24]],"date-time":"2016-12-24T00:00:00Z","timestamp":1482537600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Manag Sci"],"published-print":{"date-parts":[[2017,4]]},"DOI":"10.1007\/s10287-016-0269-y","type":"journal-article","created":{"date-parts":[[2016,12,24]],"date-time":"2016-12-24T17:17:56Z","timestamp":1482599876000},"page":"293-296","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Erratum to: Polyhedral approximation of ellipsoidal uncertainty sets via extended formulations: a computational case study"],"prefix":"10.1007","volume":"14","author":[{"given":"Andreas","family":"B\u00e4rmann","sequence":"first","affiliation":[]},{"given":"Andreas","family":"Heidt","sequence":"additional","affiliation":[]},{"given":"Alexander","family":"Martin","sequence":"additional","affiliation":[]},{"given":"Sebastian","family":"Pokutta","sequence":"additional","affiliation":[]},{"given":"Christoph","family":"Thurner","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,12,24]]},"reference":[{"key":"269_CR1","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1287\/moor.26.2.193.10561","volume":"26","author":"A Ben-Tal","year":"2001","unstructured":"Ben-Tal A, Nemirovski A (2001) On polyhedral approximations of the second-order cone. Math Oper Res 26:193\u2013205","journal-title":"Math Oper Res"},{"key":"269_CR2","doi-asserted-by":"crossref","unstructured":"B\u00e4rmann A,\u00a0Heidt A,\u00a0Martin A,\u00a0Pokutta S,\u00a0Thurner C (2016) Polyhedral approximation of ellipsoidal uncertainty sets via extended formulations: a computational case study. Comput Manag Sci 13(2):151\u2013193","DOI":"10.1007\/s10287-015-0243-0"},{"key":"269_CR3","unstructured":"Glineur F (2000) Computational experiments with a linear approximation of second-order cone optimization. Image Technical Report 001, Facult\u00e9 Polytechnique de Mons"}],"container-title":["Computational Management Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10287-016-0269-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10287-016-0269-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10287-016-0269-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T02:43:14Z","timestamp":1498358594000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10287-016-0269-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12,24]]},"references-count":3,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,4]]}},"alternative-id":["269"],"URL":"https:\/\/doi.org\/10.1007\/s10287-016-0269-y","relation":{},"ISSN":["1619-697X","1619-6988"],"issn-type":[{"value":"1619-697X","type":"print"},{"value":"1619-6988","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,12,24]]}}}