{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,25]],"date-time":"2026-01-25T13:56:55Z","timestamp":1769349415160,"version":"3.49.0"},"reference-count":10,"publisher":"IEEE","license":[{"start":{"date-parts":[[2014,8,1]],"date-time":"2014-08-01T00:00:00Z","timestamp":1406851200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2014,8,1]],"date-time":"2014-08-01T00:00:00Z","timestamp":1406851200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,8]]},"DOI":"10.1109\/coase.2014.6899296","type":"proceedings-article","created":{"date-parts":[[2014,11,11]],"date-time":"2014-11-11T14:28:58Z","timestamp":1415716138000},"page":"7-12","source":"Crossref","is-referenced-by-count":4,"title":["A faster branch-and-bound algorithm for the block relocation problem"],"prefix":"10.1109","author":[{"given":"Shunji","family":"Tanaka","sequence":"first","affiliation":[{"name":"Institute for Liberal Arts and Sciences, Kyoto University, Kyotodaigaku-Katsura, Nishikyo-ku, 615-8510, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kenta","family":"Takii","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering, Kyoto University, Kyotodaigaku-Katsura, Nishikyo-ku, 615-8510, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1002\/nav.20373"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2012.2198642"},{"key":"ref10","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/978-3-642-38577-3_19","article-title":"A greedy look-ahead heuristic for the container relocation problem","volume":"7906","author":"jin","year":"2013","journal-title":"Lecture Notes in Computer Science"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2013.05.037"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2011.12.039"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s00291-009-0176-5"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/978-3-642-11169-3_12","article-title":"Corridor selection and fine tuning for the corridor method","volume":"5851","author":"caserta","year":"2009","journal-title":"Lecture Notes in Computer Science"},{"key":"ref2","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1002\/atr.1193","article-title":"Improved rehandling strategies for the container retrieval process","volume":"46","author":"\u00fcnl\u00fcyurt","year":"2012","journal-title":"Journal of Advanced Transportation"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2011.04.004"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2004.08.005"}],"event":{"name":"2014 IEEE International Conference on Automation Science and Engineering (CASE)","location":"New Taipei, Taiwan","start":{"date-parts":[[2014,8,18]]},"end":{"date-parts":[[2014,8,22]]}},"container-title":["2014 IEEE International Conference on Automation Science and Engineering (CASE)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6892922\/6899294\/06899296.pdf?arnumber=6899296","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,5]],"date-time":"2025-08-05T18:02:12Z","timestamp":1754416932000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/6899296\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,8]]},"references-count":10,"URL":"https:\/\/doi.org\/10.1109\/coase.2014.6899296","relation":{},"subject":[],"published":{"date-parts":[[2014,8]]}}}