{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T11:16:40Z","timestamp":1775128600295,"version":"3.50.1"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319114200","type":"print"},{"value":"9783319114217","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-11421-7_6","type":"book-chapter","created":{"date-parts":[[2014,9,24]],"date-time":"2014-09-24T06:09:06Z","timestamp":1411538946000},"page":"81-92","source":"Crossref","is-referenced-by-count":5,"title":["Average Case Analysis of Blocks Relocation Heuristics"],"prefix":"10.1007","author":[{"given":"Martin","family":"Olsen","sequence":"first","affiliation":[]},{"given":"Allan","family":"Gross","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1090\/S0273-0979-99-00796-X","volume":"36","author":"D. Aldous","year":"1999","unstructured":"Aldous, D., Diaconis, P.: Longest increasing subsequences: From patience sorting to the Baik-Deift-Johansson theorem. Bulletin of the American Mathematical Society\u00a036, 413\u2013432 (1999)","journal-title":"Bulletin of the American Mathematical Society"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Auger, A., Doerr, B.: Theory of Randomized Search Heuristics: Foundations and Recent Developments. World Scientific Publishing Co., River Edge (2011)","DOI":"10.1142\/7438"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Ausiello, G., Protasi, M., Marchetti-Spaccamela, A., Gambosi, G., Crescenzi, P., Kann, V.: Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties. Springer, New York (1999)","DOI":"10.1007\/978-3-642-58412-1"},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.ejor.2011.12.039","volume":"219","author":"M. Caserta","year":"2012","unstructured":"Caserta, M., Schwarze, S., Vo\u00df, S.: A mathematical formulation and complexity considerations for the blocks relocation problem. European Journal of Operational Research\u00a0219, 96\u2013104 (2012)","journal-title":"European Journal of Operational Research"},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"915","DOI":"10.1007\/s00291-009-0176-5","volume":"33","author":"M. Caserta","year":"2011","unstructured":"Caserta, M., Vo\u00df, S., Sniedovich, M.: Applying the corridor method to a blocks relocation problem. OR Spectrum\u00a033, 915\u2013929 (2011)","journal-title":"OR Spectrum"},{"issue":"2","key":"6_CR6","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/j.cor.2011.04.004","volume":"39","author":"F. Forster","year":"2012","unstructured":"Forster, F., Bortfeldt, A.: A tree search procedure for the container relocation problem. Computers & Operations Research\u00a039(2), 299\u2013309 (2012)","journal-title":"Computers & Operations Research"},{"key":"6_CR7","doi-asserted-by":"publisher","first-page":"940","DOI":"10.1016\/j.cor.2004.08.005","volume":"33","author":"K.H. Kim","year":"2006","unstructured":"Kim, K.H., Hong, G.P.: A heuristic rule for relocating blocks. Computers & Operations Research\u00a033, 940\u2013954 (2006)","journal-title":"Computers & Operations Research"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Kobayashi, H., Mark, B.L., Turin, W.: Probability, Random Processes, and Statistical Analysis: Applications to Communications, Signal Processing, Queueing Theory and Mathematical Finance. Cambridge University Press (2012)","DOI":"10.1017\/CBO9780511977770"},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1016\/j.ejor.2013.05.037","volume":"231","author":"M.E. Petering","year":"2013","unstructured":"Petering, M.E., Hussein, M.I.: A new mixed integer program and extended look-ahead heuristic algorithm for the blocks relocation problem. European Journal of Operational Research\u00a0231, 120\u2013130 (2013)","journal-title":"European Journal of Operational Research"},{"key":"6_CR10","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/s10479-012-1186-2","volume":"203","author":"R.J. Rei","year":"2013","unstructured":"Rei, R.J., Pedroso, J.P.: Tree search for the stacking problem. Annals of Operations Research\u00a0203, 371\u2013388 (2013)","journal-title":"Annals of Operations Research"},{"key":"6_CR11","unstructured":"Vijayaraghavan, A.: Beyond Worst-case Analysis in Approximation Algorithms. Ph.D. thesis, Princeton University (2012)"}],"container-title":["Lecture Notes in Computer Science","Computational Logistics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-11421-7_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,16]],"date-time":"2023-07-16T19:04:06Z","timestamp":1689534246000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-11421-7_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319114200","9783319114217"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-11421-7_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}