Bin packing in multiple dimensions: Inapproximability results and approximation schemes

Mathematics of Operations Research

Volumn 31, Issue 1, 2006, Pages 31-49

  Bansal, Nikhil ^a   Correa, José R ^b   Kenyon, Claire ^c   Sviridenko, Maxim ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b School of Business   (Chile)

^c Brown Univerity   (United States)

Author keywords

Approximation algorithms; Bin packing; Hardness of approximation; Polynomial time approximation schemes

Indexed keywords

APPROXIMATION ALGORITHMS; BIN PACKING; HARDNESS OF APPROXIMATIONS; POLYNOMIAL TIME APPROXIMATION SCHEMES;

ALGORITHMS; APPROXIMATION THEORY; MATHEMATICAL MODELS; ONE DIMENSIONAL; POLYNOMIALS; THEOREM PROVING;

PROBLEM SOLVING;

EID: 33646748373     PISSN: 0364765X     EISSN: 15265471     Source Type: Journal    
DOI: 10.1287/moor.1050.0168     Document Type: Article

References (33)

1. Baker, B. S., D. J. Brown, H. P. Kasteff. 1981. A 5/4 algorithm for two-dimensional packing. J. Algorithms 2 348-368.
2. Berman, P., M. Karpinski. 2003. Improved approximation lower bounds on small occurrence optimization.
3. Caprara, A. 2002. Packing two-dimensional bins in harmony. Proc. 43rd IEEE Sympos. Foundations Comput. Sci. (FOCS). IEEE, Vancouver, Canada, 490-499.
4. Caprara, A., A. Lodi, M. Monaci. 2005. Fast approximation schemes for two-stage, two-dimensional bin packing. Math. Oper. Res. 30 136-156.
5. Chekuri, C., S. Khanna. 1999. On multi-dimensional packing problems. Proc. 10th ACM-SIAM Sympos. Discrete Algorithms (SODA). ACM-SIAM, Baltimore, MD, 185-194.
6. Chung, F. R. K., M. R. Garey, D. S. Johnson. 1982. On packing two-dimensional bins. SIAM J. Algebraic Discrete Methods 3 66-76.
7. Coffman, E. G., M. R. Garey, D. S. Johnson. 1996. Approximation algorithms for bin packing: A survey. D. Hochbaum, ed. Approximation Algorithms for NP-Hard Problems. PWS Publishing, Boston, MA, 46-93.
8. Coffman, E. G., M. R. Garey, D. S. Johnson, R. E. Tarjan. 1980. Performance bounds for level-oriented two-dimensional packing algorithms. SIAM J. Comput. 9 808-826.
9. Csirik, J., A. van Vliet. 1993. An on-line algorithm for multidimensional bin packing. Oper. Res. Lett. 13 149-158.
10. Csirik, J., G. Woeginger. 1998. On-line packing and covering problems. A. Fiat, G. Woeginger, eds. Online Algorithms: The State of the Art, Lecture Notes in Computer Science, Vol. 1442. Springer. 147-177.
11. Epstein, L., R. van Stee. 2004. Optimal online bounded space multidimensional packing. Proc. 15th ACM-SIAM Sympos. Discrete Algorithms (SODA). ACM-SIAM, New Orleans, LA, 207-216.
12. Fernandez de la Vega, W., G. Lueker. 1981. Bin packing can be solved within 1 + ε in linear time. Combinatorica 1 349-355.
13. Ferreira, C. E., F. K. Miyazawa, Y. Wakabayashi. 1999. Packing squares into squares. Pesquisa Operacional 19 223-237.
14. Hazan, E., S. Safra, O. Schwartz. 2003. On the complexity of approximating k-dimensional matching. Proc. 6th Internat. Workshop on Approximation Algorithms for Combin. Optim. Problems and of the 7th Internat. Workshop on Randomization and Comput. (RANDOM-APPROX), Lecture Notes in Computer Science, Vol. 2764. Springer, Berlin, Germany, 83-97.
15. Jansen, K., G. Zhang. 2004. On rectangle packing: Maximizing benefits. Proc. 15th ACM-SIAM Sympos. Discrete Algorithms (SODA). ACM-SIAM, New Orleans, LA, 197-206.
16. Kann, V. 1991. Maximum bounded 3-dimensional matching is MAX SNP-complete. Inform. Processing Lett. 37 27-35.
17. Karmarkar, N., R. M. Karp. 1982. An efficient approximation scheme for the one-dimensional bin-packing problem. Proc. 23rd IEEE Sympos. Foundations Comput. Sci. (FOCS). IEEE, New York, 312-320.
18. Kenyon, C., E. Rémila. 2000. A near-optimal solution to a two-dimensional cutting stock problem. Math. Oper. Res. 25 645-656.
19. Kleitman, D. J., M. Krieger. 1975. An optimal bound for two-dimensional packing. Proc. 16th IEEE Sympos. Foundations Comput. Sci. (FOCS). IEEE, Berkeley, CA, 163-168.
20. Kohayakawa, Y., F. K. Miyazawa, P. Raghavan, Y. Wakabayashi. 2004. Multidimensional cube packing. Algorithmica 40 173-187.
21. Korf, R. 2003. Optimal rectangle packing: Initial results. Proc. 13th Internat. Conf. on Automated Planning and Scheduling (ICAPS). AAAI, Trento, Italy, 287-295.
22. Lenstra, H. W. 1983. Integer programming with a fixed number of variables. Math. Oper. Res. 8 538-548.
23. Leung, J. Y. T., T. W. Tam, C. S. Wong, G. H. Young, F. Y. L. Chin. 1990. Packing squares into a square. J. Parallel Distributed Comput. 10 271-275.
24. Meir, A., L. Moser. 1968. On packing of squares and cubes. J. Combin. Theory. Ser. A 5 126-134.
25. Moser, L. 1965. Poorly formulated unsolved problems of combinatorial geometry. Mimeographed.
26. Murata, H., K. Fujiyoshi, S. Nakatake, Y. Kajitani. 1996. VLSI module placement based on rectangle-packing by the sequence-pair. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 15 1518-1524.
27. Novotny, P. 1996. On packing of squares into a rectangle. Archivum Mathematicum 32 75-83.
28. Petrank, E. 1994. The hardness of approximation: Gap location. Comput. Complexity 4 133-157.
29. Seiden, S., R. van Stee. 2003. New bounds for multi-dimensional packing. Aigorithmica 36 261-293.
30. Sevastianov, S., G. Woeginger. 1998. Makespan minimization in open shops: A polynomial time approximation scheme. Math. Programming Ser. B 82 191-198.
31. van Stee, R. 2004. An approximation algorithm for square packing. Oper. Res. Lett. 32 535-539.
32. Vazirani, V. 2001. Approximation Algorithms. Springer, Berlin, Germany.
33. Woeginger, G. 1997. There is no asymptotic PTAS for two-dimensional vector packing. Inform. Processing Lett. 64 293-297.