{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T18:37:52Z","timestamp":1726079872524},"publisher-location":"Cham","reference-count":8,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030450922"},{"type":"electronic","value":"9783030450939"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-45093-9_53","type":"book-chapter","created":{"date-parts":[[2020,4,14]],"date-time":"2020-04-14T23:03:45Z","timestamp":1586905425000},"page":"438-445","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Investigating the Dynamic Block Relocation Problem"],"prefix":"10.1007","author":[{"given":"Sebastian","family":"Raggl","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"Beham","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Affenzeller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,4,15]]},"reference":[{"key":"53_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"788","DOI":"10.1007\/978-3-642-01129-0_89","volume-title":"Applications of Evolutionary Computing","author":"M Caserta","year":"2009","unstructured":"Caserta, M., Vo\u00df, S.: A corridor method-based algorithm for the pre-marshalling problem. In: Giacobini, M., et al. (eds.) EvoWorkshops 2009. LNCS, vol. 5484, pp. 788\u2013797. Springer, Heidelberg (2009). \nhttps:\/\/doi.org\/10.1007\/978-3-642-01129-0_89"},{"issue":"5","key":"53_CR2","doi-asserted-by":"publisher","first-page":"1035","DOI":"10.1287\/trsc.2018.0828","volume":"52","author":"V Galle","year":"2018","unstructured":"Galle, V., Manshadi, V.H., Boroujeni, S.B., Barnhart, C., Jaillet, P.: The stochastic container relocation problem. Transp. Sci. 52(5), 1035\u20131058 (2018). \nhttps:\/\/doi.org\/10.1287\/trsc.2018.0828","journal-title":"Transp. Sci."},{"key":"53_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2004.08.005","author":"KH Kim","year":"2006","unstructured":"Kim, K.H., Hong, G.P.: A heuristic rule for relocating blocks. Comput. Oper. Res. (2006). \nhttps:\/\/doi.org\/10.1016\/j.cor.2004.08.005","journal-title":"Comput. Oper. Res."},{"key":"53_CR4","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2018.02.019","author":"S Tanaka","year":"2018","unstructured":"Tanaka, S., Mizuno, F.: An exact algorithm for the unrestricted block relocation problem. Comput. Oper. Res. (2018). \nhttps:\/\/doi.org\/10.1016\/j.cor.2018.02.019","journal-title":"Comput. Oper. Res."},{"key":"53_CR5","doi-asserted-by":"publisher","unstructured":"Tanaka, S., Takii, K.: A faster branch-and-bound algorithm for the block relocation problem. IEEE Trans. Autom. Sci. Eng. (2016). \nhttps:\/\/doi.org\/10.1109\/TASE.2015.2434417","DOI":"10.1109\/TASE.2015.2434417"},{"key":"53_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2017.08.010","author":"F Tricoire","year":"2018","unstructured":"Tricoire, F., Scagnetti, J., Beham, A.: New insights on the block relocation problem. Comput. Oper. Res. (2018). \nhttps:\/\/doi.org\/10.1016\/j.cor.2017.08.010","journal-title":"Comput. Oper. Res."},{"key":"53_CR7","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2015.03.032","author":"E Zehendner","year":"2015","unstructured":"Zehendner, E., Caserta, M., Feillet, D., Schwarze, S., Vo\u00df, S.: An improved mathematical formulation for the blocks relocation problem. Eur. J. Oper. Res. (2015). \nhttps:\/\/doi.org\/10.1016\/j.ejor.2015.03.032","journal-title":"Eur. J. Oper. Res."},{"key":"53_CR8","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2016.09.011","author":"E Zehendner","year":"2017","unstructured":"Zehendner, E., Feillet, D., Jaillet, P.: An algorithm with performance guarantee for the Online Container Relocation Problem. Eur. J. Oper. Res. (2017). \nhttps:\/\/doi.org\/10.1016\/j.ejor.2016.09.011","journal-title":"Eur. J. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Computer Aided Systems Theory \u2013 EUROCAST 2019"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-45093-9_53","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,14]],"date-time":"2020-04-14T23:12:05Z","timestamp":1586905925000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-45093-9_53"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030450922","9783030450939"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-45093-9_53","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"15 April 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUROCAST","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computer Aided Systems Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Las Palmas de Gran Canaria","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 February 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 February 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocast2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/eurocast2019.fulp.ulpgc.es\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}