An improved BL lower bound

DOI10.1016/0020-0190(80)90031-9zbMath0444.68062OpenAlexW1974711138MaRDI QIDQ1144945

Donna J. Brown

Publication date: 1980

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(80)90031-9

zbMATH Keywords

lower boundbin packing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial aspects of packing and covering (05B40) Discrete mathematics in relation to computer science (68R99)

Related Items (9)

Exhaustive approaches to 2D rectangular perfect packings ⋮ Packing problems ⋮ Recent advances on two-dimensional bin packing problems ⋮ A systematic approach for the three-dimensional palletization problem ⋮ Greed in resource scheduling ⋮ On genetic algorithms for the packing of polygons ⋮ Bubblesearch: a simple heuristic for improving priority-based greedy algorithms ⋮ An algorithm for polygon placement using a bottom-left strategy ⋮ Two-dimensional packing problems: a survey

Cites Work

• Unnamed Item
• Lower bounds for on-line two-dimensional packing algorithms
• Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
• Orthogonal Packings in Two Dimensions
• A algorithm for two-dimensional packing
• Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms

This page was built for publication: An improved BL lower bound