Worst-case analysis of fast heuristics for packing squares into a square
From MaRDI portal
Publication:1365944
DOI10.1016/0304-3975(95)00184-0zbMath0877.68039OpenAlexW2093946380MaRDI QIDQ1365944
Publication date: 10 September 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(95)00184-0
Related Items (5)
Logic based Benders' decomposition for orthogonal stock cutting problems ⋮ Packing unequal rectangles and squares in a fixed size circular container using formulation space search ⋮ Models and algorithms for packing rectangles into the smallest square ⋮ Worst-case analysis of fast heuristics for packing squares into a square ⋮ Packing into the smallest square: worst-case analysis of lower bounds
Cites Work
- A 71/60 theorem for bin packing
- An improved lower bound for on-line bin packing algorithms
- Lower bounds for 1-, 2- and 3-dimensional on-line bin packing algorithms
- Worst-case analysis of fast heuristics for packing squares into a square
- The Parametric Behavior of the First-Fit Decreasing Bin Packing Algorithm
- A new proof for the first-fit decreasing bin-packing algorithm
- Tight Worst-Case Performance Bounds for Next-k-Fit Bin Packing
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
- Worst-Case Analysis of Heuristics for the Bin Packing Problem with General Cost Structures
This page was built for publication: Worst-case analysis of fast heuristics for packing squares into a square
