{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T16:49:43Z","timestamp":1649090983604},"reference-count":29,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2018,12,1]],"date-time":"2018-12-01T00:00:00Z","timestamp":1543622400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2018,12,1]],"date-time":"2018-12-01T00:00:00Z","timestamp":1543622400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["EURO Journal on Computational Optimization"],"published-print":{"date-parts":[[2018,12]]},"DOI":"10.1007\/s13675-018-0094-x","type":"journal-article","created":{"date-parts":[[2018,2,12]],"date-time":"2018-02-12T10:26:08Z","timestamp":1518431168000},"page":"339-365","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Trade-off between robustness and cost for a storage loading problem: rule-based scenario generation"],"prefix":"10.1016","volume":"6","author":[{"given":"Christina","family":"B\u00fcsing","sequence":"first","affiliation":[]},{"given":"Sigrid","family":"Knust","sequence":"additional","affiliation":[]},{"given":"XuanThanh","family":"Le","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"3","key":"10.1007\/s13675-018-0094-x_CR1","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1111\/1467-9965.00068","article-title":"Coherent measures of risk","volume":"9","author":"Artzner","year":"1999","journal-title":"Math Finance"},{"issue":"4","key":"10.1007\/s13675-018-0094-x_CR2","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1287\/moor.23.4.769","article-title":"Robust convex optimization","volume":"23","author":"Ben-Tal","year":"1998","journal-title":"Math Oper Res"},{"issue":"1","key":"10.1007\/s13675-018-0094-x_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0167-6377(99)00016-4","article-title":"Robust solutions of uncertain linear programs","volume":"25","author":"Ben-Tal","year":"1999","journal-title":"Oper Res Lett"},{"issue":"3","key":"10.1007\/s13675-018-0094-x_CR4","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1007\/PL00011380","article-title":"Robust solutions of linear programming contaminated with uncertain data","volume":"88","author":"Ben-Tal","year":"2000","journal-title":"Math Program"},{"key":"10.1007\/s13675-018-0094-x_CR5","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1007\/s101070100286","article-title":"Robust optimization-methodology and applications","volume":"92","author":"Ben-Tal","year":"2002","journal-title":"Math Program B"},{"key":"10.1007\/s13675-018-0094-x_CR6","series-title":"Robust optimization","author":"Ben-Tal","year":"2009"},{"issue":"6","key":"10.1007\/s13675-018-0094-x_CR7","doi-asserted-by":"crossref","first-page":"1438","DOI":"10.1287\/opre.1080.0646","article-title":"Constructing uncertainty sets for robust linear optimization","volume":"57","author":"Bertsimas","year":"2009","journal-title":"Oper Res"},{"issue":"1-3","key":"10.1007\/s13675-018-0094-x_CR8","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s10107-003-0396-4","article-title":"Robust discrete optimization and network flows","volume":"98","author":"Bertsimas","year":"2003","journal-title":"Math Program"},{"issue":"3","key":"10.1007\/s13675-018-0094-x_CR9","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1137\/080734510","article-title":"Theory and applications of robust optimization","volume":"53","author":"Bertsimas","year":"2011","journal-title":"SIAM Rev"},{"issue":"2","key":"10.1007\/s13675-018-0094-x_CR10","doi-asserted-by":"crossref","first-page":"618","DOI":"10.1016\/j.ejor.2015.09.033","article-title":"The parallel stack loading problem to minimize blockages","volume":"249","author":"Boysen","year":"2016","journal-title":"Eur J Oper Res"},{"issue":"3","key":"10.1007\/s13675-018-0094-x_CR11","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1007\/s00291-013-0341-8","article-title":"Robust load planning of trains in intermodal transportation","volume":"36","author":"Bruns","year":"2014","journal-title":"OR Spectr"},{"issue":"3","key":"10.1007\/s13675-018-0094-x_CR12","doi-asserted-by":"crossref","first-page":"1074","DOI":"10.1016\/j.ejor.2015.09.036","article-title":"Complexity results for storage loading problems with stacking constraints","volume":"249","author":"Bruns","year":"2016","journal-title":"Eur J Oper Res"},{"issue":"4","key":"10.1007\/s13675-018-0094-x_CR13","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1007\/s00291-006-0038-3","article-title":"Advanced methods for container stacking","volume":"28","author":"Dekker","year":"2006","journal-title":"OR Spectr"},{"key":"10.1007\/s13675-018-0094-x_CR14","doi-asserted-by":"crossref","unstructured":"Everitt BS, Skrondal A (2010) The Cambridge dictionary of statistics, 4th edn. Cambridge University Press, Cambridge","DOI":"10.1017\/CBO9780511779633"},{"key":"10.1007\/s13675-018-0094-x_CR15","unstructured":"ExoAnalytics Inc. Extreme optimization, complexity made simple. http:\/\/www.extremeoptimization.com\/Documentation\/Statistics\/Default.aspx"},{"key":"10.1007\/s13675-018-0094-x_CR16","series-title":"Statistical distributions","author":"Forbes","year":"2011"},{"issue":"9","key":"10.1007\/s13675-018-0094-x_CR17","doi-asserted-by":"crossref","first-page":"2592","DOI":"10.1080\/00207543.2013.861618","article-title":"A decision-tree stacking heuristic minimising the expected number of reshuffles at a container terminal","volume":"52","author":"Gharehgozli","year":"2014","journal-title":"Int J Prod Res"},{"issue":"1","key":"10.1007\/s13675-018-0094-x_CR18","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/j.ejor.2016.02.019","article-title":"Robust storage loading problems with stacking and payload constraints","volume":"253","author":"Goerigk","year":"2016","journal-title":"Eur J Oper Res"},{"key":"10.1007\/s13675-018-0094-x_CR19","series-title":"Probability essentials","author":"Jacod","year":"2004"},{"key":"10.1007\/s13675-018-0094-x_CR20","series-title":"Stochastic programming","author":"Kall","year":"1994"},{"issue":"4","key":"10.1007\/s13675-018-0094-x_CR21","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1007\/s10845-005-0013-x","article-title":"Deriving stacking strategies for export containers with uncertain weight information","volume":"17","author":"Kang","year":"2006","journal-title":"J Intell Manuf"},{"issue":"1","key":"10.1007\/s13675-018-0094-x_CR22","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/S0377-2217(99)00116-2","article-title":"Deriving decision rules to locate export containers in container yards","volume":"124","author":"Kim","year":"2000","journal-title":"Eur J Oper Res"},{"key":"10.1007\/s13675-018-0094-x_CR23","unstructured":"Koch T (2004) Rapid mathematical programming. Ph.D. thesis, Technische Universit\u00e4t Berlin"},{"key":"10.1007\/s13675-018-0094-x_CR24","series-title":"Robust discrete optimization and its applications","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2620-6","author":"Kouvelis","year":"1997"},{"key":"10.1007\/s13675-018-0094-x_CR25","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1016\/j.cor.2016.08.016","article-title":"MIP-based approaches for robust storage loading problems with stacking constraints","volume":"78","author":"Le","year":"2017","journal-title":"Comput Oper Res"},{"issue":"2","key":"10.1007\/s13675-018-0094-x_CR26","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/j.ejor.2014.03.011","article-title":"Loading, unloading and premarshalling of stacks in storage areas: survey and classification","volume":"239","author":"Lehnfeld","year":"2014","journal-title":"Eur J Oper Res"},{"issue":"1","key":"10.1007\/s13675-018-0094-x_CR27","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/s11067-010-9150-7","article-title":"Interval uncertainty-based robust optimization for convex and non-convex quadratic programs with applications in network infrastructure planning","volume":"11","author":"Li","year":"2011","journal-title":"Netw Spatial Econ"},{"key":"10.1007\/s13675-018-0094-x_CR28","doi-asserted-by":"crossref","unstructured":"Steenken D, Winter T, Zimmermann U (2001) Stowage and transport optimization in ship planning. In: Online optimization of large scale systems. Springer, pp 731\u2013745","DOI":"10.1007\/978-3-662-04331-8_35"},{"key":"10.1007\/s13675-018-0094-x_CR29","unstructured":"Trivikram D, Goerigk M (2017) An experimental comparison of uncertainty sets for robust shortest path problems. In: Proceedings of the 17th workshop on algorithmic approaches for transportation modelling, optimization, and systems (ATMOS2017)"}],"container-title":["EURO Journal on Computational Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13675-018-0094-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13675-018-0094-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192440621001064?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192440621001064?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13675-018-0094-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T09:29:46Z","timestamp":1648632586000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S2192440621001064"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12]]},"references-count":29,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,12]]}},"alternative-id":["S2192440621001064"],"URL":"https:\/\/doi.org\/10.1007\/s13675-018-0094-x","relation":{},"ISSN":["2192-4406"],"issn-type":[{"value":"2192-4406","type":"print"}],"subject":[],"published":{"date-parts":[[2018,12]]},"assertion":[{"value":"20 July 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 February 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 February 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}