{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T11:16:34Z","timestamp":1775128594102,"version":"3.50.1"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,7,20]],"date-time":"2012-07-20T00:00:00Z","timestamp":1342742400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2013,3]]},"DOI":"10.1007\/s10479-012-1186-2","type":"journal-article","created":{"date-parts":[[2012,7,19]],"date-time":"2012-07-19T19:43:57Z","timestamp":1342727037000},"page":"371-388","source":"Crossref","is-referenced-by-count":32,"title":["Tree search for the stacking problem"],"prefix":"10.1007","volume":"203","author":[{"given":"Rui","family":"Rei","sequence":"first","affiliation":[]},{"given":"Jo\u00e3o Pedro","family":"Pedroso","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,7,20]]},"reference":[{"key":"1186_CR1","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1023\/A:1018956823693","volume":"76","author":"M. Avriel","year":"1998","unstructured":"Avriel, M., Penn, M., Shpirer, N., & Witteboon, S. (1998). Stowage planning for container ships to reduce the number of shifts. Annals of Operations Research, 76, 55\u201371.","journal-title":"Annals of Operations Research"},{"issue":"1\u20133","key":"1186_CR2","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/S0166-218X(99)00245-0","volume":"103","author":"M. Avriel","year":"2000","unstructured":"Avriel, M., Penn, M., & Shpirer, N. (2000). Container ship stowage problem: complexity and connection to the coloring of circle graphs. Discrete Applied Mathematics, 103(1\u20133), 271\u2013279.","journal-title":"Discrete Applied Mathematics"},{"key":"1186_CR3","doi-asserted-by":"crossref","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. (2011). Applying the corridor method to a blocks relocation problem. OR Spectrum, 33, 915\u2013929.","journal-title":"OR Spectrum"},{"key":"1186_CR4","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/978-3-540-49550-5_7","volume-title":"Container terminals and cargo systems","author":"R. Dekker","year":"2007","unstructured":"Dekker, R., Voogd, P., & Asperen, E. (2007). Advanced methods for container stacking. In K.\u00a0H. Kim & H.-O. G\u00fcnther (Eds.), Container terminals and cargo systems (pp. 131\u2013154). Berlin: Springer."},{"key":"1186_CR5","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1002\/net.3230030305","volume":"3","author":"F. Gavril","year":"1973","unstructured":"Gavril, F. (1973). Algorithms for a maximum clique and a maximum independent set of a circle graph. Networks, 3, 261\u2013273.","journal-title":"Networks"},{"key":"1186_CR6","series-title":"Annals of discrete mathematics","volume-title":"Algorithmic graph theory and perfect graphs","author":"M. C. Golumbic","year":"2004","unstructured":"Golumbic, M. C. (2004). Annals of discrete mathematics: Algorithmic graph theory and perfect graphs. Amsterdam: Elsevier."},{"key":"1186_CR7","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/s00291-003-0149-z","volume":"26","author":"S. Hartmann","year":"2004","unstructured":"Hartmann, S. (2004). A general framework for scheduling equipment and manpower at container terminals. OR Spectrum, 26, 51\u201374.","journal-title":"OR Spectrum"},{"key":"1186_CR8","doi-asserted-by":"crossref","first-page":"940","DOI":"10.1016\/j.cor.2004.08.005","volume":"33","author":"K.\u00a0H. Kim","year":"2006","unstructured":"Kim, K.\u00a0H., & Hong, G.-P. (2006). A heuristic rule for relocating blocks. Computers and Operations Research, 33, 940\u2013954.","journal-title":"Computers and Operations Research"},{"key":"1186_CR9","volume-title":"Simulation modeling and analysis","author":"A. M. Law","year":"2006","unstructured":"Law, A. M. (2006). Simulation modeling and analysis (4th ed.). New York: McGraw-Hill.","edition":"4"},{"key":"1186_CR10","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/j.ejor.2009.04.027","volume":"202","author":"J. P. Pedroso","year":"2010","unstructured":"Pedroso, J. P., & Kubo, M. (2010). Heuristics and exact methods for number partitioning. European Journal of Operational Research, 202, 73\u201381.","journal-title":"European Journal of Operational Research"},{"key":"1186_CR11","volume-title":"Production planning by mixed integer programming","author":"Y. Pochet","year":"2006","unstructured":"Pochet, Y., & Wolsey, L. A. (2006). Production planning by mixed integer programming. Berlin: Springer."},{"key":"1186_CR12","series-title":"Communications in computer and information science","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1007\/978-3-540-87477-5_28","volume-title":"Modelling, computation and optimization in information systems and management sciences","author":"R. J. Rei","year":"2008","unstructured":"Rei, R. J., Kubo, M., & Pedroso, J. P. (2008). Simulation-based optimization for steel stacking. In H.\u00a0A. Le Thi, P. Bouvry, & T. Pham Dinh (Eds.), Communications in computer and information science: Vol.\u00a014. Modelling, computation and optimization in information systems and management sciences (pp.\u00a0254\u2013263). Berlin: Springer."},{"key":"1186_CR13","first-page":"109","volume-title":"EUMe2009, The European chapter on metaheuristics\u2019 workshop on debating the future: new areas of application and innovative approaches","author":"R. J. Rei","year":"2009","unstructured":"Rei, R. J., & Pedroso, J. P. (2009). Heuristic search for the stacking problem. In A. Viana et al. (Eds.), EUMe2009, The European chapter on metaheuristics\u2019 workshop on debating the future: new areas of application and innovative approaches, Porto, Portugal (pp. 109\u2013114)."},{"key":"1186_CR14","unstructured":"Rei, R. J., & Pedroso, J. P. (2012). Stacking problem instances and instance generator. Internet repository, version 1.0. http:\/\/www.dcc.fc.up.pt\/~jpp\/code\/stacking ."},{"key":"1186_CR15","first-page":"43","volume-title":"Proceedings of the IJCAI-01 workshop on stochastic search","author":"W. Ruml","year":"2001","unstructured":"Ruml, W. (2001). Stochastic tree search: where to put the randomness? In H. H. Hoos & T. G. St\u00fctzle (Eds.), Proceedings of the IJCAI-01 workshop on stochastic search (pp. 43\u201347)."},{"key":"1186_CR16","unstructured":"Ruml, W. (2002). Adaptive tree search. PhD thesis. Cambridge: Harvard University."},{"key":"1186_CR17","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/BFb0035832","volume-title":"STACS 88","author":"W. Unger","year":"1988","unstructured":"Unger, W. (1988). On the k-colouring of circle-graphs. In R. Cori & M. Wirsing (Eds.), Lecture notes in computer science: Vol.\u00a0294. STACS 88 (pp. 61\u201372). Berlin: Springer."},{"key":"1186_CR18","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/3-540-55210-3_199","volume-title":"STACS 92","author":"W. Unger","year":"1992","unstructured":"Unger, W. (1992). The complexity of colouring circle graphs. In A. Finkel & M. Jantzen (Eds.), Lecture notes in computer science: Vol.\u00a0577. STACS 92 (pp. 389\u2013400). Berlin: Springer."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-012-1186-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-012-1186-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-012-1186-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T18:09:36Z","timestamp":1559153376000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-012-1186-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7,20]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,3]]}},"alternative-id":["1186"],"URL":"https:\/\/doi.org\/10.1007\/s10479-012-1186-2","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,7,20]]}}}