1. B.S. Baker, D.J. Brown, and H.P. Katseff. A 5/4 algorithm for two-dimensional packing. Journal of Algorithms, 2:348--368, 1981.
  2. J.O. Berkey and P.Y. Wong. Two dimensional finite bin packing algorithms. Journal of Operational Research Society, 2:423--429, 1987.
  3. B. Chazelle. The bottom-left bin packing heuristic: An efficient implementation. IEEE Transactions on Computers, 32:697--707, 1983.
  4. F.K.R. Chung, M.R. Garey, and D.S. Johnson. On packing two-dimensional bins. SIAM J. Algebraic Discrete Methods, 3:66--76, 1982.
  5. E.G. Coffman Jr and M.R. Garey and D.S. Johnson and R.E. Tarjan. Performance bounds for level-oriented two-dimensional packing algorithms. SIAM Journal on Computing, 9:808--826, 1980.
  6. F. Diedrich, R. Harren, K. Jansen, R. Thole and Henning Thomas: Approximation Algorithms for 3D Orthogonal Knapsack. TAMC, 34--45, 2007.
  7. J.B. Frenk and G.G. Galambos. Hybrid next-fit algorithm for the two-dimensional rectangle bin-packing problem. Computing, 39:201--217, 1987.
  8. R. Harreni and R. van Stee: Packing Rectangles into 2 OPT Bins using Rotations. To appear in SWAT 2008.
  9. K. Jansen, R. van Stee. On strip packing With rotations. STOC 755--761, 2005.
  10. K. Jansen, R. Solis-Oba. New Approximability Results for 2-Dimensional Packing Problems. MFCS, 103--114, 2007.
  11. C. Kenyon and E. Remila. A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem. Mathematics of Operations Research, 25(4):645--656, 2000.
  12. A. Lodi and S. Martello and D. Vigo. Neighborhood search algorithm for the guillotine non-oriented two-dimensional bin packing problem. In S. Voss and S. Martello and I.H. Osman and C. Roucairol, editors, Meta-Heuristics: Advances and Trends in Local Search Paradigms for optimization, pages 125--139. Kluwer Academic Publishers, Boston, 1998.
  13. A. Lodi and S. Martello and D. Vigo. Approximation algorithms for the oriented two-dimensional bin packing problem. Journal of Operational Research Society, 112:158--166, 1999.
  14. A. Lodi and S. Martello and D. Vigo. Heuristic and metaheuristic approaches for a class of two-dimensional bin packing problems. INFORMS Journal on Computing, 11:345--357, 1999.
  15. I. Schiermeyer. Reverse-fit: A 2-optimal algorithm for packing rectangles. In Proceedings of 2nd European Symposium on Algorithms, pages 290--299, Utrecht, The Netherlands, August 1994.
  16. D.D. Sleator. A 2.5 times optimal algorithm for packing in two dimensions. Information Processing Letters, 10(1):37--40, 1980.
  17. A. Steinberg. A strip-packing algorithm with absolute performance bound 2. SIAM Journal on Computing, 9:401--409, 1997.
  18. G. Zhang. A 3-approximation algorithm for two-dimensional bin packing. Oper. Res. Lett. (ORL), 33(2):121--126, 2005.
back to top