Column Generation Based Heuristic for the Three Dimensional Vehicle Loading Problem - Computational Logistics - page 268

References
1. Crainic, T., Perboli, G., Tadei, R.: Extreme Point-Based Heuristics for Three-Dimensional
Bin Packing. INFORMS Journal on Computing 20(3), 368-384 (2008)
2. Crainic, T., Perboli, G., Tadei, R.: TS 2 PACK: A two-level tabu search for the three-
dimensional bin packing problem. European Journal of Operational Research 195, 744-
760 (2009)
3. Pisinger, D.: Heuristics for the container loading problem. European Journal of Operation-
al Research 141, 382-392 (2002)
4. Iori, M., Martello, S.: Routing problems with loading constraints. Top 18, 4-27 (2010)
5. Martello, S., Pisinger, D., Vigo, D.: The three-dimensional bin packing problem. Opera-
tions Research 48, 256-267 (2000)
6. Den Boef, E., Korst, J., Martello, S., Pisinger, D., Vigo, D.: Erratum to “The three-
dimensional bin packing problem”: Robot-packable and orthogonal variants of packing
problems. Operations Research 53(4), 735-736 (2005)
7. Fekete, S., Schepers, J.: A new exact algorithm for general orthogonal d-dimensional
knapsack problems. In: Burkard, R.E., Woeginger, G.J. (eds.) ESA 1997. LNCS,
vol. 1284, pp. 144-156. Springer, Heidelberg (1997)
8. Boschetti, M.: New lower bounds for the finite three-dimensional bin packing problem.
Discrete Applied Mathematics 140, 241-258 (2004)
9. Gehring, H., Bortfeldt, A.: A genetic algorithm for solving the container loading problem.
International Transactions in Operational Research 4, 401-418 (1997)
10. Lodi, A., Martello, S., Vigo, D.: Heuristic algorithms for the three-dimensional bin pack-
ing problem. European Journal of Operational Research 141, 410-420 (2002)
11. Gilmore, P., Gomory, R.: A linear programming approch to the cutting-stock problem (part
I). Operations Research 9, 849-859 (1961)
12. Gilmore, P., Gomory, R.: Multistage cutting-stock problems of two and more dimensions.
Operations Research 13, 90-120 (1965)
13. Oliveira, J., Ferreira, J.: A faster variant of the Gilmore and Gomory technique for cutting
stock problems. JORBEL- Belgium Journal of Operations Research, Statistics and Com-
puter Science 34(1), 23-38 (1994)
14. Monaci, M., Toth, P.: A set covering based heuristic approach for bin-packing problems.
INFORMS Journal on Computing 18, 71-85 (2006)
15. Pisinger, D., Sigurd, M.: Using decomposition techniques and constraint programming for
solving the two-dimensional bin-packing problem. INFORMS Journal on Computing 19,
36-51 (2007)
16. Puchinger, J., Raidl, G.: Models and algorithms for three-stage two-dimensional bin pack-
ing. European Journal of Operational Research 183, 1304-1327 (2007)
17. Chen, C., Lee, S., Shen, Q.: An analytical model for the container loading problem. Euro-
pean Journal of Operational Research 80, 68-76 (1995)
18. Ryan, D., Foster, B.: An integer programming approach to scheduling. In: Wren, A. (ed.)
Computer Scheduling of Public Transport Urban Passenger Vehicle and Crew Scheduling,
Amsterdam, The Netherlands, pp. 269-280 (1981)
19. Berkey, J., Wang, P.: Two dimensional finite bin packing algorithms. Journal of the Op-
erational Research Society 38, 423-429 (1987)