Packing 2-dimensional bins in harmony

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2002, Pages 490-499

  Caprara, Alberto ^a  

^a UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; ASYMPTOTIC STABILITY; BINS; COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; PACKING; POLYNOMIALS;

ASYMPTOTIC WORSE CASE RATIO; FINITE BIN PACKING; HARMONIC ALGORITHM;

MATHEMATICAL PROGRAMMING;

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

References (21)

1. B. S. Baker, E. G. Coffman, Jr., and R. L. Rivest. Orthogonal packing in two dimensions. SIAM Journal on Computing, 9:846-855, 1980.
2. B. S. Baker and J. S. Schwartz. Shelf algorithms for two-dimensional packing problems. SIAM Journal on Computing, 12:508-525, 1983.
3. A. Caprara, A. Lodi, and M. Monaci. An approximation scheme for the two-stage, two-dimensional bin packing problem. In Proceedings of the 9th Conference on Integer Programming and Combinatorial Optimization (IPCO 2002), 2002.
4. L. M. A. Chan, D. Simchi-Levi, and J. Bramel. Worst-case analyses, linear programming and the bin-packing problem. Mathematical Programming, 83:213-227, 1998.
5. F. R. K. Chung, M. R. Garey, and D. S. Johnson. On packing two-dimensional bins. SIAM Journal on Algebraic and Discrete Methods, 3:66-76, 1982.
6. E. G. Coffman, Jr., J. Csirik, and G. J. Woeginger. Approximate solutions to bin packing problems. In P. M. Pardalos and M. G. C. Resende, editors, Handbook of Applied Optimization. Oxford University Press, 607-615, 2002.
7. E. G. Coffman, Jr., M. R. Garey, and D. S. Johnson. Approximation algorithms for bin packing: A survey. In D. S. Hochbaum, editor, Approximation Algorithms for NP-Hard Problems. PWS Publishing Company, 46-93, 1997.
8. E. G. Coffman, Jr., M. R. Garey, D. S. Johnson, and R. E. Tarjan. Performance bounds for level-oriented two-dimensional packing algorithms. SIAM Journal on Computing, 9:801-826, 1980.
9. J. Csirik and G. J. Woeginger. Shelf algorithms for on-line strip packing. Information Processing Letters, 63:171-175, 1997.
10. S. P. Fekete and J. Schepers. On more-dimensional packing I: Modeling. Technical Report ZPR97-288, Mathematisches Institut, Universität zu Köln, 1997.
11. S. P. Fekete and J. Schepers. On more-dimensional packing II: Bounds. Technical Report ZPR97-289, Mathematisches Institut, Universität zu Köln, 1997.
12. S. P. Fekete and J. Schepers. New classes of fast lower bounds for bin packing problems. Mathematical Programming, 91:11-31, 2001.
13. W. Fernandez de la Vega and G. S. Lueker. Bin packing can be solved within 1 + ε in linear time. Combinatorica, 1(4):349-355, 1981.
14. M. R. Garey and D. S. Johnson. A 71/60 theorem for bin packing. Journal of Complexity, 1:65-106, 1985.
15. P. C. Gilmore and R. E. Gomory. Multistage cutting problems of two and more dimensions. Operations Research, 13:94-119, 1965.
16. D. S. Johnson. The NP-completeness column: An ongoing guide. Journal of Algorithms, 3:288-300, 1982.
17. N. Karmarkar and R. M. Karp. An efficient approximation scheme for the one-dimensional bin-packing problem. In Proceedings of the 23rd Annual IEEE Symposium on the Foundations of Computer Science (FOCS 1982), 312-320, 1982.
18. C. Kenyon and E. Rémila. A near-optimal solution to a two-dimensional cutting stock problem. Mathematics of Operations Research, 25:645-656, 2000.
19. C. C. Lee and D. T. Lee. A simple on-line bin packing algorithm. Journal of the ACM 32:562-572, 1985.
20. K. Li and K. H. Cheng. A generalized harmonic algorithm for on-line multidimensional bin packing. Technical Repot TR UH-CS-90-2. University of Huston, 1990.
21. S. S. Seiden and R. van Stee. New bounds for multi-dimensional packing. In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2002), 2002.