An Exact Approach to the Strip-Packing Problem
INFORMS Journal on Computing
Exhaustive approaches to 2D rectangular perfect packings
Information Processing Letters
New heuristic and interactive approaches to 2D rectangular strip packing
Journal of Experimental Algorithmics (JEA)
New Large Benchmark Instances for the Two-Dimensional Strip Packing Problem with Rectangular Pieces
HICSS '06 Proceedings of the 39th Annual Hawaii International Conference on System Sciences - Volume 02
A new heuristic recursive algorithm for the strip rectangular packing problem
Computers and Operations Research
BubbleSearch: a simple heuristic for improving priority-based greedy algorithms
Information Processing Letters
A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
Operations Research
The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation
IEEE Transactions on Computers
Incremental Move for 2D Strip-Packing
ICTAI '07 Proceedings of the 19th IEEE International Conference on Tools with Artificial Intelligence - Volume 02
GPU accelerated cryptography as an OS service
Transactions on computational science XI
A review of the application of swarm intelligence algorithms to 2D cutting and packing problem
ICSI'11 Proceedings of the Second international conference on Advances in swarm intelligence - Volume Part I
Data Structures for Higher-Dimensional Rectilinear Packing
INFORMS Journal on Computing
Heuristic for the rectangular strip packing problem with rotation of items
Computers and Operations Research
| Hi-index | 0.00 |
In this paper, we present a review of the recent approaches proposed in the literature for strip-packing problems. Many of them have been concurrently published, given some similar results for the same set of benchmarks. Due to the quantity of published papers, it is difficult to ascertain the level of current research in this area.