Two- and three-dimensional parametric packing

Computers and Operations Research

Volumn 34, Issue 9, 2007, Pages 2589-2603

  Miyazawa, F K ^a   Wakabayashi, Y ^b  

^a UNIVERSITY OF CAMPINAS   (Brazil)

^b UNIVERSITY OF SÃO PAULO   (Brazil)

Author keywords

Approximation algorithms; Asymptotic performance; Packing

Indexed keywords

ALGORITHMS; ASYMPTOTIC STABILITY; PROBLEM SOLVING; THREE DIMENSIONAL; TWO DIMENSIONAL;

APPROXIMATION ALGORITHMS; ASYMPTOTIC PERFORMANCE; PARAMETRIC PACKING; THREE DIMENSIONAL BIN PACKING PROBLEMS;

APPROXIMATION THEORY;

EID: 33846594857     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2005.10.001     Document Type: Article

References (21)

1. Li K., and Cheng K.-H. Static job scheduling in partitionable mesh connected systems. Journal of Parallel and Distributed Computing 10 (1990) 152-159
2. Johnson D.S., Demers A., Ullman J.D., Garey M.R., and Graham R.L. Worst-case performance bounds for simple one-dimensional packing algorithms. SIAM Journal on Computing 3 (1974) 299-325
3. Johnson DS. Near-optimal bin packing algorithms. PhD thesis, Massachusetts Institute of Technology, Cambridge, MA; 1973.
4. Johnson D.S. Fast algorithms for bin packing. Journal of Computer and System Sciences 8 (1974) 272-314
5. Csirik J. The parametric behavior of the first-fit decreasing bin packing algorithm. Journal of Algorithms 15 (1993) 1-28
6. Coffman Jr. E.G., Garey M.R., Johnson D.S., and Tarjan R.E. Performance bounds for level oriented two-dimensional packing algorithms. SIAM Journal on Computing 9 (1980) 808-826
7. Frenk J.B., and Galambos G. Hybrid next fit algorithm for the two-dimensional rectangle bin packing problem. Computing 39 (1987) 201-217
8. Miyazawa F.K., and Wakabayashi Y. Parametric on-line algorithms for packing rectangles and boxes. European Journal of Operational Research 150 (2003) 281-292
9. Li K., and Cheng K.-H. On three-dimensional packing. SIAM Journal on Computing 19 (1990) 847-867
10. Coffman Jr. E.G., Garey M.R., and Johnson D.S. Approximation algorithms for bin packing-an updated survey. In: Ausiello G., Lucertini M., and Serafini P. (Eds). Algorithms design for computer system design (1984), Springer, New York 49-106
11. Coffman Jr. E.G., Garey M.R., and Johnson D.S. Approximation algorithms for bin packing: a survey. In: Hochbaum D. (Ed). Approximation Algorithms for NP-hard Problems (1997), PWS, MA 46-93 [chapter 2]
12. Lodi A., Martello S., and Monaci M. Two-dimensional packing problems: a survey. European Journal of Operational Research 141 2 (2002) 241-252
13. Lodi A., Martello S., and Vigo D. Recent advances on two-dimensional bin packing problems. Discrete and Applied Mathematics 123 (2002) 379-396
14. Martello S., Monaci M., and Vigo D. An exact approach to the strip-packing problem. INFORMS Journal on Computing 15 3 (2003) 310-319
15. Martello S., and Vigo D. Exact solution of the finite two-dimensional bin packing problem. Management Science 44 2 (1998) 388-399
16. Martello S., Pisinger D., and Vigo D. The three-dimensional bin packing problem. Operations Research 48 2 (2000) 256-267
17. Wäscher G, Haußner H, Schumann H. An improved typology of cutting and packing problems. Technical Report Working Paper 24, Otto von Guericke University Magdeburg, 2005.
18. Miyazawa FK, Wakabayashi Y. Two- and three-dimensional parametric packing problems, Proceedings of GRACO: Brazilian symposium on graphs, algorithms and combinatorics. Electronic notes in discrete mathematics, vol. 19. 2005. p. 313-19.
19. Miyazawa F.K., and Wakabayashi Y. An algorithm for the three-dimensional packing problem with asymptotic performance analysis. Algorithmica 18 1 (1997) 122-144
20. Miyazawa F.K., and Wakabayashi Y. Approximation algorithms for the orthogonal z-oriented 3-D packing problem. SIAM Journal on Computing 29 3 (2000) 1008-1029
21. Chung F.R.K., Garey M.R., and Johnson D.S. On packing two dimensional bins. SIAM Journal on Algebraic and Discrete Methods 3 (1982) 66-76