An improved BL lower bound

DOI10.1016/0020-0190(80)90031-9MaRDI QIDQ1144945zbMATH OpenOpenAlexFDO

Authors 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) Discrete mathematics in relation to computer science (68R99) Combinatorial aspects of packing and covering (05B40)

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A algorithm for two-dimensional packing
• Lower bounds for on-line two-dimensional packing algorithms
• Orthogonal Packings in Two Dimensions
• Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
• Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms

Cited in

(9)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1144945)