Algorithms in C
A Strip-Packing Algorithm with Absolute Performance Bound 2
SIAM Journal on Computing
A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem
Mathematics of Operations Research
The Art of Computer Programming Volumes 1-3 Boxed Set
The Art of Computer Programming Volumes 1-3 Boxed Set
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
INFORMS Journal on Computing
On strip packing With rotations
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
Operations Research
Reactive GRASP for the strip-packing problem
Computers and Operations Research
The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation
IEEE Transactions on Computers
A Simulated Annealing Enhancement of the Best-Fit Heuristic for the Orthogonal Stock-Cutting Problem
INFORMS Journal on Computing
A squeaky wheel optimisation methodology for two-dimensional strip packing
Computers and Operations Research
An Exact Algorithm for the Two-Dimensional Strip-Packing Problem
Operations Research
Expert Systems with Applications: An International Journal
An effective shaking procedure for 2D and 3D strip packing problems
Computers and Operations Research
| Hi-index | 0.01 |
We investigate the best-fit heuristic algorithm by Burke et al. [2004. A new placement heuristic for the orthogonal stock-cutting problem. Operations Research 52, 655-671] for the rectangular strip packing problem. For its simplicity and good performance, the best-fit heuristic has become one of the most significant algorithms for the rectangular strip packing. In this paper, we propose an efficient implementation of the best-fit heuristic that requires O(n) space and O(nlogn) time, where n is the number of rectangles. We prove that this complexity is optimal, and we also show the practical usefulness of our implementation via computational experiments. Furthermore, we give the worst-case approximation ratio of the best-fit heuristic.