{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T04:27:41Z","timestamp":1778646461026,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662447765","type":"print"},{"value":"9783662447772","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44777-2_66","type":"book-chapter","created":{"date-parts":[[2014,8,16]],"date-time":"2014-08-16T10:43:15Z","timestamp":1408185795000},"page":"798-809","source":"Crossref","is-referenced-by-count":11,"title":["A Branch and Price Procedure for the Container Premarshalling Problem"],"prefix":"10.1007","author":[{"given":"Martijn","family":"van Brink","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ruben","family":"van der Zwaan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"66_CR1","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1007\/s00453-011-9561-y","volume":"63","author":"P. Bonsma","year":"2012","unstructured":"Bonsma, P., Breuer, F.: Counting hexagonal patches and independent sets in circle graphs. Algorithmica\u00a063(3), 645\u2013671 (2012)","journal-title":"Algorithmica"},{"issue":"3","key":"66_CR2","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1016\/j.ejor.2011.10.005","volume":"217","author":"A. Bortfeldt","year":"2012","unstructured":"Bortfeldt, A., Forster, F.: A tree search procedure for the container pre-marshalling problem. European Journal of Operational Research\u00a0217(3), 531\u2013540 (2012)","journal-title":"European Journal of Operational Research"},{"key":"66_CR3","series-title":"Operations Research\/Computer Science Interfaces Series","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/978-1-4419-8408-1_13","volume-title":"Handbook of Terminal Planning","author":"M. Caserta","year":"2011","unstructured":"Caserta, M., Schwarze, S., Vo\u00df, S.: Container rehandling at maritime container terminals. In: B\u00f6se, J.W. (ed.) Handbook of Terminal Planning. Operations Research\/Computer Science Interfaces Series, vol.\u00a049, pp. 247\u2013269. Springer, New York (2011)"},{"issue":"1","key":"66_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(1), 96\u2013104 (2012)","journal-title":"European Journal of Operational Research"},{"key":"66_CR5","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., Brabazon, A., Cagnoni, S., Di Caro, G.A., Ek\u00e1rt, A., Esparcia-Alc\u00e1zar, A.I., Farooq, M., Fink, A., Machado, P. (eds.) EvoWorkshops 2009. LNCS, vol.\u00a05484, pp. 788\u2013797. Springer, Heidelberg (2009)"},{"issue":"9","key":"66_CR6","doi-asserted-by":"publisher","first-page":"8337","DOI":"10.1016\/j.eswa.2012.01.187","volume":"39","author":"C. Exp\u00f3sito-Izquierdo","year":"2012","unstructured":"Exp\u00f3sito-Izquierdo, C., Meli\u00e1n-Batista, B., Moreno-Vega, M.: Pre-marshalling problem: Heuristic solution method and instances generator. Expert Systems with Applications\u00a039(9), 8337\u20138349 (2012)","journal-title":"Expert Systems with Applications"},{"issue":"3","key":"66_CR7","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1016\/S0022-0000(03)00066-7","volume":"67","author":"V. Guruswami","year":"2003","unstructured":"Guruswami, V., Khanna, S., Rajaraman, R., Shepherd, B., Yannakakis, M.: Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems. Journal of Computer and System Sciences\u00a067(3), 473\u2013496 (2003)","journal-title":"Journal of Computer and System Sciences"},{"issue":"1","key":"66_CR8","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.cie.2011.08.010","volume":"62","author":"S.-H. Huang","year":"2012","unstructured":"Huang, S.-H., Lin, T.-H.: Heuristic algorithms for container pre-marshalling problems. Computers & Industrial Engineering\u00a062(1), 13\u201320 (2012)","journal-title":"Computers & Industrial Engineering"},{"issue":"2","key":"66_CR9","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1016\/j.ejor.2008.03.011","volume":"196","author":"Y. Lee","year":"2009","unstructured":"Lee, Y., Chao, S.-L.: A neighborhood search heuristic for pre-marshalling export containers. European Journal of Operational Research\u00a0196(2), 468\u2013475 (2009)","journal-title":"European Journal of Operational Research"},{"issue":"11","key":"66_CR10","doi-asserted-by":"publisher","first-page":"3295","DOI":"10.1016\/j.cor.2005.12.006","volume":"34","author":"Y. Lee","year":"2007","unstructured":"Lee, Y., Hsu, N.-Y.: An optimization model for the container pre-marshalling problem. Computers & Operations Research\u00a034(11), 3295\u20133313 (2007)","journal-title":"Computers & Operations Research"},{"key":"66_CR11","doi-asserted-by":"crossref","unstructured":"Lehnfeld, J., Knust, S.: Loading, unloading and premarshalling of stacks in storage areas: Survey and classification. European Journal of Operational Research (to appear, 2014)","DOI":"10.1016\/j.ejor.2014.03.011"},{"issue":"1","key":"66_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00291-007-0100-9","volume":"30","author":"R. Stahlbock","year":"2008","unstructured":"Stahlbock, R., Vo\u00df, S.: Operations research at container terminals: a literature update. OR Spectrum\u00a030(1), 1\u201352 (2008)","journal-title":"OR Spectrum"},{"issue":"1","key":"66_CR13","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s00291-003-0157-z","volume":"26","author":"D. Steenken","year":"2004","unstructured":"Steenken, D., Vo\u00df, S., Stahlbock, R.: Container terminal operation and operations research - a classification and literature review. OR Spectrum\u00a026(1), 3\u201349 (2004)","journal-title":"OR Spectrum"},{"key":"66_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-540-24587-2_15","volume-title":"Algorithms and Computation","author":"G. Valiente","year":"2003","unstructured":"Valiente, G.: A new simple algorithm for the maximum-weight independent set problem on circle graphs. In: Ibaraki, T., Katoh, N., Ono, H. (eds.) ISAAC 2003. LNCS, vol.\u00a02906, pp. 129\u2013137. Springer, Heidelberg (2003)"},{"key":"66_CR15","unstructured":"van Brink, M., van der Zwaan, R.: A branch and price procedure for the container premarshalling problem (2014), \n                  \n                    http:\/\/arxiv.org\/abs\/1406.7107"},{"issue":"1","key":"66_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0377-2217(02)00293-X","volume":"147","author":"I.F.A. Vis","year":"2003","unstructured":"Vis, I.F.A., de Koster, R.: Transshipment of containers at a container terminal: An overview. European Journal of Operational Research\u00a0147(1), 1\u201316 (2003)","journal-title":"European Journal of Operational Research"}],"container-title":["Lecture Notes in Computer Science","Algorithms - ESA 2014"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44777-2_66","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T16:16:09Z","timestamp":1558973769000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44777-2_66"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662447765","9783662447772"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44777-2_66","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}