M. Caserta, S. Schwarze, and S. Voß, A New Binary Description of the Blocks Relocation Problem and Benefits in a Look Ahead Heuristic, Evolutionary Computation in Combinatorial Optimization, pp.37-48, 2009.
DOI : 10.1007/s10845-005-0018-5

M. Caserta, S. Schwarze, and S. Voß, A mathematical formulation and complexity considerations for the blocks relocation problem, European Journal of Operational Research, vol.219, issue.1, pp.96-104, 2012.
DOI : 10.1016/j.ejor.2011.12.039

M. Caserta, S. Voß, and M. Sniedovich, Applying the corridor method to a blocks relocation problem, OR Spectrum, vol.17, issue.4, pp.915-929, 2011.
DOI : 10.1007/s00291-009-0176-5

F. Forster and A. Bortfeldt, A tree search procedure for the container relocation problem, Computers & Operations Research, vol.39, issue.2, pp.299-309, 2012.
DOI : 10.1016/j.cor.2011.04.004

K. Hwan, K. , and G. Hong, A heuristic rule for relocating blocks, Computers & Operations Research, vol.33, pp.940-954, 2006.

Y. Lee and N. Hsu, An optimization model for the container pre-marshalling problem, Computers & Operations Research, vol.34, issue.11, pp.3295-3313, 2007.
DOI : 10.1016/j.cor.2005.12.006

W. Zhu, H. Qin, A. Lim, and H. Zhang, Iterative Deepening A* Algorithms for the Container Relocation Problem, IEEE Transactions on Automation Science and Engineering, vol.9, issue.4, pp.710-722, 2012.
DOI : 10.1109/TASE.2012.2198642