Packing d-Dimensional Bins in d Stages

References

• Baker B. S., Schwartz J. S. Shelf algorithms for two-dimensional packing problems. SIAM J. Comput. (1983) 12:508–525Crossref, Google Scholar
• Baker B. S., Coffman E. G., Rivest R. L. Orthogonal packing in two dimensions. SIAM J. Comput. (1980) 9:846–855Crossref, Google Scholar
• Bansal N., Caprara A., Sviridenko M. Improved approximation algorithms for multidimensional bin packing problems. Proc. 47th Annual IEEE Sympos. Foundations Comput. Sci. (FOCS 2006) (2006) Berkeley, CA:697–708Crossref, Google Scholar
• Bansal N., Lodi A., Sviridenko M. A tale of two dimensional bin packing. Proc. 46th Annual IEEE Sympos. Foundations Comput. Sci. (FOCS 2005) (2005) Pittsburgh:657–666Crossref, Google Scholar
• Bansal N., Correa J., Kenyon C., Sviridenko M. Bin packing in multiple dimensions: Inapproximability results and approximation schemes. Math. Oper. Res. (2006) 31:31–49Link, Google Scholar
• Bansal N., Han X., Iwama K., Sviridenko M., Zhang G. Harmonic algorithm for 3-dimensional strip packing problem. Proc. 18th Annual ACM-SIAM Sympos. Discrete Algorithms (SODA 2007) (2007) New Orleans:1197–1206Google Scholar
• Caprara A. Packing 2-dimensional bins in harmony. Proc. 43rd Annual IEEE Sympos. Foundations Comput. Sci. (FOCS 2002) (2002) Vancouver:490–499Crossref, Google Scholar
• Caprara A., Lodi A., Monaci M. Fast approximation schemes for two-stage, two-dimensional bin packing. Math. Oper. Res. (2005) 30:136–156Link, Google Scholar
• Chan L. M. A., Simchi-Levi D., Bramel J. Worst-case analyses, linear programming and the bin-packing problem. Math. Programming (1998) 83:213–227Crossref, Google Scholar
• Chung F. R. K., Garey M. R., Johnson D. S. On packing two-dimensional bins. SIAM J. Algebraic Discrete Methods (1982) 3:66–76Crossref, Google Scholar
• Coffman E. G., Garey M. R., Johnson D. S., Tarjan R. E. Performance bounds for level-oriented two-dimensional packing algorithms. SIAM J. Comput. (1980) 9:801–826Crossref, Google Scholar
• Csirik J., van Vliet A. An on-line algorithm for multidimensional bin packing. Oper. Res. Lett. (1993) 13:149–158Crossref, Google Scholar
• Csirik J., Woeginger G. J. Shelf algorithms for on-line strip packing. Inform. Processing Lett. (1997) 63:171–175Crossref, Google Scholar
• Epstein L., van Stee R. Optimal online bounded space multidimensional packing. Proc. 15th Annual ACM-SIAM Sympos. Discrete Algorithms (SODA 2004) (2004) New Orleans:207–216Google Scholar
• Fekete S. P., Schepers J. New classes of fast lower bounds for bin packing problems. Math. Programming (2001) 91:11–31Crossref, Google Scholar
• Fekete S. P., Schepers J. A combinatorial characterization of higher-dimensional orthogonal packing. Math. Oper. Res. (2004) 29:353–368Link, Google Scholar
• Fekete S. P., Schepers J. A general framework for bounds for higher-dimensional orthogonal packing problems. Math. Methods Oper. Res. (2004) 60:311–329Crossref, Google Scholar
• Fernandez de la Vega W., Lueker G. S. Bin packing can be solved within 1+ϵ in linear time. Combinatorica (1981) 1:349–355Crossref, Google Scholar
• Garey M. R., Johnson D. S. A 71/60 theorem for bin packing. J. Complexity (1985) 1:65–106Crossref, Google Scholar
• Gilmore P. C., Gomory R. E. Multistage cutting problems of two and more dimensions. Oper. Res. (1965) 13:94–119Link, Google Scholar
• Johnson D. S., Garey M. R., Graham R. L., Demers A., Ullman J. D. Worst-case performance bounds for simple one-dimensional packing algorithms. SIAM J. Comput. (1974) 3:299–325Crossref, Google Scholar
• Karmarkar N., Karp R. M. An efficient approximation scheme for the one-dimensional bin-packing problem. Proc. 23rd Annual IEEE Sympos. Foundations Comput. Sci. (FOCS 1982) (1982) Chicago:312–320Crossref, Google Scholar
• Kenyon C., Rémila E. A near-optimal solution to a two-dimensional cutting stock problem. Math. Oper. Res. (2000) 25:645–656Link, Google Scholar
• Lee C. C., Lee D. T. A simple on-line bin packing algorithm. J. ACM (1985) 32:562–572Crossref, Google Scholar
• Seiden S. S., van Stee R. New bounds for multi-dimensional packing. Algorithmica (2003) 36:261–293Crossref, Google Scholar
• Seiden S. S., Woeginger G. J. The two-dimensional cutting stock problem revisited. Math. Programming (2005) 102:519–530Crossref, Google Scholar