Packing Rectangles into 2OPT Bins Using Rotations
暂无分享,去创建一个
[1] Guochuan Zhang,et al. A 3-approximation algorithm for two-dimensional bin packing , 2005, Oper. Res. Lett..
[2] Klaus Jansen,et al. New Approximability Results for 2-Dimensional Packing Problems , 2007, MFCS.
[3] Rob van Stee,et al. An approximation algorithm for square packing , 2004, Oper. Res. Lett..
[4] Jan van Leeuwen,et al. Algorithms — ESA '94 , 1994, Lecture Notes in Computer Science.
[5] Alberto Caprara,et al. Fast Approximation Schemes for Two-Stage, Two-Dimensional Bin Packing , 2005, Math. Oper. Res..
[6] Claire Mathieu,et al. A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem , 2000, Math. Oper. Res..
[7] José R. Correa,et al. Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes , 2006, Math. Oper. Res..
[8] Joseph Y.-T. Leung,et al. Packing Squares into a Square , 1990, J. Parallel Distributed Comput..
[9] Alberto Caprara,et al. Improved approximation algorithms for multidimensional bin packing problems , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).
[10] Robert E. Tarjan,et al. Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms , 1980, SIAM J. Comput..
[11] Ingo Schiermeyer,et al. Reverse-Fit: A 2-Optimal Algorithm for Packing Rectangles , 1994, ESA.
[12] Klaus Jansen,et al. Maximizing the Total Profit of Rectangles Packed into a Rectangle , 2007, Algorithmica.
[13] Miroslav Chlebík,et al. Inapproximability Results for Orthogonal Rectangle Packing Problems with Rotations , 2006, CIAC.
[14] Klaus Jansen,et al. On strip packing With rotations , 2005, STOC '05.
[15] L. Moser,et al. On packing of squares and cubes , 1968 .
[16] A. Steinberg,et al. A Strip-Packing Algorithm with Absolute Performance Bound 2 , 1997, SIAM J. Comput..