{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T13:42:06Z","timestamp":1740145326836,"version":"3.37.3"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2018,8,21]],"date-time":"2018-08-21T00:00:00Z","timestamp":1534809600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100004895","name":"European Social Fund","doi-asserted-by":"publisher","award":["EFOP-3.6.3-VEKOP-16-2017-00002"],"award-info":[{"award-number":["EFOP-3.6.3-VEKOP-16-2017-00002"]}],"id":[{"id":"10.13039\/501100004895","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cent Eur J Oper Res"],"published-print":{"date-parts":[[2019,6]]},"DOI":"10.1007\/s10100-018-0574-3","type":"journal-article","created":{"date-parts":[[2018,8,21]],"date-time":"2018-08-21T01:55:25Z","timestamp":1534816525000},"page":"377-395","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Bin packing problem with scenarios"],"prefix":"10.1007","volume":"27","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7071-2941","authenticated-orcid":false,"given":"Attila","family":"B\u00f3dis","sequence":"first","affiliation":[]},{"given":"J\u00e1nos","family":"Balogh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,8,21]]},"reference":[{"key":"574_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2012.04.017","volume":"440","author":"J Balogh","year":"2012","unstructured":"Balogh J, B\u00e9k\u00e9si J, Galambos G (2012) New lower bounds for certain classes of bin packing algorithms. Theor Comput Sci 440:1\u201313","journal-title":"Theor Comput Sci"},{"issue":"3","key":"574_CR2","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/PL00011380","volume":"88","author":"A Ben-Tal","year":"2000","unstructured":"Ben-Tal A, Nemirovski A (2000) Robust solutions of linear programming problems contaminated with uncertain data. Math Prog 88(3):411\u2013424","journal-title":"Math Prog"},{"key":"574_CR3","unstructured":"Bertsimas D (1988) Probabilistic combinatorial optimization problems. Ph.D. thesis, Massachusetts Institute of Technology"},{"key":"574_CR4","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/978-1-4419-7997-1_35","volume-title":"Handbook of combinatorial optimization","author":"EG Coffman Jr","year":"2013","unstructured":"Coffman EG Jr, Csirik J, Galambos G, Martello S, Vigo D (2013) Bin packing approximation algorithms: survey and classification. In: Pardalos PM, Du DZ, Graham RL (eds) Handbook of combinatorial optimization. Springer, New York, pp 455\u2013531"},{"key":"574_CR5","unstructured":"D\u00f3sa G, Sgall J (2013) First fit bin packing: a tight analysis. In: LIPIcs-Leibniz international proceedings in informatics, vol.\u00a020. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik"},{"key":"574_CR6","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1007\/s10951-016-0484-y","volume":"20","author":"E Feuerstein","year":"2017","unstructured":"Feuerstein E, Marchetti-Spaccamela A, Schalekamp F, Sitters R, van der Ster S, Stougie L, van Zuylen A (2017) Minimizing worst-case and average-case makespan over scenarios. J Sched 20:545. \n                    https:\/\/doi.org\/10.1007\/s10951-016-0484-y","journal-title":"J Sched"},{"issue":"3","key":"574_CR7","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1016\/S0022-0000(74)80026-7","volume":"8","author":"DS Johnson","year":"1974","unstructured":"Johnson DS (1974) Fast algorithms for bin packing. J Comput Syst Sci 8(3):272\u2013314","journal-title":"J Comput Syst Sci"},{"issue":"4","key":"574_CR8","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1137\/0203025","volume":"3","author":"DS Johnson","year":"1974","unstructured":"Johnson DS, Demers A, Ullman JD, Garey MR, Graham RL (1974) Worst-case performance bounds for simple one-dimensional packing algorithms. SIAM J Comput 3(4):299\u2013325","journal-title":"SIAM J Comput"},{"key":"574_CR9","volume-title":"Stochastic programming","author":"P Kall","year":"1994","unstructured":"Kall P, Wallace SW, Kall P (1994) Stochastic programming. Springer, New York"},{"key":"574_CR10","doi-asserted-by":"crossref","unstructured":"Kasperski A, Zieli\u0144ski P (2011) Bottleneck combinatorial optimization problems with fuzzy scenarios. In: Nonlinear mathematics for uncertainty and its applications, Springer, pp 197\u2013204","DOI":"10.1007\/978-3-642-22833-9_23"},{"issue":"2","key":"574_CR11","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/s10951-015-0444-y","volume":"19","author":"A Kasperski","year":"2016","unstructured":"Kasperski A, Zieli\u0144ski P (2016) Single machine scheduling problems with uncertain parameters and the OWA criterion. J Schedul 19(2):177\u2013190","journal-title":"J Schedul"},{"key":"574_CR12","doi-asserted-by":"crossref","unstructured":"Kasperski A, Kurpisz A, Zieli\u0144ski P (2012) Parallel machine scheduling under uncertainty. In: International conference on information processing and management of uncertainty in knowledge-based systems, Springer, pp 74\u201383","DOI":"10.1007\/978-3-642-31724-8_9"},{"issue":"1","key":"574_CR13","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.ipl.2012.10.001","volume":"113","author":"A Kasperski","year":"2013","unstructured":"Kasperski A, Kurpisz A, Zieli\u0144ski P (2013) Approximating the min\u2013max (regret) selecting items problem. Inf Process Lett 113(1):23\u201329","journal-title":"Inf Process Lett"},{"issue":"1\/2","key":"574_CR14","doi-asserted-by":"publisher","first-page":"181","DOI":"10.2307\/1910956","volume":"31","author":"S Kataoka","year":"1963","unstructured":"Kataoka S (1963) A stochastic programming model. Econometrica 31(1\/2):181\u2013196","journal-title":"Econometrica"},{"issue":"3","key":"574_CR15","doi-asserted-by":"publisher","first-page":"562","DOI":"10.1145\/3828.3833","volume":"32","author":"CC Lee","year":"1985","unstructured":"Lee CC, Lee DT (1985) A simple on-line bin-packing algorithm. J ACM (JACM) 32(3):562\u2013572","journal-title":"J ACM (JACM)"},{"key":"574_CR16","volume-title":"Stochastic programming","author":"A Pr\u00e9kopa","year":"2013","unstructured":"Pr\u00e9kopa A (2013) Stochastic programming, vol 324. Springer, New York"},{"key":"574_CR17","doi-asserted-by":"crossref","unstructured":"Rischke R (2014) Two-stage robust combinatorial optimization with priced scenarios. In: Operations research proceedings 2013, Springer, pp 377\u2013382","DOI":"10.1007\/978-3-319-07001-8_51"},{"issue":"5","key":"574_CR18","doi-asserted-by":"publisher","first-page":"1154","DOI":"10.1287\/opre.21.5.1154","volume":"21","author":"AL Soyster","year":"1973","unstructured":"Soyster AL (1973) Convex programming with set-inclusive constraints and applications to inexact linear programming. Oper Res 21(5):1154\u20131157","journal-title":"Oper Res"}],"container-title":["Central European Journal of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-018-0574-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10100-018-0574-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-018-0574-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,21]],"date-time":"2019-09-21T21:36:49Z","timestamp":1569101809000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10100-018-0574-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8,21]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,6]]}},"alternative-id":["574"],"URL":"https:\/\/doi.org\/10.1007\/s10100-018-0574-3","relation":{},"ISSN":["1435-246X","1613-9178"],"issn-type":[{"type":"print","value":"1435-246X"},{"type":"electronic","value":"1613-9178"}],"subject":[],"published":{"date-parts":[[2018,8,21]]},"assertion":[{"value":"21 August 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}