论文信息 - A new lower bound for the non-oriented two-dimensional bin-packing problem

A new lower bound for the non-oriented two-dimensional bin-packing problem

We propose a new scheme for computing lower bounds for the non-oriented bin-packing problem when the bin is a square. It leads to bounds that theoretically dominate previous results. Computational experiments show that the bounds are tight. We also discuss the case where the bin is not a square.

[1] J. O. Berkey,et al. Two-Dimensional Finite Bin-Packing Algorithms , 1987 .

[2] S. Martello,et al. Exact Solution of the Two-Dimensional Finite Bon Packing Problem , 1998 .

[3] Marco A. Boschetti,et al. The two-dimensional finite bin packing problem. Part I: New lower bounds for the oriented case , 2003, 4OR.

[4] Daniele Vigo,et al. A lower bound for the non-oriented two-dimensional bin packing problem , 2002, Discret. Appl. Math..

[5] Volker Kaibel,et al. Integer Programming and Combinatorial Optimization, 11th International IPCO Conference, Berlin, Germany, June 8-10, 2005, Proceedings , 2005, IPCO.

[6] Jacques Carlier,et al. New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation , 2007, Comput. Oper. Res..

[7] Sándor P. Fekete,et al. A General Framework for Bounds for Higher-Dimensional Orthogonal Packing Problems , 2004, Math. Methods Oper. Res..

[8] Gerhard Wäscher,et al. An improved typology of cutting and packing problems , 2007, Eur. J. Oper. Res..

[9] David S. Johnson,et al. Near-optimal bin packing algorithms , 1973 .

[10] Marco A. Boschetti,et al. The Two-Dimensional Finite Bin Packing Problem. Part II: New lower and upper bounds , 2003, 4OR.

[11] Alberto Caprara,et al. Bidimensional Packing by Bilinear Programming , 2005, IPCO.