Journal of Parallel and Distributed Computing
Approximation schemes for covering and packing problems in image processing and VLSI
Journal of the ACM (JACM)
Introduction to Algorithms
On the two-dimensional Knapsack Problem
Operations Research Letters
A two-level search algorithm for 2D rectangular packing problem
Computers and Industrial Engineering
Reactive GRASP for the strip-packing problem
Computers and Operations Research
A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem
Computers and Operations Research
Heuristic algorithm for a cutting stock problem in the steel bridge construction
Computers and Operations Research
A Hybrid Simulated-Annealing Algorithm for Two-Dimensional Strip Packing Problem
ICANNGA '07 Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part I
Collaboration Between Hyperheuristics to Solve Strip-Packing Problems
IFSA '07 Proceedings of the 12th international Fuzzy Systems Association world congress on Foundations of Fuzzy Logic and Soft Computing
A least wasted first heuristic algorithm for the rectangular packing problem
Computers and Operations Research
A Tabu Search Algorithm with Direct Representation for Strip Packing
EvoCOP '09 Proceedings of the 9th European Conference on Evolutionary Computation in Combinatorial Optimization
Brief paper: A revision of recent approaches for two-dimensional strip-packing problems
Engineering Applications of Artificial Intelligence
Brief paper: A revision of recent approaches for two-dimensional strip-packing problems
Engineering Applications of Artificial Intelligence
An optimisation model for airlift load planning: GALAHAD and the quest for the 'holy grail'
CISDA'09 Proceedings of the Second IEEE international conference on Computational intelligence for security and defense applications
An evolutionary hyperheuristic to solve strip-packing problems
IDEAL'07 Proceedings of the 8th international conference on Intelligent data engineering and automated learning
Power efficient voltage islanding for Systems-on-Chip from a floorplanning perspective
Proceedings of the Conference on Design, Automation and Test in Europe
A squeaky wheel optimisation methodology for two-dimensional strip packing
Computers and Operations Research
A genetic programming hyper-heuristic approach for evolving 2-D strip packing heuristics
IEEE Transactions on Evolutionary Computation
A Parallel Branch-and-Bound Approach to the Rectangular Guillotine Strip Cutting Problem
INFORMS Journal on Computing
Computers and Operations Research
A fast layer-based heuristic for non-guillotine strip packing
Expert Systems with Applications: An International Journal
An efficient deterministic heuristic for two-dimensional rectangular packing
Computers and Operations Research
New fast heuristics for the 2d strip packing problem with guillotine constraint
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
A meta-heuristic algorithm for the strip rectangular packing problem
ICNC'05 Proceedings of the First international conference on Advances in Natural Computation - Volume Part III
A simple randomized algorithm for two-dimensional strip packing
Computers and Operations Research
Heuristic for the rectangular strip packing problem with rotation of items
Computers and Operations Research
Expert Systems with Applications: An International Journal
INFORMS Journal on Computing
| Hi-index | 0.01 |
A fast and new heuristic recursive algorithm to find a minimum height for two-dimensional strip rectangular packing problem is presented. This algorithm is mainly based on heuristic strategies and a recursive structure, and its average running time is T(n) = θ(n3). The computational results on a class of benchmark problems have shown that this algorithm not only finds shorter height than the known meta-heuristic ones, but also runs in shorter time. Especially for large test problems, it performs better.