New lower bounds for the three-dimensional orthogonal bin packing problem

Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, CCCG 2011

Volumn , Issue , 2011, Pages

  Hsu, Chia Hong ^a   Liao, Chung Shou ^a  

^a NATIONAL TSING HUA UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

BIN PACKING PROBLEM; LOWER BOUNDS;

BINS; THREE DIMENSIONAL;

COMPUTATIONAL GEOMETRY;

EID: 84883040588     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. M.A. Boschetti. New lower bounds for the threedimensional finite bin packing problem. Discrete Applied Mathematics, 140:241-58, 2004.
2. JM. Bourjolly, V. Rebetez. An analysis of lower bounds procedures for the bin packing problem. Computers & Operations Research, 32:395-405, 2005.
3. J. Carlier, F. Clautiaux, A. Moukrim. New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation. Computers & Operations Research, 34:2223-2250, 2007.
4. F. Clautiaux, C. Alves, J.V. de Carvalho. A survey of dual-feasible and superadditive functions. Annals of Operations Research, 179:317-342, 2010.
5. F. Clautiaux, A. Moukrim, J. Carlier. New datadependent dual-feasible functions and lower bounds for a two dimensional bin-packing problem. International Journal of Production Research, 47(2):537-560, 2009.
6. E.G. Coffman Jr., M.R. Garey, D.S. Johnson. Approximation algorithms for bin-packing: A survey. In D.S. Hochbaum (ed.) Approximation algorithms for NP-hard problems, 46-93, PWS Publishing, Boston MA, 1997.
7. S.P. Fekete, J. Schepers. New classes of fast lower bounds for bin packing problems. Mathematics Programming, 91:11-31, 2001.
8. S.P. Fekete, J. Schepers. A general framework for bounds for higher-dimensional orthogonal packing problems. Mathematical Methods of Operations Research, 60:311-329, 2004.
9. W. Fernandez de la Vega, G.S. Lueker. Bin packing can be solved within 1 + ε in linear time. Combinatorica, 1:349-355. 1981.
10. M.R. Garey, D.S. Johnson. Computers and intractability: A guide to the theory of NP-completeness. W.H. Freeman and Co., New York, 1979.
11. D.S. Johnson. Near-optimal bin packing algorithms. Dissertation, Massachusetts Institute of Technology, Cambridge, Massachusetts, 1973.
12. N. Karmarkar, R.M. Karp. An efficient approximation scheme for the one-dimensional bin packing problem. In Proc. 23rd IEEE Annu. Found. Comp. Sci. (FOCS 82), 312-320, 1982.
13. B.H. Korte, J. Vygen. Combinatorial Optimization Theory and Algorithms (Chapter 18). Springer-Verlag, 2008.
14. M. Labbé, G. Laporte, H. Mercure. Capacitated vehicle routing on trees. Operations Research, 39:616-622, 1991.
15. G.S. Lueker. Bin packing with items uniformly distributed over intervals [a; b]. In Proc. 24th IEEE Annu. Found. Comp. Sci. (FOCS 83), 289-297, 1983.
16. A. Lodi, S. Martello, M. Monaci. Two-dimensional packing problems: A survey. European Journal of Operational Research, 141:241-252, 2002.
17. S. Martello, D. Pisinger, D. Vigo. The threedimensional bin packing problem. Operations Research, 48(2):256-267, 2000.
18. S. Martello, D. Vigo. Exact solution of the twodimensional finite bin packing problem. Management Science, 44:388-399, 1998.
19. S. Martello, P. Toth. Knapsack problems: Algorithms and computer implementations. John Wiley & Sons, Chichester, U.K., 1990.
20. S. Martello, P. Toth. Lower bounds and reduction procedures for the bin packing problem. Discrete Applied Mathematics, 28:59-70, 1990.
21. A. Scholl, R. Klein, C. Jürgens. BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem. Computers & Operations Research, 24:627-645, 1997.
22. S.S. Seiden, R. van Stee New bounds for multidimensional packing. Algorithmica, 36:261-293, 2003.