Upper bounds for heuristic approaches to the strip packing problem
暂无分享,去创建一个
[1] Guntram Scheithauer,et al. Relations between capacity utilization, minimal bin size and bin number , 2014, Ann. Oper. Res..
[2] Greet Vanden Berghe,et al. An effective shaking procedure for 2D and 3D strip packing problems , 2013, Comput. Oper. Res..
[3] Liu Yang,et al. Heuristic for the rectangular strip packing problem with rotation of items , 2013, Comput. Oper. Res..
[4] Hiroshi Nagamochi,et al. An exact strip packing algorithm based on canonical forms , 2012, Comput. Oper. Res..
[5] Yoshiko Wakabayashi,et al. Algorithms for 3D guillotine cutting problems: Unbounded knapsack, cutting stock and strip packing , 2012, Comput. Oper. Res..
[6] Torsten Buchwald. A note on ” Relations between capacity utilization and minimal bin number“ , 2012 .
[7] Andrew Lim,et al. A skyline heuristic for the 2D rectangular packing and strip packing problems , 2011, Eur. J. Oper. Res..
[8] Graham Kendall,et al. A squeaky wheel optimisation methodology for two-dimensional strip packing , 2011, Comput. Oper. Res..
[9] Kun He,et al. An efficient placement heuristic for three-dimensional rectangular packing , 2011, Comput. Oper. Res..
[10] Marco A. Boschetti,et al. An Exact Algorithm for the Two-Dimensional Strip-Packing Problem , 2010, Oper. Res..
[11] Jan H. van Vuuren,et al. New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems , 2010, Eur. J. Oper. Res..
[12] Mutsunori Yagiura,et al. The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio , 2010, Comput. Oper. Res..
[13] Gleb Belov,et al. One-dimensional relaxations and LP bounds for orthogonal packing , 2009, Int. Trans. Oper. Res..
[14] Hiroshi Nagamochi,et al. Exact algorithms for the two-dimensional strip packing problem with and without rotations , 2009, Eur. J. Oper. Res..
[15] Xavier Bonnaire,et al. A revision of recent approaches for two-dimensional strip-packing problems , 2009, Eng. Appl. Artif. Intell..
[16] Jan H. van Vuuren,et al. A survey and comparison of guillotine heuristics for the 2D oriented offline strip packing problem , 2009, Discret. Optim..
[17] Ramón Alvarez-Valdés,et al. A branch and bound algorithm for the strip packing problem , 2009, OR Spectr..
[18] Ramón Alvarez-Valdés,et al. Reactive GRASP for the strip-packing problem , 2008, Comput. Oper. Res..
[19] Klaus Jansen,et al. Approximation Algorithms for 3D Orthogonal Knapsack , 2007, Journal of Computer Science and Technology.
[20] Jacques Carlier,et al. New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation , 2007, Comput. Oper. Res..
[21] Andreas Bortfeldt,et al. A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces , 2006, Eur. J. Oper. Res..
[22] Leah Epstein,et al. This side up! , 2006, TALG.
[23] Graham Kendall,et al. A New Placement Heuristic for the Orthogonal Stock-Cutting Problem , 2004, Oper. Res..
[24] Sándor P. Fekete,et al. A General Framework for Bounds for Higher-Dimensional Orthogonal Packing Problems , 2004, Math. Methods Oper. Res..
[25] Daniele Vigo,et al. An Exact Approach to the Strip-Packing Problem , 2003, INFORMS J. Comput..
[26] Andrea Lodi,et al. Two-dimensional packing problems: A survey , 2002, Eur. J. Oper. Res..
[27] Yoshiko Wakabayashi,et al. Approximation Algorithms for the Orthogonal Z-Oriented Three-Dimensional Packing Problem , 1999, SIAM J. Comput..
[28] A. Steinberg,et al. A Strip-Packing Algorithm with Absolute Performance Bound 2 , 1997, SIAM J. Comput..
[29] Ingo Schiermeyer,et al. Reverse-Fit: A 2-Optimal Algorithm for Packing Rectangles , 1994, ESA.
[30] Harald Dyckhoff,et al. Cutting and Packing in Production and Distribution , 1992 .
[31] Robert E. Tarjan,et al. Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms , 1980, SIAM J. Comput..
[32] Ronald L. Rivest,et al. Orthogonal Packings in Two Dimensions , 1980, SIAM J. Comput..
[33] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[34] Jeffrey D. Ullman,et al. Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms , 1974, SIAM J. Comput..